|
18
|
Scapegoat Trees
– I Galperin, R L Rivest
- 1993
|
|
97
|
Decomposable searching problems I: Static-to-dynamic transformation
– J L Bentley, J B Saxe
- 1980
|
|
212
|
A dichromatic framework for balanced trees
– L J Guibas, R Sedgewick
- 1978
|
|
11
|
Binary Search Trees of Almost Optimal Height
– Arne Andersson, et al.
- 1990
|
|
334
|
Self-adjusting binary search trees
– D D AND TARJAN SLEATOR, R E
- 1985
|
|
10
|
Binary trees of bounded balance
– J Nievergelt, E M Reingold
- 1973
|
|
102
|
Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms
– R Bayer
- 1972
|
|
17
|
Efficient Algorithms To Globally Balance a Binary Search Tree
– H Chang, S S Iyengar
- 1984
|
|
15
|
General balanced trees
– Arne Andersson
- 1999
|
|
70
|
Binary Search Trees of Bounded Balance
– Jürg Nievergelt, Edward M Reingold
- 1972
|
|
231
|
Making Data Structures Persistent
– James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan
- 1989
|
|
557
|
Data Structures and Network Algorithms
– R E Tarjan
- 1983
|
|
80
|
Maintaining order in a linked list
– P F Dietz
- 1982
|
|
10
|
Balancing a Binary Tree
– A C Day
- 1976
|
|
4
|
Maintaining ff-balanced trees by partial rebuilding
– A Andersson
- 1991
|
|
15
|
Tree Rebalancing in Optimal Time and Space
– F Stout, L W Bette
- 1986
|
|
911
|
Multidimensional binary search trees used for associative searching
– J L Bentley
- 1975
|
|
12
|
An Algorithm for the Organisation of Information. Doklady Akademi Nauk 146
– G M Adel'son-Vel'skii, Y M Landis
- 1962
|
|
126
|
Randomized Search Trees
– Raimund Seidel, Cecilia R. Aragon
- 1996
|
