Coding theorem for distributed computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 790-799

  Rajagopalan, Sridhar ^a   Schulman, Leonard ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY; INTERACTIVE COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBABILITY; THEOREM PROVING;

INTERACTIVE PROTOCOLS; NOISELESS MODELS; NOISY MODELS; SHANNON'S CLASSICAL CODING THEOREM;

ENCODING (SYMBOLS);

EID: 0028126128     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195462     Document Type: Conference Paper

References (36)

1. R. Aleliunas. Randomized parallel communication. In Pro-ceedings of the Symposium on the Principles of Distributed Systems., 1982, pages 60-72.
2. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
3. R. L. Dobrushin and S. I. Ortyukov. Lower bound for the re-dundancy of self-correcting arrangements of unreliable func-Tional elements. Prob. Inf. Trans., 13:59-65, 1977.
4. R. L. Dobrushin and S. I. Ortyukov. Upper bound for the re-dundancy of self-correcting arrangements of unreliable func-Tional elements. Prob. Inf. Trans., 13:203-218, 1977.
5. W. Evans and L. J. Schulman. Signal propagation, with ap-plication to a lower bound on the depth of noisy formulas. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 594-603, 1993.
6. T. Feder. Reliable computation by networks in the pres-ence of noise. IEEE Transactions on Information Theory, 35(3):569-571, May 1989.
7. P. Gács. Reliable computation with cellular automata. J. Computer and System Sciences, 32:15-78, 1986.
8. P. Gács and J. Reif. A simple three-dimensional real-Time reliable cellular array. J. Computer and System Sciences, 36:125-147, 1988.
9. A. Gál. Lower bounds for the complexity of reliable boolean circuits with noisy gates. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 594-601, 1991.
10. R. G. Gallager. Finding parity in a simple broadcast net-work. IEEE Trans. Inform. Theory, 34(2): 176-180, March 1988.
11. Lipton and Sedgewick. Lower bounds for VLSI. In Proceed-ings of the 13th Annual Symposium on Theory of Comput-ing, pages 300-307, 1981.
12. L. Lovasz. Communication complexity: A survey. In Ko-rde et al, editor, Algorithms and Combinatorics. Springer- Verlag, 1990.
13. M. Luby. On the parallel complexity of symmetric connec-Tion networks. U. Toronto CS Dept. Tech. Report # 214, 1988.
14. C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as good as Synchronous PRAMs. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 590-599, 1990.
15. N. Nisan Personal Communication.
16. C. H. Papadimitriou and M. Sipser. Communication com-plexity. In Proceedings of the 14th Annual Symposium on Theory of Computing, pages 196-200, 1982.
17. N. Pippenger. On networks of noisy gates. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 30-36, 1985.
18. N. Pippenger. Reliable computation by formulas in the pres-ence of noise. IEEE Transactions on Information Theory, 34(2):194-197, March 1988.
19. N. Pippenger. Invariance of complexity measures for net-works with unreliable gates. J. ACM, 36:531-539, 1989.
20. N. Pippenger, G. D. Stamoulis, and J. N. Tsitsiklis. On a lower bound for the redundancy of reliable networks with noisy gates. IEEE Transactions on Information Theory, 37(3):639-643, 1991.
21. A.G. Ranade. A Simpler Analysis of the Karp-Zhang Par-Allel Branch-And-Bound Method. University of California, TR, UCB/CSD 90/586, 1990.
22. A.G. Ranade. How to emulate shared memory. JCSS, 42(3):307-326, June, 1991.
23. R. Reischuk and B. Schmeltz. Reliable computation with noisy circuits and decision trees -A general nlogn lower bound. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 602-611, 1991.
24. L. J. Schulman. Communication in the Presence of Noise. PhD thesis, Massachusetts Institute of Technology, 1992.
25. L. J. Schulman. Communication on noisy channels: A cod-ing theorem for computation. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 724-733, 1992.
26. L. J. Schulman. Deterministic coding for interactive com-munication. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 747-756, 1993.
27. C. E. Shannon. A mathematical theory of communication. Bell System Tech. J., 27:379-423; 623-656, 1948.
28. M. C. Taylor. Reliable information storage in memories de-signed from unreliable components. Bell System Tech. J., 47(10) :2299-2337, 1968.
29. C. D. Thompson. Area-Time complexity for VLSI. In Pro-ceedings of the 11th Annual Symposium on Theory of Com-puting, pages 81-88, 1979.
30. A. L. Toom. Nonergodic multidimensional systems of au-Tomata. Problems Inform. Transmission, 10:239-246, 1974.
31. A. L. Toom. Stable and attractive trajectories in multicom- ponent systems. In R. L. Dobrushin, editor, Multicomponent Systems, volume 6 of Adv. Probab., pages 549-575. Dekker, 1980.
32. A. L. Toom. Estimates for the measures describing the behavior of stochastic systems with local interaction. In Kryukov Dobrushin and Toom, editors, Interactive Markov Processes and Their Application to the Mathematical Mod-elling of Biological Systems. Acad. Sci. USSR, 1982.
33. B. S. Tsirel'son. Reliable information storage in a system of locally interacting unreliable elements. In Interacting Markov Processes in Biology, volume 653 of Lecture Notes in Mathematics. Springer-Verlag, 1978.
34. J. von Neumann. Probabilistic logics and the synthesis of re-liable organisms from unreliable components. In C. E. Shan-non and J. McCarthy, editors, Automata Studies. Princeton University Press, 1956.
35. A. C. Yao. Some complexity questions related to distributive computing. In Proceedings of the 11th Annual Symposium on Theory of Computing, pages 209-213, 1979.
36. A. C. Yao. The entropic limitations on VLSI computations. In Proceedings of the 13th Annual Symposium on Theory of Computing, pages 308-311, 1981.