Database Paper Browser

Back to papers

Robust Set Reconciliation via Locality Sensitive Hashing

Summary: Combine Invertible Bloom Lookup Tables with locality-sensitive hashing to perform communication-efficient robust set reconciliation in metric spaces, improving earth mover’s distance approximation from prior O(d) to O(log n). Also introduce a new per-point closeness variant with schemes that achieve sublinear communication under mild conditions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1752
Venue
PODS
Year
2019
Pagerank
4.1945683e-05
Overall Rank
11,642 | 19.01%
DOI
10.1145/3294052.3319690

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4,297 Robust Set Reconciliation 2014 SIGMOD 6.2885419e-05
Previous Page 1 / 1 Next

Semantically Similar Papers