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
237 A dichromatic framework for balanced trees – L J GUIBAS, R SEDGEWICK - 1978
117 Symmetric binary b-trees: Data structure and maintenance algorithms – R Bayer - 1972
10 Binary trees of bounded balance – J Nievergelt, E M Reingold - 1973
1152 Multidimensional binary search trees used for associative searching – J L Bentley - 1975
711 The Art of Computer Programming, Volume 3: Sorting and Searching – D E Knuth - 1998
625 Compiling with Continuations – A Appel - 1992
21 Improving Partial Rebuilding by Using Simple Balance Criteria – Arne Andersson
726 Data Structures and Algorithms – Alfred Aho, John Hopcroft, Jeffrey Ullman - 1982