Amanote Research

Amanote Research

    RegisterSign In

An Improved Construction for Counting Bloom Filters

Lecture Notes in Computer Science - Germany
doi 10.1007/11841036_61
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2006

Authors
Flavio BonomiMichael MitzenmacherRina PanigrahySushil SinghGeorge Varghese
Publisher

Springer Berlin Heidelberg


Related search

Hardened Bloom Filters, With an Application to Unobservability

Annales UMCS, Informatica
2012English

Longest Prefix Matching Using Bloom Filters

2003English

Energy-Efficient Pipelined Bloom Filters for Network Intrusion Detection

2006English

Optimizing Data Popularity Conscious Bloom Filters

2008English

Improving Bloom Filter Performance on Sequence Data Using $$K$$ -Mer Bloom Filters

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

SyncLean: An Application for Improved Lean Construction Practice

2018English

Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage

Journal of Privacy and Confidentiality
2014English

Flow Fair Sampling Based on Multistage Bloom Filters

Telkomnika
Electronic EngineeringElectrical
2016English

Scalable VANET Content Routing Using Hierarchical Bloom Filters

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy