Documents Related by Co-Citation

330 Skip Lists: A Probabilistic Alternative to Balanced Trees – William Pugh - 1990
139 Randomized Search Trees – Raimund Seidel, Cecilia R. Aragon - 1996
177 An algorithm for the organization of information – G Adelson-Velskii, E M Landis - 1962
55 lists: A probabilistic alternative to balanced trees – Skip - 1990
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
82 Binary search trees of bounded balance – J Nievergelt, M Reingold E - 1973
39 A fast merging algorithm – M R Brown, R E Tarjan - 1979
255 Organization and maintenance of large ordered indexes – R Bayer, E McCreight - 1972
45 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof – Richard Cole
795 Managing Gigabytes: Compressing and Indexing Documents and Images - Errata – I. H. Witten, A. Moffat, T. C. Bell - 1996
41 Deterministic skip lists – J I Munro, T Papadakis, R Sedgewick - 1992
45 A simple algorithm for merging two disjoint linearly-ordered sets – F. K. Hwang, S. Lin - 1972
51 TARJAN, Design and analysis of a data structure for representing sorted lists – M R BROWN, R E
235 A dichromatic framework for balanced trees – Leo J Guibas, Robert Sedgewick - 1978
114 Optimum binary search trees – D Knuth - 1971
26 Nearly optimal binary search trees – K Mehlhorn - 1975
15 Finger Search Trees with Constant Insertion Time – Gerth Stølting Brodal - 1997
10 A data structure with movable fingers and deletions – D Harel, G S Lueker - 1979