Deterministic skip lists

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 367-375

  Munrot, J Ian ^a   Papadakis, Thomas ^a   Sedgewick, Robert ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED TREES; BUDDY SYSTEMS; FIRST PRINCIPLES; LOGARITHMIC SEARCH; SKIP LISTES;

ALGORITHMS;

EID: 84979675579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. G. M. Adel'son-Vel'skii and E. M. Landis. "An algorithm for the Organization of Information". Dokìady Akademia Nauk SSSR, vol. 146, 1962, pp. 263-266.
2. English translation in Soviet Mathematics Dokìady, vol. 3, pp. 1259-1263.
3. R. Bayer and E. McCreight. "Organization and Maintenance of Large Ordered Indexes". Acta Informatica, vol. 1, 1972, pp. 173-189.
4. R. L. Graham, D. E. Knuth and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989.
5. L. Guibas and R. Sedgewick. "A dichromatic framework for balanced trees". 19th Annual Symposium in Foundations of Computer Science IEEE Computer Society. Ann Arbor, Michigan, Oct. 1978, pp. 8-21.
6. H. R. Lewis and L. Denenberg. Data Structures and their Algorithms. Harper Collins, 1991.
7. K. Mehlhorn. Data Structures and Algorithms, vol. 1. Springer-Verlag, 1984.
8. T. Papadakis, J. I. Munro and P. Poblete. "Average Search and Update Costs in Skip Lists". BIT, to appear.
9. W. Pugh. "Skip Lists: A Probabilistic Alternative to Balanced Trees". Communications of the ACM, vol. 33, no. 6, June 1990, pp. 668-676.