Less hashing, same performance: Building a better Bloom filter.

Adam Kirsch Michael Mitzenmacher Less hashing, same performance: Building a better Bloom filter. 187-218 2008 33 Random Struct. Algorithms 2 http://dx.doi.org/10.1002/rsa.20208 db/journals/rsa/rsa33.html#KirschM08