|
15
|
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
|
|
16
|
Balanced search trees made simple
– Arne Andersson
- 1993
|
|
19
|
Improving Partial Rebuilding by Using Simple Balance Criteria
– Arne Andersson
|
|
|
Binary Search Tree Balancing Methods: A Critical Study
– Suri Pushpa, Prasad Vinod
|
|
|
A Forest of Hashed Binary Search Trees with Reduced Internal Path Length and better Compatibility with the Concurrent Environment
– Vinod Prasad
|
|
|
On Consulting a Set of Experts and Searching
– Igal Galperin
- 1996
|
|
6
|
Relaxed Balancing Made Simple
– Th. Ottmann, E. Soisalon-Soininen
- 1995
|
|
2
|
Rank-Balanced Trees
– Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
|
|
231
|
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
|
|
|
Deletion Without Rebalancing in Multiway Search Trees
– Siddhartha Sen, Robert E. Tarjan
|
|
12
|
Relaxed balanced red-black trees
– S. Hanke, Th. Ottmann, E. Soisalon-soininen
- 1997
|
|
1
|
External Memory Geometric Data Structures
– Lars Arge
- 2005
|
|
78
|
External Memory Data Structures
– Lars Arge
- 2001
|
|
5
|
Chromatic Priority Queues
– Joan Boyar, Rolf Fagerberg, Kim S. Larsen
- 1994
|
