O(log log n)-competitive dynamic binary search trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 374-383

  Wang, Chengwen Chris ^a   Derryberry, Jonathan ^a   Sleator, Daniel Dominic ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COST BENEFIT ANALYSIS; QUERY LANGUAGES; RANDOM PROCESSES;

BINARY SEARCH TREE (BST); LEMMA; MULTI-SPLAY TREE (MST);

TREES (MATHEMATICS);

EID: 33244455194     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109600     Document Type: Conference Paper

References (14)

1. [BCK02] Avrim Blum, Shuchi Chawla, and Adam Kalai. Static optimality and dynamic search-optimality in lists and trees. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1-8, 2002.
2. [CMSS00] Richard Cole, Bud Mishra, Jeanette Schmidt, and Alan Siegel. On the dynamic finger conjecture for splay trees. Part I: Splay Sorting log n-Block Sequences. Siam J. Comput., 30:1-43, 2000.
3. [Col00] Richard Cole. On the dynamic finger conjecture for splay trees. Part II: The Proof. Siam J. Comput., 30:44-85, 2000.
4. [CW82] K. Culik, II and D. Wood. A note on some tree similarity measures. Inform. Process. Lett., pages 39-42, 1982.
5. [DHIP04] Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pǎtraşcu. Dynamic Optimality-Almost. FOCS, 2004.
6. [Elm04] Amr Elmasry. On the sequential access theorem and deque conjecture for splay trees. Theoretical Computer Science, 314:459-466, 2004.
7. [GS78] L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. Nineteenth Annual IEEE Symposium on Foundations of Computer Science, pages 8-12, 1978.
8. [ST85] Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, July 1985.
9. [STT86] D. D. Sleator, R. E. Tarjan, and W. P. Thurston. Rotation distance, triangulations, and hyperbolic geometry. Proc. 18th Annual ACM Symposium on Theory of Computing, pages 122-135, 1986.
10. [Sun89] R. Sundar. Twists, turns, cascades, deque conjecture, and scanning theorem. Proceedings of the 13th Symposium on Foundations of Computer Science, pages 555-559, 1989.
11. [Sun92] R. Sundar. On the deque conjecture for the splay algorithm. Combinatorica, 12:95-124, 1992.
12. [Tar83] Robert Endre Tarjan. Data structures and network algorithms. Society for Industrial and Applied Mathematics, 1983.
13. [Tar85] R. Tarjan. Sequential access in splay trees takes linear time. Combinatorica, 5:367-378, 1985.
14. [Wil89] Robert Wilber. Lower bounds for accessing binary search trees with rotations. SIAM Journal on Computing, 18(1):56-67, 1989.