OpenAlex
PricingAboutJobs
Log inGet started
Work

Beyond bloom filters: from approximate membership checks to approximate state machines

HTML

Year: 2006
Type: article
Source: ACM SIGCOMM Computer Communication Review
DOI: 10.1145/1151659.1159950
Authors: Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah, Sushil Singh, George Varghese
Institutions: Cisco Systems (United States), Harvard University, Stanford University
Language: English

Topic: Network Packet Processing and Optimization
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Keywords: Bloom filter, counting Bloom filter, hashing, active queue management, memory efficiency, false positives, false-negative results

Open Access status: closed
OpenAlex ID: W2103644027
FWCI: 17.96
Cites: 25
Cited by: 192
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms