B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Commun. ACM, vol.13, issue.7, pp.422-426, 1970.

S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, Theory and practice of bloom filters for distributed systems, IEEE Communications Surveys and Tutorials, vol.14, issue.1, pp.131-155, 2012.

B. Donnet, B. Baynat, and T. Friedman, Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives, CoNEXT, p.13, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01500488

R. P. Laufer, P. B. Velloso, and O. C. Duarte, A generalized bloom filter to secure distributed network applications, Computer Networks, vol.55, issue.8, pp.1804-1819, 2011.

D. Guo, J. Wu, H. Chen, Y. Yuan, and X. Luo, The dynamic bloom filters, IEEE Trans. Knowl. Data Eng, vol.22, issue.1, pp.120-133, 2010.

A. Goel and P. Gupta, Small subset queries and bloom filters using ternary associative memories, with applications, SIGMETRICS, pp.143-154, 2010.

S. Negi, A. Dubey, A. Bagchi, M. Yadav, N. Yadav et al., Dynamic partition bloom filters: A bounded false positive solution for dynamic set membership, CoRR, 2019.

M. Mitzenmacher, S. Pontarelli, and P. Reviriego, Adaptive cuckoo filters, pp.36-47, 2018.

M. A. Bender, M. Farach-colton, M. Goswami, R. Johnson, S. Mccauley et al., Bloom filters, adaptivity, and the dictionary problem, FOCS, pp.182-193, 2018.

L. Fan, P. Cao, J. M. Almeida, and A. Z. Broder, Summary cache: a scalable wide-area web cache sharing protocol, IEEE/ACM Trans. Netw, vol.8, issue.3, pp.281-293, 2000.