IEEE - Institute of Electrical and Electronics Engineers, Inc. - Set reconciliation with nearly optimal communication complexity

Author(s): Y. Minsky ; A. Trachtenberg ; R. Zippel
Sponsor(s): IEEE Information Theory Society
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 September 2003
Volume: 49
Page Count: 6
Page(s): 2,213 - 2,218
ISSN (Paper): 0018-9448
ISSN (Online): 1557-9654
DOI: 10.1109/TIT.2003.815784
Regular:

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... View More

Advertisement