Fetching the paper…
Reading the bibliography…
The Bloom filter---or, more generally, an approximate membership query data structure (AMQ)---maintains a compact, probabilistic representation of a set S of keys from a universe U.
Space/time trade-offs in hash coding with allowable errors
B. H. Bloom · 1970
Earlier work this paper cites.
Exact and approximate membership testers
L. Carter, R. Floyd, J. Gill, G. Markowsky, and M. Wegman · 1978
Earlier work this paper cites.
Cryptographic primitives based on hard learning problems
A. Blum, M. Furst, M. Kearns, and R. J. Lipton · 1993
Earlier work this paper cites.
Spectral bloom filters
S. Cohen and Y. Matias · 2003
Earlier work this paper cites.
Denial of service via algorithmic complexity attacks
S. A. Crosby and D. S. Wallach · 2003
Earlier work this paper cites.
Network applications of bloom filters: A survey
A. Broder and M. Mitzenmacher · 2004
Earlier work this paper cites.
The bloomier filter: an efficient data structure for static support lookup tables
B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal · 2004
Earlier work this paper cites.
Hierarchical bloom filter arrays (HBA): a novel, scalable metadata management system for large cluster-based storage
Y. Zhu, H. Jiang, and J. Wang · 2004
Earlier work this paper cites.
A prevention model for algorithmic complexity attacks
S. Khan and I. Traore · 2005
Earlier work this paper cites.
A new IP traceback system against distributed denial-of-service attacks
R. P. Laufer, P. B. Velloso, D. D. O. Cunha, I. M. Moraes, M. D. Bicudo, and O. C. M. Duarte · 2005
Earlier work this paper cites.
An optimal bloom filter replacement
A. Pagh, R. Pagh, and S. S. Rao · 2005
Earlier work this paper cites.
Weighted bloom filter
J. Bruck, J. Gao, and A. Jiang · 2006
Earlier work this paper cites.
De dictionariis dynamicis pauco spatio utentibus
E. Demaine, F. der Heide, R. Pagh, and M. Pǎtraşcu · 2006
Cited alongside, same era.
Approximately detecting duplicates for streaming data using stable bloom filters
F. Deng and D. Rafiei · 2006
Cited alongside, same era.
Cache-, hash-and space-efficient bloom filters
F. Putze, P. Sanders, and J. Singler · 2007
Cited alongside, same era.
Uniform hashing in constant time and optimal space
A. Pagh and R. Pagh · 2008
Cited alongside, same era.
Optimizing data popularity conscious bloom filters
M. Zhong, P. Lu, K. Shen, and J. Seiferas · 2008
Cited alongside, same era.
Exploiting unix file-system races via algorithmic complexity attacks
X. Cai, Y. Gui, and R. Johnson · 2009
Cited alongside, same era.
On the vulnerability of hardware hash tables to sophisticated attacks
U. Ben-Porat, A. Bremler-Barr, H. Levy, and B. Plattner · 2012
Later among the works it cites.
Don’t thrash: how to cache your hash on flash
M. A. Bender, M. Farach-Colton, R. Johnson, R. Kraner, B. C. Kuszmaul, D. Medjedovic, P. Montes, P. Shetty, R. P. Spillane, and E. Zadok · 2012
Later among the works it cites.
Theory and practice of bloom filters for distributed systems
S. Tarkoma, C. E. Rothenberg, E. Lagerspetz, et al · 2012
Later among the works it cites.
How robust are linear sketches to adaptive inputs?
M. Hardt and D. P. Woodruff · 2013
Later among the works it cites.
Sliding bloom filters
M. Naor and E. Yogev · 2013
Later among the works it cites.
Cuckoo filter: Practically better than Bloom
B. Fan, D. G. Andersen, M. Kaminsky, and M. D. Mitzenmacher · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bootstrapping a hop-optimal network in the weak sensor model
M. Farach-Colton, R. J. Fernandes, and M. A. Mosteiro · 2009
Cited alongside, same era.
An optimal bloom filter replacement based on matrix solving
E. Porat · 2009
Cited alongside, same era.
Backyard cuckoo hashing: Constant worst-case operations with a succinct representation
Y. Arbitman, M. Naor, and G. Segev · 2010
Cited alongside, same era.
Improving retouched bloom filter for trading off selected false positives against false negatives
B. Donnet, B. Baynat, and T. Friedman · 2010
Cited alongside, same era.
A lower bound for dynamic approximate membership data structures
S. Lovett and E. Porat · 2010
Cited alongside, same era.
Sketching in adversarial environments
I. Mironov, M. Naor, and G. Segev · 2011
Cited alongside, same era.
The power of evil choices in bloom filters
T. Gerbet, A. Kumar, and C. Lauradoux · 2015
Later among the works it cites.
Bloom filters in adversarial environments
M. Naor and E. Yogev · 2015
Later among the works it cites.
2-3 cuckoo filters for faster triangle listing and set intersection
D. Eppstein, M. T. Goodrich, M. Mitzenmacher, and M. R. Torres · 2017
Closest in time.
A general-purpose counting filter: Making every bit count
P. Pandey, M. A. Bender, R. Johnson, and R. Patro · 2017
Closest in time.
Adaptive cuckoo filters
M. Mitzenmacher, S. Pontarelli, and P. Reviriego · 2018
Closest in time.