How to use result from a hash function to get an array index?...

Space-efficient probabilistic data structures for number retrieval...

I need to modify these hash functions so that it gives value in range 0<x<10^9...

How to write an efficient groupBy-size filter in Scala, can be approximate...

Bloom Filter class to include in my OMNET++ project...

guava bloom filter hight expected false positive percent after insertions...

Bloomfilter and Cassandra = Why used and why hashed several times?...

One 128bit hash vs. two different 64bit hashes (non-crypto)?...

Is there an open source implementation of the quotient filter?...

python bit array (performant)...

What's the fastest way to figure out if a pointer is part of a set in C?...

Bob Jenkins' Hash getting bad performance...

Logic of code Guava's mightContain...

Are different salted hashes, equivalent to different hashing algorithms for a bloom filter?...

Difference bloom filters and FM-sketches...

How to store set of numbers...

Bloom filter implementation for billions of categories...

Finding possibility of occurrence of words in a document using bloom filter...

Near Duplicate Detection in Data Streams...

Speed up cython loop by copying from a list to a numpy array...

What hashing techniques to use when building a bloom filter in clojure?...

Efficient way of creating a bit matrix and scan set columns...

How to map hashfunction output to bloomfilter indices?...

Bloom filter usage...

Subset calculation of list of integers...

C++ Storing a dynamic_bitset into a file...

Combining Bloom Filters...

Is there any probabilistic data structure that gives false negatives but not false positives?...

Generating md5 and checking for collision...

Testing Unpredictable Functions...