New Applications of Failure Functions (1987)
by
D. S. Hirschberg
,
L. L. Larmore
| Venue: | JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY |
| Citations: | 3 - 0 self |
BibTeX
@ARTICLE{Hirschberg87newapplications,
author = {D. S. Hirschberg and L. L. Larmore},
title = {New Applications of Failure Functions},
journal = {JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY},
year = {1987},
volume = {34},
pages = {34--3}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Several algorithms are presented whose operations are governed by a principle of failure functions: when searching for an extremal value within a sequence, it suffices to consider only the subsequence of items each of which is the first possible improvement of its predecessor. These algorithms are more efficient than their more traditional counterparts.
Citations
| 2172 | The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974 |
| 546 | Fast pattern matching in strings - Knuth, Morris, et al. - 1977 |
| 42 | Breaking paragraphs into lines - Knuth, Plass - 1982 |
| 8 | Optimal pagination of B-trees with variablelength items - Diehr, Faaland - 1984 |
| 7 | Pagination of B*-trees with variable-length records - McCreight - 1977 |
| 5 | Efficient optimal pagination of scrolls - Larmore, Hirschberg - 1985 |
