Dynamic optimality - almost [competitive online binary search tree]

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.

[1]  Erik D. Demaine,et al.  Dynamic Optimality - Almost , 2004, FOCS.

[2]  Robert E. Tarjan,et al.  Sequential access in splay trees takes linear time , 1985, Comb..

[3]  Erik D. Demaine,et al.  A Simplified, Dynamic Unified Structure , 2004, LATIN.

[4]  John Iacono.  Key-Independent Optimality , 2004, Algorithmica.

[5]  Erik D. Demaine,et al.  A simplified and dynamic unified structure , 2004 .

[6]  Erik D. Demaine,et al.  Tight bounds for the partial-sums problem , 2004, SODA '04.

[7]  Adam Tauman Kalai,et al.  Static Optimality and Dynamic Search-Optimality in Lists and Trees , 2002, SODA '02.

[8]  D. Knuth.  Optimum binary search trees , 1971, Acta Informatica.

[9]  Richard Cole,et al.  On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences , 1995, SIAM J. Comput..

[10]  Michael L. Fredman,et al.  Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums , 1999, SIAM J. Comput..

[11]  Richard Cole,et al.  On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof , 2000, SIAM J. Comput..

[12]  Robert E. Wilber.  Lower bounds for accessing binary search trees with rotations , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[13]  John Iacono,et al.  Alternatives to splay trees with O(log n) worst-case access times , 2001, SODA '01.

[14]  Erik D. Demaine,et al.  Logarithmic Lower Bounds in the Cell-Probe Model , 2005, SIAM J. Comput..

[15]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[16]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[17]  Donald E. Knuth,et al.  Optimum binary search trees , 1971, Acta Informatica.

[18]  Daniel Dominic Sleator,et al.  O(log log n)-competitive dynamic binary search trees , 2006, SODA '06.

[19]  G. Gonnet,et al.  Proceedings of the 4th Latin American Symposium on Theoretical Informatics , 2000 .