Space-efficient finger search on degree-balanced search trees (2003)

by Guy E. Blelloch , Bruce M. Maggs , Shan Leung , Maverick Woo
Venue:In SODA
Citations:10 - 1 self

Documents Related by Co-Citation

45 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof – Richard Cole
139 Randomized Search Trees – Raimund Seidel, Cecilia R. Aragon - 1996
59 A new representation for linear lists – L Guibas, E McCreight, M Plass, J Roberts - 1977
330 Skip Lists: A Probabilistic Alternative to Balanced Trees – William Pugh - 1990
42 Short Encodings of Planar Graphs and Maps – Kenneth Keeler, Jeffery Westbrook - 1993
142 Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs – J. Ian Munro, Venkatesh Raman, J. Ian, Munro Venkatesh Raman - 1999
255 Organization and maintenance of large ordered indexes – R Bayer, E McCreight - 1972
177 An algorithm for the organization of information – G Adelson-Velskii, E M Landis - 1962
28 A skip list cookbook – William Pugh - 1990
51 TARJAN, Design and analysis of a data structure for representing sorted lists – M R BROWN, R E
97 A new data structure for representing sorted lists – S Huddleston, K Mehlhorn - 1982
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
42 Alternatives to splay trees with O(log n) worst-case access times – J Iacono - 2001
22 On the deque conjecture for the splay algorithm – R Sundar - 1992
37 AN O(n log log n)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON – Robert E. Tarjan, Christopher J. Van Wyk - 1988
30 Sequential access in splay trees takes linear time – R E Tarjan - 1985
13 Compact hash tables using bidirectional linear probing – J G Cleary - 1984
24 A Fast General Methodology For Information-Theoretically Optimal Encodings Of Graphs – Xin He, Ming-yang Kao, Hsueh-I Lu - 1999
79 On the succinct representation of graphs – G Turan - 1984