|
29
|
Lower bounds for accessing binary search trees with rotations
– R Wilber
- 1989
|
|
36
|
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
– Richard Cole
|
|
27
|
Sequential access in splay trees takes linear time
– R E Tarjan
- 1985
|
|
33
|
Alternatives to splay trees with o(log n) worst-case access times
– John Iacono
- 2001
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
4
|
Mihai Patrascu. Dynamic optimality — almost
– Erik D Demaine, Dion Harmon, John Iacono
- 2004
|
|
8
|
On the competitiveness of linear search
– J I Munro
|
|
7
|
A simplified and dynamic unified structure
– Mihai Bădoiu, Erik D. Demaine
- 2004
|
|
91
|
Optimum binary search trees
– D E Knuth
- 1971
|
|
5
|
The geometry of binary search trees
– Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane
- 2009
|
|
6
|
A lower bound framework for binary search trees with rotations
– Jonathan Derryberry, Daniel Dominic Sleator, Chengwen Chris Wang
- 2005
|
|
11
|
Canonical forms for competitive binary search tree algorithms
– J M Lucas
- 1988
|
|
154
|
An algorithm for the organization of information
– G Adelson-Velskii, E M Landis
- 1962
|
|
3
|
Mihai Pǎtra¸scu. Dynamic optimality—almost
– Erik D Demaine, Dion Harmon, John Iacono
- 2007
|
|
17
|
Optimal Biweighted Binary Trees And The Complexity Of Maintaining Partial Sums
– Haripriyan Hampapuram, Michael, Michael L. Fredman, Siam J. Comput C
- 1998
|
|
42
|
Sleator and Robert Endre Tarjan. Self-adjusting binary search trees
– Daniel Dominic
- 1983
|
|
13
|
O(log log n)-competitive dynamic binary search trees
– C Wang, J Derryberry, D Sleator
- 2006
|
|
18
|
Static Optimality and Dynamic Search-Optimality in Lists and Trees
– Avrim Blum, Shuchi Chawla, Adam Kalai
- 2002
|
|
16
|
Tight bounds for the partial-sums problem
– Scu Erik D. Demaine
- 2004
|
