Bloom Filter
- Given a Bloom filter with m bits and k hashing functions, both insertion and membership testing are O(k)
- Bloom Filters - Youtube (video)
- Bloom Filters | Mining of Massive Datasets - Stanford (video)
- Bloom Filters by Example (web)
- How To Write A Bloom Filter in C++ (article)