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.
CITATION STYLE
Pugh, W. (1989). Skip lists: A probabilistic alternative to balanced trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 382 LNCS, pp. 437–449). Springer Verlag. https://doi.org/10.1007/3-540-51542-9_36
Mendeley helps you to discover research relevant for your work.