Title :
Practical protocols for interactive communication
Author :
Orlitsky, Alon ; Viswanathan, Krishnamurthy
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA
Abstract :
The problem of interactive communication of correlated files is further studied. A computationally feasible protocol is presented and bounds on its communication complexity and the number of rounds are derived
Keywords :
communication complexity; computer networks; interactive systems; protocols; communication complexity; computationally feasible protocol; correlated files; interactive communication; practical protocols; Complexity theory; Linux; Protocols; Testing; Upper bound;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935978
