Skip Lists: A Probabilistic Alternative to Balanced Trees

@article{Pugh1990SkipLA,
  title={Skip Lists: A Probabilistic Alternative to Balanced Trees},
  author={William Pugh},
  journal={Commun. ACM},
  year={1990},
  volume={33},
  pages={668-676}
}
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. 
Highly Cited
This paper has 93 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 62 extracted citations

A Survey of Adaptive Sorting Algorithms

ACM Comput. Surv. • 1992
View 5 Excerpts
Highly Influenced

Geo skip list data structure - storing spatial data and efficient search of geographical locations

2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI) • 2014
View 2 Excerpts

Scalable NDN Forwarding: Concepts, Issues and Principles

2012 21st International Conference on Computer Communications and Networks (ICCCN) • 2012
View 1 Excerpt

Hub Node Reinforcement against Forwarding Obstruction Attacks in Peer-to-Peer Networks

2011 14th International Conference on Network-Based Information Systems • 2011
View 1 Excerpt

93 Citations

0510'92'98'05'12'19
Citations per Year
Semantic Scholar estimates that this publication has 93 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…