Improving Partial Rebuilding by Using Simple Balance Criteria

Cached

Download Links

by Arne Andersson
Citations:21 - 4 self

Documents Related by Co-Citation

19 General balanced trees – Arne Andersson - 1999
19 Scapegoat trees – I Galperin, R R Rivest - 1993
139 Randomized Search Trees – Raimund Seidel, Cecilia R. Aragon - 1996
107 Decomposable searching problems I: Static-to-dynamic transformation – J L Bentley, J B Saxe - 1980
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
82 Binary search trees of bounded balance – J Nievergelt, M Reingold E - 1973
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
607 Data Structures and Network Algorithms – R E Tarjan - 1983
90 Maintaining order in a linked list – Paul F Dietz - 1982
235 A dichromatic framework for balanced trees – Leo J Guibas, Robert Sedgewick - 1978
11 Binary Search Trees of Almost Optimal Height – Arne Andersson, et al. - 1990
10 Binary trees of bounded balance – J Nievergelt, E M Reingold - 1973
18 Efficient Algorithms To Globally Balance a Binary Search Tree – H Chang, S S Iyengar - 1984
113 Symmetric binary B-trees: Data structure and maintenance algorithms – Rudolf Bayer - 1972
17 Tree Rebalancing in Optimal Time and Space – F Stout, L W Bette - 1986
12 An Algorithm for the Organisation of Information. Doklady Akademi Nauk 146 – G M Adel'son-Vel'skii, Y M Landis - 1962
3 6.897: Advanced data structures (Spring 2005), Lecture 3, February 8 – Prof Erik Demaine, Scribes Christos Kapoutsis, Loizos Michael - 2005
22 On the deque conjecture for the splay algorithm – R Sundar - 1992
30 Sequential access in splay trees takes linear time – R E Tarjan - 1985