MIT’s Introduction to Algorithms, Lecture 12: Skip Lists - good coders code, great reuse

This link has been bookmarked by 13 people . It was first bookmarked on 17 Oct 2008, by reckoner reckoner.

28 Apr 09

sbelur
Good Links
30 Dec 08

Chris Smith
imported c++_idioms
17 Oct 08

mojtaba !
David Eubanks
programming lists
Chuck Brands
timeuser
programming algorithms
Joel Liu
algorithm
- 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).
rampion
looks interesting. I might have gotten more out of that skip list talk at WSDM the other year if I'd known about them before.

towatch videos skip.lists programming computer.science data.structures algorithms
reckoner reckoner
education tutorial tutorials algorithm programming
Frank Colcord
iPod Ruby
Uma Shankar
video tutorials tutorial structures skiplists skiplist programming technology

MIT's Introduction to Algorithms, Lecture 12: Skip Lists - good coders code, g... - The Diigo Meta page