1 |
B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors" Communications of the ACM, Vo1. 13, No. 7, pp. 422-426, Nov. 1970.
|
2 |
A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters : A Survey", Internet Mathematics, Vol. I, No. 4, pp. 485-509, 2004.
|
3 |
P. Bose, H. Guo, and E. Kranakis, "ON THE FALSE-POSITIVE RATE OF BLOOM FILTERS", School of Computers Science, Carleton University, May. 2004.
|
4 |
K. Christensen, A. Roginsky, and M. Jimeno, "A new analysis of the false positive rate of a Bloom filter", Information Processing Letters 110, pp. 944-949, 2010.
DOI
|
5 |
O. Rottenstreich and I. Keslassy, "The Bloom Paradox: When not to Use a Bloom Filter?", INFOCOM, pp. 1638-1646, Mar. 2012.
|
6 |
L. Fan, P. Cao, and J. Almeida, "Summary Cache : A Scalable Wide-Area Web Cache Sharing Protocol.", IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 281-293, June. 2000.
DOI
ScienceOn
|
7 |
R. P. Laufer, P. B. Velloso, and O. C. M. B. Duarte, "A Generalized Bloom Filter to Secure Distributed Network Applications", Computer Networks, Vol. 55, no. 8, pp. 1804-1819, June. 2011.
DOI
|