Less hashing, same performance: Building a better Bloom filter

This publication has 12 references indexed in Scilit:

• Retouched bloom filters
  Published by Association for Computing Machinery (ACM) ,2006
• Probability and Computing
  Published by Cambridge University Press (CUP) ,2005
• Network Applications of Bloom Filters: A Survey
  Internet Mathematics, 2004
• New directions in traffic measurement and accounting
  ACM Transactions on Computer Systems, 2003
• Compressed Bloom filters
  IEEE/ACM Transactions on Networking, 2002
• Summary cache: a scalable wide-area Web cache sharing protocol
  IEEE/ACM Transactions on Networking, 2000
• Balls and bins: A study in negative dependence
  Random Structures & Algorithms, 1998
• Randomized Algorithms
  Published by Cambridge University Press (CUP) ,1995
• A Classical Introduction to Modern Number Theory
  Published by Springer Nature ,1990
• Practical performance of Bloom filters and parallel free-text searching
  Communications of the ACM, 1989