5 citations · 8 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
The Bloom Tree
Lum Ramabaja, Arber Avdullahu
We introduce a data structure that allows for efficient (probabilistic) presence proofs and non-probabilistic absence proofs in a bandwidth efficient and secure way. The Bloom tree…
cs.DS2019★ 5 cited
The Distributed Bloom Filter
Lum Ramabaja, Arber Avdullahu
The Distributed Bloom Filter is a space-efficient, probabilistic data structure designed to perform more efficient set reconciliations in distributed systems. It guarantees eventua…