Less Hashing, Same Performance: Building a Better Bloom Filter

DOI10.1007/11841036_42zbMath1131.68429OpenAlexW2156660460MaRDI QIDQ5449550

Adam Kirsch, Michael Mitzenmacher

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.2442

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (6)

Efficient and robust associative memory from a generalized Bloom filter ⋮ Less hashing, same performance: Building a better Bloom filter ⋮ Dynamic space efficient hashing ⋮ A resource-frugal probabilistic dictionary and applications in bioinformatics ⋮ Dynamic Space Efficient Hashing. ⋮ Computing treewidth on the GPU

This page was built for publication: Less Hashing, Same Performance: Building a Better Bloom Filter