How to splay for loglogN-competitiveness

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 570-579

  Georgakopoulos, George F ^a  

^a UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE;

CHAIN-SPLAY TREES; DYNAMIC OPTIMALITY; LOGLOGN-COMPETITIVENESS; OFF-LINE SEARCHING ALGORITHMS;

TREES (MATHEMATICS);

EID: 24944466392     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_49     Document Type: Conference Paper

References (23)

1. G.M. Adel'son-Vel'ski, E.M. Landis (1962), "An Algorithm for the Organization of Information", Soviet Mathematical Doklady 146, 1259-1263.
2. S. Albers, J. Westbrook (1998), "Self-Organizing Data-Structures" in "Online Algorithms- The State of the Art", Lecture Notes in Computer Science 1442, Springer-Verlag, Chapter 2.
3. B. Allen, I.J. Munro (1978), "Self Organizing Binary Search Trees", J. of the ACM 25(4), 526-535.
4. th, Bangalore, India, Dec. 1995, LNCS 1026, Springer-Verlag, 338-348.
5. R. Bayer, E. McCreight (1972), "Organization and Maintenance of Large Ordered Indexes", Acta Informatica 1(-), 173-189.
6. th, San Francisco, USA, Jan. 6-8, 1-8.
7. R.J. Cole (2000) "On the Dynamic Finger Conjecture for Splay Trees, Part II: The Proof", SIAM J. on Computing 30(1), 44-85.
8. R.J. Cole, B. Mishra, J. P. Schmidt, A. Siegel (2000), "On the Dynamic Finger Conjecture for Splay Trees, Part I: Splaying Sorting in log n-Block Sequences", SIAM J. on Computing 30(1), 1-43.
9. th, Rome, Italy, Oct. 17-19, 484-490.
10. th, Maryland, USA, Jan. 17-19, 903-904.
11. G.F. Georgakopoulos (2004), "Splay Trees: a Reweighing Lemma and a Proof of Competitiveness vs. Dynamic Balanced Trees", J. of Algorithms 51, 64-76.
12. th Panhellenic Conf. on Informatics, Nicosia, Cyprus, Nov. 2001, Lecture Notes in Computer Science 2563, Springer-Verlag, 480-496.
13. G.F. Georgakopoulos, D.J. McClurkin, (2004), "General Template Splay: A Basic Theory and Calculus", The Computer Journal 41(1), 10-19.
14. th, Lecture Notes in Computer Science 2518, Springer-Verlag, 25-31.
15. D.E. Knuth D.E. (1971), "Optimum Binary Search Trees", Acta Informatica 1, 14-25.
16. C. Martel (1991), "Self-Adjusting Multi-Way Search Trees", Information Processing Letters 38(3), 135-141.
17. M.H. Overmars (1983), "The Design of Dynamic Data Structures", Lecture Notes in Computer Science 156, Springer-Verlag, Heidelberg, 1983.
18. M. Sherk M. (1995), "Self Adjusting k-ary Search Trees", J. of Algorithms 19, 25-44.
19. D.D. Sleator, R.E. Tarjan (1985), "Self Adjusting Binary Search Trees", J. of the ACM 32(3), 652-686.
20. A. Subramanian (1996), "An Explanation of Splaying", J. of Algorithms 20, 512-525.
21. th, North Carolina, USA, Oct. 30 - Nov. 1, 555-559.
22. R.E. Tarjan (1985), "Amortized Computational Complexity", J. of Applied and Discrete Mathematics 6(2), 306-318.
23. R. Wilber (1989), "Lower Bounds for Accessing Binary Search Trees with Rotations", SIAM J. on Computing 18(1), 56-67.