Interactive communication: balanced distributions, correlated files, and average-case complexity

Authors:
Alon Orlitsky
Affiliations:
-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 4

Communication complexity of document exchange

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Bandwidth Efficient String Reconciliation Using Puzzles

IEEE Transactions on Parallel and Distributed Systems
Lower bounds on the deterministic and quantum communication complexities of hamming-distance problems

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Efficient communication protocols for deciding edit distance

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Suppose (X,Y) is a pair of random variables distributed over a support set S. Person P/sub x/ knows X, person P/sub y/ knows Y, and both know S. Using a predetermined protocol, they exchange binary messages in order for P/sub y/ to learn X. P/sub x/ may or may not learn Y. Bounds on communication complexity are obtained and used to obtain efficient protocols for the correlated files problem where X and Y are binary strings (files) within a small edit distance from each other. The average number of bits required for P/sub y/ to learn X when at most m messages are permitted is also determined.