Counting bits for distributed function computation

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 652-656

  Ayaso, Ola ^a   Shah, Devavrat ^a   Dahleh, Munther A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; DISTRIBUTED FUNCTIONS; FINITE NUMBERS; FUNCTION VALUES; GRAPH STRUCTURES; INFORMATION-THEORETIC ANALYSIS; INITIAL VALUES; INTERNATIONAL SYMPOSIUM; LOWER BOUNDS; NETWORK TOPOLOGIES; RUNNING TIME; UPPER BOUNDS;

CONTROL THEORY; CYBERNETICS; ELECTRIC NETWORK TOPOLOGY; ESTIMATION; FUNCTIONS; GRAPH THEORY; INFORMATION THEORY; TECHNICAL PRESENTATIONS; TOPOLOGY;

RISK ASSESSMENT;

EID: 52349091622     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595067     Document Type: Conference Paper

References (3)

1. We refer the reader to a comprehensive list of references in [3].
2. O. Ayaso, D. Shah, and M.A. Dahleh. "Lower bounds on information rates for distributed computation via noisy channels." Preliminary version in Forty-Fifth Annual Allerton Conference on Communication, Control and Computing, September 2007.
3. D. Mosk-Aoyama and D. Shah. "Computing separable functions via gossip." Preliminary version appeared in ACM Principles of Distributed Computation, 2006.