Dynamic Optimality " Almost

Authors:
Erik D. Demaine;Dion Harmon;John Iacono;Mihai Patrascu
Affiliations:
Massachusetts Institute of Technology;Massachusetts Institute of Technology;Polytechnic University;Massachusetts Institute of Technology
Venue:
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Year:
2004

Citing 0
Cited 7

Towards a Final Analysis of Pairing Heaps

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying

Information Processing Letters
Dynamic optimality for skip lists and B-trees

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Splay trees, Davenport-Schinzel sequences, and the deque conjecture

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The cost of offline binary search tree algorithms and the complexity of the request sequence

Theoretical Computer Science
How to splay for loglogn-competitiveness

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Poketree: a dynamically competitive data structure with good worst-case performance

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.