Balanced search trees made simple (1993)

Cached

Download Links

by Arne Andersson
Venue:In Proc. 3rd Workshop on Algorithms and Data Structures
Citations:21 - 0 self

Active Bibliography

11 Binary Search Trees of Almost Optimal Height – Arne Andersson, et al. - 1990
19 General balanced trees – Arne Andersson - 1999
21 Improving Partial Rebuilding by Using Simple Balance Criteria – Arne Andersson
14 Fast updating of well-balanced trees – Arne Andersson - 1990
5 Rank-Balanced Trees – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
4 Optimal Bounds on the Dictionary Problem – Arne Andersson - 1989
Maintaining alpha-balanced Trees by Partial Rebuilding – Arne Andersson - 1991
Deletion Without Rebalancing in Multiway Search Trees – unknown authors
3 Deletion Without Rebalancing in Multiway Search Trees – Siddhartha Sen, Robert E. Tarjan
1 Binary search trees: How low can you go? – Rolf Fagerberg - 1996
9 Constructing Red-Black Trees – Ralf Hinze - 1999
On Consulting a Set of Experts and Searching – Igal Galperin - 1996
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995
4 Deletion Without Rebalancing in Balanced Binary Trees ∗ – Siddhartha Sen, Robert E. Tarjan
Cache Performance of Indexing Data Structures – Joshua P. Macdonald, Ben Y. Zhao - 1999
Cache Performance of Indexing Data Structures – Joshua Macdonald And
135 Cache-oblivious B-trees – Michael A. Bender, Erik D. Demaine, Martin Farach-colton - 2000
1 CATS: Certified Authenticated Tamper-evident State Store for Network Services – Aydan R. Yumerefendi, Jeffrey S. Chase
2 Exploring the Duality Between Skip Lists and Binary Search Trees – Brian C. Dean, et al. - 2007