Programmers Stack Exchange is a question and answer site for professional programmers interested in conceptual questions about software development. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I've heard of probabilistic data structures like Skip Lists and Bloom Filters being immensely useful and I'd like to learn more about them in general. Is there a canonical reference on the subject on the level of Cormen et al.?

share|improve this question
up vote 3 down vote accepted

The closest site I can think of that might be canonical is the NIST standards web site:

This site can be short on descriptions but has links to external sites ..

share|improve this answer

The best list that I could find, that has probabilistic data structures is this Wikipedia page. The problem here is, the page also includes probabilistic algorithms. The list that I know of is:

There are probably many more, but these are the ones that I have found or that I was aware of.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.