Set reconciliation with nearly optimal communication complexity

  title={Set reconciliation with nearly optimal communication complexity},
  author={Yaron Minsky and Ari Trachtenberg and Richard Zippel},
  journal={IEEE Trans. Information Theory},
We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity, which we call the set reconciliation problem. We describe an approach to set reconciliation based on a polynomial encoding of sets. The resulting protocols exhibit tractable computational complexity and nearly optimal communication complexity when the sets being reconciled are sparse. Also, these protocols can be adapted to work over a broadcast channel… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 309 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 131 extracted citations

Reconciliation puzzles [separately hosted strings reconciliation]

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. • 2004
View 13 Excerpts
Method Support
Highly Influenced

Set reconciliation with an inaccurate oracle

2017 International Conference on Computing, Networking and Communications (ICNC) • 2017
View 6 Excerpts
Highly Influenced

Subspace synchronization: A network-coding approach to object reconciliation

2014 IEEE International Symposium on Information Theory • 2014
View 5 Excerpts
Highly Influenced

Efficiently repairing and measuring replica consistency in distributed databases

Distributed and Parallel Databases • 2012
View 9 Excerpts
Method Support
Highly Influenced

Exact set reconciliation based on bloom filters

Proceedings of 2011 International Conference on Computer Science and Network Technology • 2011
View 6 Excerpts
Highly Influenced

310 Citations

Citations per Year
Semantic Scholar estimates that this publication has 310 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 36 references

Efficient PDA Synchronization

IEEE Trans. Mob. Comput. • 2003
View 2 Excerpts

Practical set reconciliation,

Y. Minsky, A. Trachtenberg
Tech. Rep., Department of Electrical and Computer Engineering, Boston University, • 2002
View 1 Excerpt

Communication complexity of document exchange,

G. Cormode, M. Paterson, S.C.S. ahinhalp, U. Vishkin
ACM-SIAM Symposium on Discrete Algorithms, • 2000