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

Adam Kirsch, Michael Mitzenmacher (2008)

> Home

Details and statistics

DOI: 10.1002/RSA.20208

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/KirschM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/KirschM08
Adam Kirsch, Michael Mitzenmacher:
Less hashing, same performance: Building a better Bloom filter. Random Struct. Algorithms 33(2): 187-218 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.