Less hashing, same performance: Building a better Bloom filter (0)

by A Kirsch, M Mitzenmacher
Venue:Random Structures & Algorithms