MIT's Introduction to Algorithms, Lecture 12: Skip Lists

You're viewing a comment by José Luis Campanello and its responses.

José Luis Campanello Permalink
July 18, 2009, 05:49

Well, i went to find the original paper. It was publicated on Communications of the ACM, Volume 33 Issue 6, June 1990, pages 668 thru 676.

If you are an ACM member, it can be downloaded (free for members, paid otherwise) with the link http://portal.acm.org/citation.cfm?id=78973.78977&coll=GUIDE&dl=GUIDE&CFID=44594004&CFTOKEN=83191267

There is another paper "Lock-free linked lists and skip lists" also on ACM, the link is http://portal.acm.org/citation.cfm?id=1011767.1011776&coll=GUIDE&dl=GUIDE&CFID=44594004&CFTOKEN=83191267

Reply to this comment

Reply To This Comment

(why do I need your e-mail?)

(Your twitter handle, if you have one.)

Comment Help

Type the word "sandbox_99": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.