New applications of failure functions
- 1 July 1987
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 34 (3) , 616-625
- https://doi.org/10.1145/28869.28875
Abstract
Presented are several algorithms 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.Keywords
This publication has 3 references indexed in Scilit:
- Efficient optimal pagination of scrollsCommunications of the ACM, 1985
- Optimal pagination of B-trees with variable-length itemsCommunications of the ACM, 1984
- Pagination of B*-trees with variable-length recordsCommunications of the ACM, 1977