论文信息 - Skip Lists: A Probabilistic Alternative to Balanced Trees

Skip Lists: A Probabilistic Alternative to Balanced Trees

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.

William Pugh | W. Pugh

[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[2] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[3] Richard Perry,et al. McGraw-Hill Book Company , 1973 .

[4] Niklaus Wirth,et al. Algorithms + Data Structures = Programs , 1976 .

[5] John A. Allen,et al. The anatomy of lisp , 1980 .

[6] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .

[7] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[8] J. Michael Steele,et al. A Randomized Data Structure for Ordered Sets , 1989, Advances in Computational Research.

[9] William Pugh,et al. Incremental computation via function caching , 1989, POPL '89.

[10] William Pugh,et al. Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[11] William Pugh,et al. Concurrent maintenance of skip lists , 1990 .

[12] William Pugh. Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies , 1990, Inf. Process. Lett..