Analysis of the expected search cost in skip lists

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 447 LNCS, Issue , 1990, Pages 160-172

  Papadakis, Thomas ^a   Munro, J Ian ^a   Poblete, Patricio V ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYMPTOTIC EXPRESSIONS; SEARCH COSTS; SEARCH TREES; SKIP LISTES; UPPER BOUND;

COST BENEFIT ANALYSIS;

EID: 80054853884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52846-6_86     Document Type: Conference Paper

References (6)

1. Aragon, C. R., Seidel R. G. “Randomized Search Trees”. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, Oct. 1989, pp. 540-545.
2. Culberson, J., Munro, J. I. “Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations”. The Computer Journal, vol. 32, no. 1, Feb. 1989, pp. 68-75.
3. Culberson, J., Munro, J. I. “Analysis of the Standard Deletion Algorithms in Exact Fit Domain for Binary Search Trees”. Algorithmica, in press.
4. Knuth, D. E. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
5. Pugh, W. “Skip Lists: A Probabilistic Alternative to Balanced Trees”. To appear in Communications of the A CM. (Initial version appeared in Lecture Notes in Computer Science, no. 382, Proceedings of the Workshop of Algorithms and Data Structures. Ottawa, Canada, August 1989, pp. 437-449.)
6. Pugh, W. “Whatever you might want to do using Balanced Trees, you can do it faster and more simply using Skip Lists”, Technical Report CS-TR-2286, Department of Computer Science, University of Maryland, College Park, July 1989.