Author:
Kirsch Adam,Mitzenmacher Michael,Varghese George
Reference76 articles.
1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced Allocations. SIAM Journal on Computing, 29(1):180–200, 1999.
2. B. Bloom. Space/Time Tradeoffs in Hash Coding with Allowable Errors. Communications of the ACM, 13(7):422–426, 1970.
3. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines. In Proceedings of ACM SIGCOMM, pp. 315–326, 2006.
4. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. Bloom Filters via d-left Hashing and Dynamic Bit Reassignment. In Proceedings of the Allerton Conference on Communication, Control and Computing, 2006.
5. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. An Improved Construction for Counting Bloom Filters. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pp. 684–695, 2006.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献