Dynamic optimality - almost [competitive online binary search tree]

@article{Demaine2004DynamicO,
  title={Dynamic optimality - almost [competitive online binary search tree]},
  author={E. Demaine and Dion Harmon and J. Iacono and M. Patrascu},
  journal={45th Annual IEEE Symposium on Foundations of Computer Science},
  year={2004},
  pages={484-490}
}
  • E. Demaine, Dion Harmon, +1 author M. Patrascu
  • Published 2004
  • Mathematics, Computer Science, Engineering
  • 45th Annual IEEE Symposium on Foundations of Computer Science
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator and Tarjan's dynamic optimality conjecture of 1985 that O(1)-competitive binary search trees exist. 
21 Citations
Dynamic Optimality - Almost
  • 91
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
  • 9
  • Highly Influenced
  • PDF
O(log log n)-competitive dynamic binary search trees
  • 66
  • PDF
Applying the Interleave Bound to Splay Trees
  • PDF
New bounds on optimal binary search trees
  • 18
  • PDF
Dynamic optimality for skip lists and B-trees
  • 38
  • PDF
How to Splay for loglog N-Competitiveness
  • 10
O(log log n)-competitive Binary Search Tree
  • C. Wang
  • Mathematics, Computer Science
  • Encyclopedia of Algorithms
  • 2008
  • Highly Influenced
Multi-splay trees
  • 6
...
1
2
3
...

References

SHOWING 1-10 OF 37 REFERENCES
Dynamic Optimality - Almost
  • 91
O(log log n)-competitive dynamic binary search trees
  • 66
  • PDF
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
  • R. Cole
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 2000
  • 130
Lower bounds for accessing binary search trees with rotations
  • Robert E. Wilber
  • Mathematics, Computer Science
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
  • 48
Sequential access in splay trees takes linear time
  • R. Tarjan
  • Mathematics, Computer Science
  • Comb.
  • 1985
  • 104
Logarithmic Lower Bounds in the Cell-Probe Model
  • 183
  • PDF
Key-Independent Optimality
  • J. Iacono
  • Mathematics, Computer Science
  • Algorithmica
  • 2004
  • 23
Alternatives to splay trees with O(log n) worst-case access times
  • J. Iacono
  • Mathematics, Computer Science
  • SODA '01
  • 2001
  • 82
  • PDF
...
1
2
3
4
...