Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

In many networking systems, Bloom filters are used for high-speed set membership tests. They permit a small fraction of false… Expand

Review

2012

Review

2012

Many network solutions and overlay networks utilize probabilistic techniques to reduce information processing and networking… Expand

Highly Cited

2006

Highly Cited

2006

A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be… Expand

Highly Cited

2006

Highly Cited

2006

A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash… Expand

Highly Cited

2005

Highly Cited

2005

Hash tables are fundamental components of several network processing algorithms and applications, including route lookup, packet… Expand

Highly Cited

2004

Highly Cited

2004

There is a class of packet processing applications that inspect packets deeper than the protocol headers to analyze content. For… Expand

Review

2003

Review

2003

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership… Expand

Highly Cited

2003

Highly Cited

2003

A Bloom Filter is a space-efficient randomized data structure allowing membership queries over sets with certain allowable errors… Expand

Highly Cited

2002

Highly Cited

2002

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership… Expand

Highly Cited

2001

Highly Cited

2001

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership… Expand