Chapter 4 Reference 14

Less Hashing, Same Performance: Building a Better Bloom Filter

Adam Kirsch and Michael Mitzenmacher

Random Structures & Algorithms 2008 eecs.harvard.edu

Open the original at eecs.harvard.edu

As cited in DDIA

Adam Kirsch and Michael Mitzenmacher. "Less Hashing, Same Performance: Building a Better Bloom Filter." Random Structures & Algorithms, volume 33, issue 2, pages 187–218, September 2008. doi:10.1002/rsa.20208

Link check

Status: Link checked and reachable (HTTP 200)
Format: application/pdf
Size: 0.4 MB
Last checked: 2026-08-29

Identifiers and archived copies

DOI: 10.1002/rsa.20208