Skip lists: A probabilistic alternative to balanced trees
- 803 Downloads
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.
KeywordsBinary Tree Negative Binomial Distribution Search Path Balance Tree Probabilistic Alternative
Unable to display preview. Download preview PDF.
- [AHU83]Aho, A., Hopcroft, J., and Ullman, J. Data Structures and Algorithms, Addison-Wesley Publishing Company, 1983.Google Scholar
- [BLLSS86]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
- [Knu73]Knuth, D. "Sorting and Searching," The Art of Computer Programming, Vol. 3, Addison-Wesley Publishing Company, 1973.Google Scholar
- [PT89]Pugh, W., and Teitelbaum, T. "Incremental Computation via Function Caching," Proc. of the Sixteenth conference on the Principles of Programming Languages, 1989.Google Scholar
- [Pug89a]Pugh, W., Skip Lists: A Probabilistic Alternative to Balanced Trees, Tech Report TR-CS-2190, University of Maryland, College Park, 1989.Google Scholar
- [Pug89b]Pugh, W., Concurrent Maintainence of Skip Lists, Tech Report TR-CS-2222, University of Maryland, College Park, 1989.Google Scholar
- [Pug89c]Pugh, W., A Skip List Cookbook, in preparation.Google Scholar
- [Wir76]Wirth, N. Algorithms+Data Structures=Programs, Prentice-Hall, 1976.Google Scholar