Efficient optimal pagination of scrolls
Communications of the ACM
Optimal pagination of B-trees with variable-length items
Communications of the ACM
Pagination of B*-trees with variable-length records
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
High-quality pagination for publishing
Software—Practice & Experience
| Hi-index | 0.00 |
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.