论文信息 - Skip lists: a probabilistic alternative to balanced trees

Skip lists: a probabilistic alternative to balanced trees

Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.

William Pugh | W. Pugh

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

[2] William Pugh,et al. A skip list cookbook , 1990 .

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

[4] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

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

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

[7] J. Ian Munro,et al. Analysis of the Expected Search Cost in Skip Lists , 1990, SWAT.

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

[9] R. Sprugnoli,et al. Randomly balanced binary trees , 1980 .

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

[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..

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

[14] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .

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

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