Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Skip lists: A probabilistic alternative to balanced trees

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1989)

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

Included in the following conference series:

Abstract

Skip lists are a practical, probabilistic data structure that can be used in place of balanced trees. Algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees. This paper describes and analyzes skip lists and presents new techniques for analyzing probabilistic algorithms.

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.

Similar content being viewed by others

References

  1. Aho, A., Hopcroft, J., and Ullman, J. Data Structures and Algorithms, Addison-Wesley Publishing Company, 1983.

    Google Scholar 

  2. Bentley, J., Leighton, F. T., Lepley, M., F. Stanat, D., and Steele, J. M. A Randomized Data Structure For Ordered Sets, MIT/LCS Technical Memo 297, May 1986.

    Google Scholar 

  3. Knuth, D. "Sorting and Searching," The Art of Computer Programming, Vol. 3, Addison-Wesley Publishing Company, 1973.

    Google Scholar 

  4. Pugh, W., and Teitelbaum, T. "Incremental Computation via Function Caching," Proc. of the Sixteenth conference on the Principles of Programming Languages, 1989.

    Google Scholar 

  5. Pugh, W., Skip Lists: A Probabilistic Alternative to Balanced Trees, Tech Report TR-CS-2190, University of Maryland, College Park, 1989.

    Google Scholar 

  6. Pugh, W., Concurrent Maintainence of Skip Lists, Tech Report TR-CS-2222, University of Maryland, College Park, 1989.

    Google Scholar 

  7. Pugh, W., A Skip List Cookbook, in preparation.

    Google Scholar 

  8. Sleator, D., and Tarjan, R. "Self-Adjusting Binary Search Trees," Journal of the ACM, Vol. 32, No. 3, July 1985, pp. 652–666.

    Article  Google Scholar 

  9. Wirth, N. Algorithms+Data Structures=Programs, Prentice-Hall, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, 20742, College Park, Maryland, USA

    William Pugh

Authors
  1. William Pugh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pugh, W. (1989). Skip lists: A probabilistic alternative to balanced trees. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation