CS Table (Friday, February 21, 2014): Skip lists

This Friday at CS Table, we will consider skip lists, an interesting data structure that, like lists, makes it easy to add and remove elements, and like arrays, lets you do something like binary search to quickly find elements.

Pugh, W. “Skip lists: A probabilistic alternative to balanced trees.” Communications of the ACM 33 (1990), no. 6, p. 668.

Computer Science Table is an open weekly meeting of Grinnell College community members (students, faculty, staff, etc.) interested in discussing topics related to computing and computer science.