On the analysis of Bloom filters
暂无分享,去创建一个
[1] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..
[2] C.S. Roberts,et al. Partial-match retrieval via the method of superimposed codes , 1979, Proceedings of the IEEE.
[3] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[4] James K. Mullin,et al. Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters , 1987, Comput. J..
[5] Michael Mitzenmacher,et al. Less Hashing, Same Performance: Building a Better Bloom Filter , 2006, ESA.
[6] Kenneth J. Christensen,et al. A new analysis of the false positive rate of a Bloom filter , 2010, Inf. Process. Lett..
[7] Fabio Grandi. The γ-transform Approach : a New Method for the Study of a Discrete and Finite Random Variable , 2015 .
[8] Michiel H. M. Smid,et al. On the false-positive rate of Bloom filters , 2008, Inf. Process. Lett..