Skip Lists: A Probabilistic Alternative to Balanced Trees (1990) [218 citations — 1 self]
by
William Pugh
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Pugh90skiplists:,
author = {William Pugh},
title = {Skip Lists: A Probabilistic Alternative to Balanced Trees},
year = {1990}
}
author = {William Pugh},
title = {Skip Lists: A Probabilistic Alternative to Balanced Trees},
year = {1990}
}
Bookmarks
OpenURL
Abstract:
Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as a result the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
Citations
No citations identified.
