5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2010★ 1 cited
The Deletable Bloom filter: A new member of the Bloom family
Christian Esteve Rothenberg, Carlos A. B. Macapuna, Fabio L. Verdi +1
We introduce the Deletable Bloom filter (DlBF) as a new spin on the popular data structure based on compactly encoding the information of where collisions happen when inserting ele…
cs.DS2009★ 5 cited
In-packet Bloom filters: Design and networking applications
Christian Esteve Rothenberg, Carlos A. Macapuna, Fabio L. Verdi +2
The Bloom filter (BF) is a well-known space-efficient data structure that answers set membership queries with some probability of false positives. In an attempt to solve many of th…