Lower bounds for the noisy broadcast problem

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 40-49

  Goyal, Navin ^a   Kindlert, Guy ^b   Saks, Michael ^c  

^a RUTGERS UNIVERSITY   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREE MODEL; LOWER BOUNDS; NOISE RESISTANT PROTOCOL; NOISY BROADCAST PROBLEM;

BIT ERROR RATE; COMPUTATIONAL METHODS; LINEAR EQUATIONS; NETWORK PROTOCOLS; PROBLEM SOLVING; TREES (MATHEMATICS);

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748629917     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.48     Document Type: Conference Paper

References (34)

1. M. Ajtai. The invasiveness of off-line memory checking. STOC 2002, 504-513.
2. D. Aharonov, M. Ben-Or. Fault Tolerant Quantum Computation with Constant Error. STOC 1997, 176-188.
3. N. Alon, J. Spencer. The Probabilistic Method. Second Edition. Wiley, 2000.
4. Y. Aumann and M. A. Bender. Fault Tolerant Data Structures. Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), 580-589, 1996.
5. T. Cover, J. Thomas. Elements of Information Theory. Wiley, 1991
6. A. El Gamal. Open problems presented at the 1984 workshop on Specific Problems in Communication and Computation sponsored by Bell Communication Research.
7. W. Evans, C. Kenyon, Y. Peres, L. J. Schulman. Broadcasting on trees and the Ising model. Annals of Applied Probability, 10(2), 2000, pp. 410-433.
8. W. S. Evans, N. Pippenger. Average-Case Lower Bounds for Noisy Boolean Decision Trees. SIAM J. Comput., 28(2): 433-446 (1998).
9. W. S. Evans., L. J. Schulman. Signal propagation and noisy circuits. IEEE Transactions on Information Theory, 44(3), May 1998, 1299-1305.
10. U. Feige. On the Complexity of Finite Random Functions. Inf. Process. Lett., 44(6): 295-296 (1992).
11. U. Feige, J. Kilian. Finding OR in a noisy broadcast network. Inf. Process. Lett. 73(1-2): 69-75 (2000).
12. U. Feige, P. Raghavan, D. Peleg, E. Upfal. Computing with Noisy Information. SIAM J. Comput., 23(5):1001-1018 (1994).
13. I. Finocchi, G. F. Italiano. Sorting and searching in the presence of memory faults (without redundancy). STOC 2004.
14. P. Gács. Reliable Cellular Automata with Self-Organization. FOCS 1997, 90-99.
15. P. Gács, A. Gál. Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Transactions on Information Theory, Vol. 40, No. 2, 1994, pp. 579-583.
16. R. G. Gallager. Finding parity in simple broadcast networks. IEEE Transactions on Information Theory, Vol. 34, 1988, 176-180.
17. A. Kalai, R. Servedio. Boosting in the Presence of Noise. 35th Annual Symposium on Theory of Computing (STOC), 2003, pp. 196-205.
18. D. J. Kleitman, F. T. Leighton, Y. Ma. On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. J. Comput. Syst. Sci. 55(3): 385-401 (1997)
19. E. Kushilevitz, Y. Mansour. Computation in Noisy Radio Networks. SODA 1998: 236-243.
20. F. T. Leighton, Y. Ma. Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults. SIAM J. Comput., 29(1): 258-273 (1999).
21. E. Mossel. Survey: Information flow on trees. In Graphs, Morphisms and Statistical Physics. DIMACS series in discrete mathematics and theoretical computer science J. Nestril and P. Winkler editors. (2004).
22. I. Newman. Computing in fault tolerance broadcast networks. 19th IEEE Annual Conference on Computational Complexity, 2004, 113-122.
23. A. Pelc. Searching games with errors - fifty years of coping with liars. Theoret. Comput. Sci., 270 (2002), no. 1-2, 71-109.
24. N. Pippenger. On the Networks of Noisy Gates. FOCS 1985, 30-36.
25. S. Rajagopalan, L. J. Schulman. A coding theorem for distributed computing. STOC 1994, 790-799.
26. R. Reischuk, B. Schmeltz. Reliable Computation with Noisy Circuits and Decision Trees - A General n log n Lower Bound. FOCS 1991: 602-611.
27. A. Russell, M. Saks, D. Zuckerman. Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. SIAM Journal on Computing, 31(6):1645-1662, 2003.
28. L. Schulman. Coding for Interactive Communication. IEEE Trans. Information Theory, 42(6) Part I, 1745-1756, Nov.1996.
29. D. A. Spielman. Highly Fault-Tolerant Parallel Computation. FOCS 1996, 154-163.
30. M. Szegedy, X. Chen. Computing Boolean Functions from Multiple Faulty Copies of Input Bits. LATIN 2002, 539-553.
31. M. Talagrand. On Russo's approximate zero-one law. Ann. Probab. 22 (1994), no. 3, 1576-1587.
32. M. Talagrand. How much are increasing sets positively correlated? Combinatorica 16 (1996), no. 2, 243-258.
33. A. Yao. Probabilistic computations: Towards a unified measure of complexity, In Proceedings of the Seventeenth IEEE Conference on Foundations of Computer Science, 1977, pages 222-227.
34. A. Yao. "On the Complexity of Communication under Noise". Invited talk in the 5th ISTCS conference, 1997.