An Improved Construction for Counting Bloom Filters (2006)

by Flavio Bonomi , Michael Mitzenmacher , Rina Panigrahy , Sushil Singh , George Varghese
Venue:14th Annual European Symposium on Algorithms, LNCS 4168
Citations:31 - 3 self

Active Bibliography

9 Hash-Based Techniques for High-Speed Packet Processing – Adam Kirsch, Michael Mitzenmacher, George Varghese
Hash-Based Data Structures for Extreme Conditions – Adam Lavitt Kirsch - 2008
31 Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines – Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese - 2006
for Transactional Memory Systems – Daniel Sanchez, Daniel Sanchez
33 Implementing signatures for transactional memory – Daniel Sanchez, Luke Yen, Mark D. Hill, Karthikeyan Sankaralingam - 2007
8 Rank-indexed hashing: A compact construction of bloom filters and extra bits per counter (σ) lg(M/N – Nan Hua, Haiquan (chuck Zhao, Bill Lin, Jun (jim Xu
57 Fast hash table lookup using extended Bloom filter: an aid to network processing – Haoyu Song, Sarang Dharmapurikar, Jonathan Turner, John Lockwood - 2005
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
11 Simple Summaries for Hashing with Multiple Choices – Adam Kirsch , Michael Mitzenmacher
7 Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation – Yuriy Arbitman, Moni Naor, Gil Segev - 2010
Multi-dimensional Range Query for Data Management using Bloom Filters – Yu Hua, Ting Xie
9 Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives – Benoit Donnet, Bruno Baynat, Timur Friedman - 2006
PACKET CLASSIFICATION SYSTEMS by – Haoyu Song, Haoyu Song, Advisor Professor, Jonathan S. Turner - 2006
6 Simple Summaries for Hashing with Choices – Adam Kirsch, Michael Mitzenmacher - 2008
28 Less hashing, same performance: Building a better bloom filter – Adam Kirsch, Michael Mitzenmacher - 2006
3 Generalized Bloom Filters – Rafael P. Laufer, Pedro B. Velloso, Otto Carlos M. B. Duarte
Scalable Management of Enterprise and Data-Center Networks – Minlan Yu
10 Using the Power of Two Choices to Improve Bloom Filters – Steve Lumetta, Michael Mitzenmacher - 2006
6 Bloom Filters via d-left Hashing and Dynamic Bit Reassignment – Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese - 2006