Distributed computation of symmetric functions with binary inputs

Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Volumn , Issue , 2009, Pages 76-80

  Karamchandani, Nikhil ^a   Appuswamy, Rathinakumar ^a   Franceschetti, Massimo ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY INPUTS; BINARY SYMMETRIC CHANNEL; COMPUTATION PROBLEMS; DISTRIBUTED COMPUTATIONS; PARITY FUNCTIONS; POSITIVE CONSTANT; PROBABILITY OF ERRORS; SYMMETRIC FUNCTIONS; TARGET FUNCTIONS; TRANSITION PROBABILITIES; TREE NETWORK;

TECHNICAL PRESENTATIONS;

INFORMATION THEORY;

EID: 77950670933     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWNIT.2009.5158545     Document Type: Conference Paper

References (13)

1. A. E. Gamal, "Reliable communication of highly distributed information," in Open Problems in Communication and Computation, T. M. Cover and B. Gopinath, Eds. Springer-Verlag, 1987, pp. 60-62.
2. R. G. Gallager, "Finding parity in a simple broadcast network," IEEE Transactions on Information Theory, vol. 34, no. 2, pp. 176-180, Mar. 1988.
3. N. Goyal, G. Kindler, and M. Saks, "Lower bounds for the noisy broadcast problem," SIAM Journal on Computing, vol. 37, no. 6, pp. 1806-1841, Mar. 2008.
4. U. Feige and J. Kilian, "Finding or in a noisy broadcast network," Information Processing Letters, vol. 73, no. 1-2, pp. 69-75, Jan. 2000. (Pubitemid 30563371)
5. E. Kushilevitz and Y. Mansour, "Computation in noisy radio networks," in Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, 1998, pp. 236-243.
6. I. Newman, "Computing in fault tolerance broadcast networks," in Proceedings of the nineteenth IEEE Annual Conference on Computational Complexity, 2004, pp. 113-122.
7. M. Franceschetti and R. Meester, "Random networks for communication," Cambridge University press, 2007.
8. L. Ying, R. Srikant, and G. E. Dullerud, "Distributed symmetric function computation in noisy wireless sensor networks," IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007.
9. C. Dutta, Y. Kanoria, D. Manjunath, and J. Radhakrishnan, "A tight lower bound for parity in noisy communication networks," in Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete Algorithms, 2008, pp. 1056-1065.
10. Y. Kanoria and D. Manjunath, "On distributed computation in noisy random planar networks," in Proceedings of the IEEE International Symposium on Information Theory, 2007, pp. 626-630.
11. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE Journal on Selected Areas in Communication, vol. 23, no. 4, pp. 755-764, Apr. 2005. (Pubitemid 40519630)
12. S. Subramanian, P. Gupta, and S. Shakkottai, "Scaling bounds for function computation over large networks," in Proceedings of the IEEE International Symposium on Information Theory, 2007, pp. 136-140.
13. N. Karamchandani, R. Appuswamy, and M. Franceschetti, "Distributed symmetric function computation over communication networks," Jan. 2009. [Online]. Available: http://ans.ucsd.edu/files/SymmFunc.pdf.