A unified access bound on comparison-based dynamic dictionaries

Theoretical Computer Science

Volumn 382, Issue 2, 2007, Pages 86-96

  Bǎdoiu, Mihai ^a   Cole, Richard ^b   Demaine, Erik D ^a   Iacono, John ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; NUMERICAL METHODS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

DISTINCT ELEMENTS; DYNAMIC-FINGER PROPERTIES; SET ELEMENTS; UNIFIED BOUNDS;

DYNAMIC PROGRAMMING;

EID: 34547532086     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.03.002     Document Type: Article

References (15)

1. Mihai Bǎdoiu, Erik D. Demaine, A simplified and dynamic unified structure, in: Proceedings of the 6th Latin American Symposium on Theoretical Informatics, in: Lecture Notes in Computer Science, vol. 2976, Buenos Aires, Argentina, April 2004, pp. 466-473
2. Bayer R., and McCreight E.M. Organization and maintenance of large ordered indexes. Acta Informatica 1 3 (1972) 173-189
3. Brown M.R., and Tarjan R.E. Design and analysis of a data structure for representing sorted lists. SIAM Journal on Computing 9 3 (1980) 594-614
4. Cole R., Mishra B., Schmidt J., and Siegel A. On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences. SIAM Journal on Computing 30 1 (2000) 1-43
5. Cole R. On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM Journal on Computing 30 1 (2000) 44-85
6. Elmasry A. On the sequential access theorem and deque conjecture for splay trees. Theoretical Computer Science 314 3 (2004) 459-466
7. Leo J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts, A new representation for linear lists, in: Conference Record of the 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado, May 1977, pp. 49-60
8. Hu T.C., and Tucker A.C. Optimal computer search trees and variable- length alphabetic codes. SIAM Journal on Applied Mathematics 21 4 (1971) 514-532
9. John Iacono, Alternatives to splay trees with O (log n) worst-case access times, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, January 2001, pp. 516-522
10. John Iacono, Distribution sensitive data structures, Ph.D. Thesis, Rutgers, The State University of New Jersey, New Brunswick, New Jersey, 2001
11. Knuth D.E. Optimum binary search trees. Acta Informatica 1 (1971) 14-25
12. Sleator D.D., and Tarjan R.E. Self-adjusting binary search trees. Journal of the ACM 32 3 (1985) 652-686
13. Rajamani Sundar, Amortized complexity of data structures, Ph.D. Thesis, New York University, 1991
14. Sundar R. On the deque conjecture for the splay algorithm. Combinatorica 12 (1992) 95-124
15. Tarjan R.E. Sequential access in splay trees takes linear time. Combinatorica 5 4 (1985) 367-378