- HEX BLOOM: An Efficient Method for Authenticity and Integrity Verification in Privacy-preserving Computing
- Invertable Bloom Filters
- Reasoning about Identifier Spaces: How to Make Chord Correct
- Ribbon filter: practically smaller than Bloom and Xor
- Synchronizing Namespaces with Invertible Bloom Filters
- The Distributed Bloom Filter
- The Hash History Approach for Reconciling Mutual Inconsistency
- To Push or Pull: On Reducing Communication and Synchronization in Graph Computations
- What's The Difference? Efficient Set Reconciliation Without Prior Context
- XOR-Folding for Bloom Filter-based Encryptions for Privacy-preserving Record Linkage
- Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters