Comments on: Skip lists are fascinating!

By: How to write a self-printing program | Igor Ostrovsky Blogging

How to write a self-printing program | Igor Ostrovsky Blogging — Wed, 09 Sep 2009 07:21:46 +0000

[...] Skip list are fascinating! [...]

By: Numbers that cannot be computed | Igor Ostrovsky Blogging

Numbers that cannot be computed | Igor Ostrovsky Blogging — Wed, 09 Sep 2009 07:21:22 +0000

[...] Skip list are fascinating! [...]

By: Data structure zoo: ordered set | Igor Ostrovsky Blogging

Data structure zoo: ordered set | Igor Ostrovsky Blogging — Wed, 09 Sep 2009 07:08:44 +0000

[...] skip over nodes. For a detailed description of how skip lists work and a C# implementation, see my earlier article on skip [...]

By: Efficient auto-complete with a ternary search tree | Igor Ostrovsky Blogging

Tue, 01 Sep 2009 09:06:56 +0000

[...] Skip lists are fascinating! [...]

By: Igor Ostrovsky

Igor Ostrovsky — Tue, 14 Apr 2009 08:32:55 +0000

@Pablo: Ah, cool. I didn’t know about the MSDN article.

My approach to explaining skip lists is significantly different from the explanation in the MSDN article, and there are differences in the implementation as well.

So, I wouldn’t say that my post is redundant.

By: Pablo

Pablo — Tue, 14 Apr 2009 07:52:22 +0000

In fact all this information + sample code was posted on on MSDN a while ago.
Do the guys in MS use MSDN ?

Linked lists:
http://msdn.microsoft.com/en-u.....S.80).aspx

Other data structures (queue, stack, BT, BST, etc.):
http://msdn.microsoft.com/en-u.....S.80).aspx

By: Ion Sapoval

Ion Sapoval — Tue, 09 Sep 2008 09:29:32 +0000

I like this type of data structure for it’s simplicity and efficiency. Keep going with this kind of articles they’re very useful. Thanks

By: kim

kim — Fri, 08 Aug 2008 06:16:23 +0000

I like it!!!!

By: Weekly Web Nuggets #22 : Code Monkey Labs

Weekly Web Nuggets #22 : Code Monkey Labs — Mon, 28 Jul 2008 16:00:28 +0000

[...] Skip Lists Are Fascinating: Igor Ostrovsky takes a look at the skip list, a simple, yet powerful data structure. [...]

By: Alex Miller

Alex Miller — Sun, 27 Jul 2008 03:05:18 +0000

Nice article! I wrote an article on skip lists a while back you might find interesting. It has links to a lecture available on iTunes from MIT that covers skip lists in some detail as well:

http://tech.puredanger.com/2007/10/03/skip-lists/

You should really also check out the ConcurrentSkipListMap included in Java 6:

http://java.sun.com/javase/6/d.....stMap.html

One of the big benefits of skip lists is that because they are built around linked lists, they can exhibit very localized locking. ConcurrentSkipListMap is a concurrent skip list based map and is written in lock free style (no synchronization, relies solely on CAS-like operations). This makes ConcurrentSkipListMap a concurrent sorted map with excellent performance. I’d recommend reading the source code as well as it is extremely well written and a great example of lock-free coding.