This link has been bookmarked by 13 people . It was first bookmarked on 17 Oct 2008, by reckoner reckoner.
-
-
Skip lists are an efficient data structure that can be used in place of balanced
trees. Skip lists use probabilistic balancing rather than strictly enforce
balancing and as a result the algorithms for insertion and deletion in skip
lists are much simpler to implement and significantly faster than the equivalent
algorithms for balanced search trees (see lectures
9 and 10 for search trees).
-
-
rampionlooks interesting. I might have gotten more out of that skip list talk at WSDM the other year if I'd known about them before.
Would you like to comment?
Join Diigo for a free account, or sign in if you are already a member.