Skip to main content
SpringerLink
Log in

Analysis of the expected search cost in skip lists

  • Conference paper
  • First Online:
SWAT 90 (SWAT 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 447))

Included in the following conference series:

Abstract

Skip lists, introduced by W. Pugh, provide an alternative to search trees. The exact value of the expected search cost is derived (in terms of previously studied functions), as well as an asymptotic expression for it. The latter suggests that Pugh's upper bound is fairly tight for the interesting cases.

This research was supported in part by the Natural Science and Engineering Research Council of Canada under grant No. A-8237, the Information Technology Research Centre of Ontario, and FONDECYT (Chile) under grant 90-1263.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  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.

    Article  Google Scholar 

  3. Culberson, J., Munro, J. I. “Analysis of the Standard Deletion Algorithms in Exact Fit Domain for Binary Search Trees”. Algorithmica, in press.

    Google Scholar 

  4. Knuth, D. E. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

  5. Pugh, W. “Skip Lists: A Probabilistic Alternative to Balanced Trees”. To appear in Communications of the ACM. (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.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ont, Canada

    Thomas Papadakis & J. Ian Munro

  2. Departamento de Ciencias de la Computación, Universidad de Chile, Casilla 2777, Santiago, Chile

    Patricio V. Poblete

Authors
  1. Thomas Papadakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patricio V. Poblete
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John R. Gilbert Rolf Karlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadakis, T., Munro, J.I., Poblete, P.V. (1990). Analysis of the expected search cost in skip lists. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_86

Download citation

  • DOI: https://doi.org/10.1007/3-540-52846-6_86

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52846-3

  • Online ISBN: 978-3-540-47164-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation