Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Robust Set Reconciliation via Locality Sensitive Hashing
Michael Mitzenmacher, Tom Morgan
We consider variations of set reconciliation problems where two parties, Alice and Bob, each hold a set of points in a metric space, and the goal is for Bob to conclude with a set…
cs.DS2018
Directory Reconciliation
Michael Mitzenmacher, Tom Morgan
We initiate the theoretical study of directory reconciliation, a generalization of document exchange, in which Alice and Bob each have different versions of a set of documents that…