Binary Search Trees of Almost Optimal Height (1990)

Cached

Download Links

by Arne Andersson, et al.
Venue:ACTA INFORMATICA
Citations:11 - 1 self

Documents Related by Co-Citation

9 Implementing dictionaries using binary trees of very small height. Information Processing Letters – H A Mauer, T Ottmann, H W Six - 1976
10 Binary trees of bounded balance – J Nievergelt, E M Reingold - 1973
113 Symmetric binary B-trees: Data structure and maintenance algorithms – Rudolf Bayer - 1972
235 A dichromatic framework for balanced trees – Leo J Guibas, Robert Sedgewick - 1978
21 Improving Partial Rebuilding by Using Simple Balance Criteria – Arne Andersson
27 The design of dynamic data structures, volume 156 – M H Overmars
29 An algorithm for the organization of information. Doklady Akademii Nauk SSSR, 146:263–266, (Russian). English translation by Myron – G Adelson-Velskii, E M Landis - 1962
18 Efficient Algorithms To Globally Balance a Binary Search Tree – H Chang, S S Iyengar - 1984
130 The Design of Dynamic Data Structures – M 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
11 Optimal Binary Trees Grown with a Sorting Algorithm – W A Martin, D N Ness - 1972
1108 Multidimensional binary search trees used for associative searching – J L Bentley - 1975
12 Balancing a Binary Tree – A C Day - 1976
13 A comparison of tree-balancing algorithms – J Baer, B Schwab - 1977
19 Scapegoat trees – I Galperin, R R Rivest - 1993
4 Stratified balanced search trees – J van Leeuwen, M H Overmars - 1983