Binary Search Trees of Almost Optimal Height (1990)

Cached

Download Links

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

Active Bibliography

19 General balanced trees – Arne Andersson - 1999
Maintaining alpha-balanced Trees by Partial Rebuilding – Arne Andersson - 1991
14 Fast updating of well-balanced trees – Arne Andersson - 1990
2 Concurrent Perfect Balancing of Binary Search Trees – J├╝rgen Eckerle, Otto Nurmi
21 Balanced search trees made simple – Arne Andersson - 1993
5 Rank-Balanced Trees – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
21 Improving Partial Rebuilding by Using Simple Balance Criteria – Arne Andersson
A Forest of Hashed Binary Search Trees with Reduced Internal Path Length and better Compatibility with the Concurrent Environment – Vinod Prasad
Binary Search Tree Balancing Methods: A Critical Study – Suri Pushpa, Prasad Vinod
On Consulting a Set of Experts and Searching – Igal Galperin - 1996
with minimum of one Rotation for Greater Elements from BST – S. Muthusundari, Dr. R. M. Suresh
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995
250 Making Data Structures Persistent – James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan - 1989
Relaxed AVL Trees, Main-Memory Databases, and Concurrency – Otto Nurmi, Eljas Soisalon-soininen, Derick Wood - 1996
3 Partially Persistent Dynamic Sets for History-Sensitive Heuristics – R. Battiti
13 Reactive search: machine learning for memory-based heuristics – Roberto Battiti, Mauro Brunato - 2005
15 Relaxed balanced red-black trees – S. Hanke, Th. Ottmann, E. Soisalon-soininen - 1997
Deletion Without Rebalancing in Multiway Search Trees – unknown authors
3 Deletion Without Rebalancing in Multiway Search Trees – Siddhartha Sen, Robert E. Tarjan