Improving Partial Rebuilding by Using Simple Balance Criteria

Cached

Download Links

by Arne Andersson
Citations:21 - 4 self

Active Bibliography

19 General balanced trees – Arne Andersson - 1999
11 Binary Search Trees of Almost Optimal Height – Arne Andersson, et al. - 1990
Maintaining alpha-balanced Trees by Partial Rebuilding – Arne Andersson - 1991
On Consulting a Set of Experts and Searching – Igal Galperin - 1996
21 Balanced search trees made simple – Arne Andersson - 1993
14 Fast updating of well-balanced trees – Arne Andersson - 1990
4 Optimal Bounds on the Dictionary Problem – Arne Andersson - 1989
9 Constructing Red-Black Trees – Ralf Hinze - 1999
139 Randomized Search Trees – Raimund Seidel, Cecilia R. Aragon - 1996
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995
Deletion Without Rebalancing in Multiway Search Trees – unknown authors
5 Rank-Balanced Trees – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
3 Deletion Without Rebalancing in Multiway Search Trees – Siddhartha Sen, Robert E. Tarjan
This page has been left intentionally blank. Content – unknown authors - 2007
1 CATS: Certified Authenticated Tamper-evident State Store for Network Services – Aydan R. Yumerefendi, Jeffrey S. Chase
Abstract – Travis Gagie, Yakov Nekrich - 907
22 A Framework for Index Bulk Loading and Dynamization – Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter - 2001
22 Kinetic Medians and kd-Trees – Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas - 2002
70 Range Searching – Pankaj K. Agarwal - 1996