Computing in fault tolerance broadcast networks

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 113-122

  Newman, Ilan ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DECISION MAKING; FAULT TOLERANT COMPUTER SYSTEMS; FUNCTION EVALUATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBABILITY;

BOOLEAN FUNCTION; BROADCAST NETWORKS; DECISION TREE; ERROR PROBABILITIES;

BROADCASTING;

EID: 4944255014     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. R. L. Dobrushin and S. I. Ortyakov. Upper bounds for the redundancy of self-correcting arrangements of unreliable functions. Problems of Information Transmission, pages 203-218, 1977.
2. A. El-Gamal. Open problems presented at the 1984 workshop on specific problems in communication and computation, sponsored by bell communication research, 1984.
3. W. Evans and N. Pippenger. Lower bounds for noisy boolean decision trees. In Proc. 28, STOC, pages 620-628, 1996.
4. U. Feige and J. Kilian. Finding or in noisy broadcast network. IPL, pages 69-75, 2000.
5. U. Feige, P. Raghavan, D. Peleg, and E. Upfal. Computing with noisy information. SIAM J. Comput., 23(5):1001-1018, 1994.
6. P. Gács. Reliable computation with cellular automata. JCSS, 32:15-78, 1986.
7. A. Gál. Lower bounds for the complexity of reliable boolean circuits with noisy gates. In FOCS, pages 594-601, 1991.
8. R. G. Gallager. Finding parity in simple broadcast networks. IEEE Trans. on Information Theory, 34:176-180, 1988.
9. S. Karlin and H. M. Taylor. A First course in stochastic processes, Second Edition. Academic Press, 1975.
10. C. Kenyon and V. King. On boolean decision trees with faulty nodes. Random Structures and Algorithms, 5(3):453-464, 1994.
11. E. Kushilevitz and Y. Mansour. Computation in noisy radio networks, In SODA, pages 236-243, 1998.
12. A. V. Kuznetsov. Information storage in memory assembled form unreliable components. Problems of Information Transmission, 9:254-264, 1973.
13. V. I. Levenšteǐn, Lower bounds for codes with a fixed weight of vectors (in russian). Problemy Peredači Informacii, 7:3-12, 1971.
14. N. Pippenger. On networks of noisy gates. In FOCS, pages 30-38, 1985.
15. R. Rajagopalan and L. J. Schulman. A coding theorem for distributed computation. In STOC, pages 790-799, 1994.
16. R. Reischuk and B. Schmeltz. Reliable computation with noisy circuits and decision trees-a general n log n lower bound. In FOCS, pages 602-611, 1991.
17. L. J. Schulman. Communication on noisy channels: A coding theorem for computation. In FOCS, pages 724-733, 1992.
18. L. J. Schulman. Deterministic coding for interactive communication. In STOC, pages 747-756, 1993.
19. D. A. Spielman. Highly fault tolerant parallel computation. In FOCS, pages 154-163, 1996.
20. M. J. Taylor. Reliable information storage in memories designed form unreliable components. Bell System Technical Journal, 47:2299-2337, 1968.
21. J. Von-Neumann. Probabilistic logics and the synthesis of reliable organisms for unreliable components, Automated Studies, C. E. Shannon and J. McCarthy Eds, pages 329-378. Princeton University Press, 1956.
22. A. C. Yao. On the complexity of communication under noise. 1997.