|
9
|
Implementing dictionaries using binary trees of very small height. Information Processing Letters
– H A Mauer, T Ottmann, H W Six
- 1976
|
|
102
|
Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms
– R Bayer
- 1972
|
|
10
|
Binary trees of bounded balance
– J Nievergelt, E M Reingold
- 1973
|
|
212
|
A dichromatic framework for balanced trees
– L J Guibas, R Sedgewick
- 1978
|
|
19
|
Improving Partial Rebuilding by Using Simple Balance Criteria
– Arne Andersson
|
|
26
|
The Design of Dynamic Data Structures, volume 156
– M H Overmars
|
|
26
|
An algorithm for the organization of information. Doklady Akademii Nauk SSSR
– G M Adel'son-Vel'skii, Y M Landis
- 1962
|
|
17
|
Efficient Algorithms To Globally Balance a Binary Search Tree
– H Chang, S S Iyengar
- 1984
|
|
122
|
The Design of Dynamic Data Structures
– M H Overmars
- 1983
|
|
4
|
Maintaining ff-balanced trees by partial rebuilding
– A Andersson
- 1991
|
|
6
|
Fast updating of well-balanced trees
– A Andersson, T W Lai
- 1990
|
|
4
|
Comparison-efficient and Write-optimal Searching and Sorting
– Arne Andersson, Tony W. Lai
- 1991
|
|
4
|
A Study of Balanced Binary Trees and Balanced One-TwoTrees
– H J Olivie
- 1980
|
|
9
|
Optimal Binary Trees Grown with a Sorting Algorithm
– W A Martin, D N Ness
- 1972
|
|
10
|
Balancing a Binary Tree
– A C Day
- 1976
|
|
910
|
Multidimensional binary search trees used for associative binary searching
– J Bentley
- 1975
|
|
13
|
A comparison of tree-balancing algorithms
– J Baer, B Schwab
- 1977
|
|
18
|
Scapegoat Trees
– I Galperin, R L Rivest
- 1993
|
|
4
|
Stratified balanced search trees
– J van Leeuwen, M H Overmars
- 1983
|
