|
15
|
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
|
|
16
|
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
|
|
126
|
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
– Siddhartha Sen, Robert E. Tarjan
|
|
2
|
Rank-Balanced Trees
– Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
|
|
1
|
CATS: Certified Authenticated Tamper-evident State Store for Network Services
– Aydan R. Yumerefendi, Jeffrey S. Chase
|
|
|
This page has been left intentionally blank. Content
– unknown authors
- 2007
|
|
25
|
Bkd-tree: A dynamic scalable kd-tree
– Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vittery
- 2003
|
|
28
|
Implementing I/O-Efficient Data Structures Using TPIE
– Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
- 2002
|
|
22
|
A Framework for Index Bulk Loading and Dynamization
– Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
- 2001
|
|
21
|
Kinetic Medians and kd-Trees
– Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas
- 2002
|
|
2
|
Efficient Dynamic Range Searching using Data Replication
– K. V. Ravi Kanth, Ambuj K. Singh
- 1997
|
