The geometry of binary search trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 496-505

  Demaine, Erik D ^a   Harmon, Dion ^b   Iacono, John ^c   Kane, Daniel ^d   Pǎtraşcu, Mihai ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NEW ENGLAND COMPLEX SYSTEMS INSTITUTE   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

^d HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

BINARY SEARCH TREES; DYNAMIC OPTIMALITY; GREEDY ALGORITHMS; LOWER BOUNDS; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; SPLAY TREES;

BINARY TREES;

EID: 70349130339     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.55     Document Type: Conference Paper

References (19)

1. [BCDI07] M. Bǎdoiu, R. Cole, E. D. Demaine, and J. Iacono. A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci., 382(2):86-96, 2007.
2. [CMSS00] R. Cole, B. Mishra, J. P. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences. SIAM J. Comput., 30(1):1-43, 2000.
3. [Co100] R. Cole. On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM J. Comput., 30(1):44-85, 2000.
4. [DHIP07] E. D. Demaine, D. Harmon, J. Iacono, and M. Pǎtraş cu. Dynamic optimality - almost. SIAM J. Comput., 37(1):240-251, 2007.
5. [DSW05] J. Derryberry, D. D. Sleator, and C. C. Wang. A lower bound framework for binary search trees with rotations. Tech. Rep. CMU-CS-05-187, Carnegie Mellon University, 2005.
6. [FLN03] R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614-656, 2003.
7. [Har06] D. Harmon. New Bounds on Optimal Binary Search Trees. PhD thesis, MIT, 2006.
8. [Iac01] J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In SODA, pages 516-522, 2001.
9. [Iac05] J. Iacono. Key-independent optimality. Algorithmica, 42(1):3-10, 2005.
10. [Knu71] D. E. Knuth. Optimum binary search trees. Acta Informatica, 1:14-25, 1971.
11. [Luc88] J. M. Lucas. Canonical forms for competitive binary search tree algorithms. Tech. Rep. DCS-TR-250, Rutgers University, 1988.
12. [Mun00] J. I. Munro. On the competitiveness of linear search. In ESA, pages 338-345, 2000.
13. [Pet08] S. Pettie. Splay trees, Davenport-Schinzel sequences, and the deque conjecture. In SODA, pages 1115-1124, 2008.
14. [ST85] D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. ACM, 32(3):652-686, 1985.
15. [STT86] D. D. Sleator, R. E. Tarjan, and W. P. Thurston. Rotation distance, triangulations, and hyperbolic geometry. In STOC, pages 122-135, 1986.
16. [Sun92] R. Sundar. On the deque conjecture for the splay algorithm. Combinatorica, 12(1):95-124, 1992.
17. [Tar85] R. E. Tarjan. Sequential access in play trees takes linear time. Combinatorica, 5(4):367-378, 1985.
18. [WDS06] C. C. Wang, J. Derryberry, and D. D. Sleator. O(log log n)-competitive dynamic binary search trees. In SODA, pages 374-383, 2006.
19. [Wi189] R. E. Wilber. Lower bounds for accessing binary search trees with rotations. SIAM J. Comput., 18(1):56-67, 1989.