Documents Related by Co-Citation

279 Skip Lists: A Probabilistic Alternative to Balanced Trees – William Pugh - 1990
126 Randomized Search Trees – Raimund Seidel, Cecilia R. Aragon - 1996
154 An algorithm for the organization of information – G Adelson-Velskii, E M Landis - 1962
50 lists: a probabilistic alternative to balanced trees – Skip - 1990
334 Self-adjusting binary search trees – D D AND TARJAN SLEATOR, R E - 1985
70 Binary Search Trees of Bounded Balance – Jürg Nievergelt, Edward M Reingold - 1972
34 A Fast Merging Algorithm – M R Brown, R E Tarjan - 1979
7324 Cache-oblivious algorithms – M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN - 1999
229 Organization and Maintenance of Large Ordered Indexes – R Bayer, E McCreight - 1972
36 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof – Richard Cole
19 Average search and update costs in skip lists – T Papadakis, J Ian Munro, P V Poblete - 1992
717 Managing Gigabytes: Compressing and Indexing Documents and Images - Errata – I. H. Witten, A. Moffat, T. C. Bell - 1996
40 Deterministic skip lists – J I Munro, T Papadakis, R Sedgewick - 1992
38 S.: A Simple algorithm for merging two disjoint linearly ordered lists – F K Hwang, Lin - 1972
49 Design and analysis of a data structure for representing sorted lists – M R Brown, R E Tarjan - 1980
91 Optimum binary search trees – D E Knuth - 1971
20 Nearly optimal binary search trees – K Mehlhorn - 1975
14 Finger Search Trees with Constant Insertion Time – Gerth Stølting Brodal - 1997
9 A data structure with movable fingers and deletions – D Harel, G S Lueker - 1979