Silence-based communication

Authors:
Anand K. Dhulipala;Christina Fragouli;Alon Orlitsky
Affiliations:
Fraud Analytics Group, FICO, San Diego, CA;School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland;Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 17
Cited 0

Lower bounds on communication complexity

Information and Computation
Communication complexity

Complexity in information theory
Ramsey theory (2nd ed.)

Ramsey theory (2nd ed.)
Elements of information theory

Elements of information theory
Communication complexity and quasi randomness

SIAM Journal on Discrete Mathematics
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

Journal of Computer and System Sciences
The BNS lower bound for multi-party protocols is nearly optimal

Information and Computation
Communication complexity

Communication complexity
Tree Structures for Optimal Searching

Journal of the ACM (JACM)
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters

Journal of the ACM (JACM)
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Multi-party protocols

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Distributed computing paradigms for collaborative signal and information processing in sensor networks

Journal of Parallel and Distributed Computing
On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm

Journal of Discrete Algorithms
Lower bounds on information transfer in distributed computations

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Multiparty communication complexity

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Computing and communicating functions over sensor networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	754.85

Visualization

Abstract

Communication complexity--the minimum amount of communication required--for computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst case complexities are determined and the protocols achieving them are described. For functions of nonbinary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multiple-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.