Efficient Optimal Pagination of Scrolls (1985)

Cached

Download Links

by L. L. Larmore , D. S. Hirschberg
Venue:COMMUNICATIONS OF THE ACM
Citations:5 - 2 self

Documents Related by Co-Citation

8 Optimal pagination of B-trees with variablelength items – G Diehr, B Faaland - 1984
7 Pagination of B*-trees with variable-length records – Edward M McCreight - 1977
52 Breaking paragraphs into lines – D E Knuth, M F Plass - 1998
44 Retrieval of Partial Documents – Allstair Moffat, Ron Sacks-davis, Ross Wilkinson, Justin Zobel - 1994
42 Efficient Passage Ranking for Document Databases – Marcin Kaszkiel, Justin Zobel, Ron Sacks-davis - 1999
629 Fast pattern matching in strings – D E Knuth, J Morris, V R Pratt - 1977
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
4 Optimal multiway search trees for variable size keys – J L Szwarcfiter - 1984
1 The concave least weight subsequence revisited – R Wilber - 1987
33 The Least Weight Subsequence Problem – D S Hirshberg, L L Larmore - 1987
30 Efficient dynamic programming using quadrangle inequalities – F F Yao - 1980
125 Geometric applications of a matrix-searching algorithm – A Aggarwal, M Klave, S Moran, P Shor, R Wilber - 1987
6 Real-time simulation of concatenable double-ended queues by double-ended queues – R Kosaraju - 1979
1 Postorder hierarchy for path compressions and set union – M Loebl, J Nesetril - 1988
1 Pagination of B 3 -trees with variable-length records – E M McCreight - 1977
4 Computing external farthest neighbors for a simple polygon – P K Agarwal, A Aggarwal, B Aronov, S R Kosaraju, B Schieber, S Suri - 1991
22 Deques with heap order – H Gajewska, R E Tarjan - 1986
16 A Linear Algorithm for Analysis of Minimum Spanning and Shortest Path Trees of Planar Graphs – Heather Booth, Jeffery Westbrook - 1992
9 Description and analysis of an Efficient Priority Queue Representation – J FRANÇON, G VIENNOT, J VUILLEMIN - 1978