Key-independent optimality

Algorithmica (New York)

Volumn 42, Issue 1, 2005, Pages 3-10

  Iacono, John ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Data structures; Dictionary; Splay tree

Indexed keywords

ALGORITHMS; COSTS; DATA REDUCTION; DATA STORAGE EQUIPMENT; GLOSSARIES; THEOREM PROVING; TREES (MATHEMATICS);

BINARY SEARCH TREE ALGORITHMS; COMPARISON-BASED STATIC DICTIONARIES; MULTIPLICATIVE CONSTANTS; SPLAY TREES;

DATA STRUCTURES;

EID: 17444402785     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1136-8     Document Type: Article

References (11)

1. M. R. Brown and R. E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput., 9:594-614, 1980.
2. R. Cole. On the dynamic finger conjecture for splay trees, part II: The proof. SIAM J. Comput., 30(1):44-85, 2000.
3. R. Cole, B. Mishra, J. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees, part 1: Splay sorting (log n)-block sequences. SIAM J. Comput., 30(1):l-43, 2000.
4. M. L. Fredman. Private communication, 2001.
5. L. J. Guibas, E. M. McCreight, M. F. Plass, and J. R. Roberts. A new representation for linear lists. In Proc. 9th Ann. ACM Symp. on Theory of Computing, pages 49-60, 1977.
6. J. Iacono. New upper bounds for pairing heaps. In Proc. Scandinavian Workshop on Algorithm Theory (LNCS 1851), pages 32-45, 2000.
7. J. Iacono. Alternatives to splay trees with o(log n) worst-case access times. In Proc. Symp. on Discrete Algorithms, pages 516-522, 2001.
8. J. Iacono. Distribution Sensitive Data Structures. Ph.D. thesis, Graduate School. Rutgers, The State University of New Jersey, Graduate School, New Brunswick, 2001.
9. D. E. Knuth. Optimum binary search trees. Acta Inform., 1:14-25, 1971.
10. D. D. Sleator and R. E. Tarjan. Self-adjusting binary trees. J. ACM, 32:652-686, 1985.
11. R. Wilbur. Lower bounds for accessing binary search trees with rotations. In Proc. 27th Symp. on Foundations of Computer Science, pages 61-69, 1986.