1Bloom,BH.Space/time trade-offs in hash coding with allowable errors[].Communications of the ACM.1970
2Mitzenmacher M.Compressed bloom filters[].IEEE ACM Transactions on Networking.2002
3Cohen S,Matias Y.Spectral bloom filters[].SIGMOD’Proceedings of the ACM SIGMOD International Conference on Management of Data.2003
4Knuth,D. E. The Art of Computer Programming, Volume 3: Sorting and Searching . 1973
5M. V. Ramakrishana.Practical performance of Bloom filters and parallel free-text searching[].Communications of the ACM.1989
6Dillinger P C,Manolios P.Bloom filters in probabilistic verification[].Proceedings of the th International Conference on Formal Methods in Computer-Aided Design.2004
7.Cloud computing[]..
8Kirsch A,Mitzenmacher M.Building a Better Bloom Filter. Harvard University Computer Science Technical Report TR-02-05 . 2005
