skip-list (hackage): Skip lists provide efficient amortized indexing deep into lists by building an index that, essentially, converts the list into a balance binary tree. See the wikipedia entry on skip lists for more information.
Keywords: data|library|mit|data-structures|functional-programming|haskell-library|skiplist