Reliable computation with noisy circuits and decision trees—a general n log n lower bound
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Elements of information theory
Elements of information theory
On the complexity of finite random functions
Information Processing Letters
A coding theorem for distributed computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computing with Noisy Information
SIAM Journal on Computing
Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the design of reliable Boolean circuits that contain partially unreliable gates
Journal of Computer and System Sciences
Average-Case Lower Bounds for Noisy Boolean Decision Trees
SIAM Journal on Computing
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
SIAM Journal on Computing
Finding OR in a noisy broadcast network
Information Processing Letters
The invasiveness of off-line memory checking
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
SIAM Journal on Computing
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Boosting in the presence of noise
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Reliable cellular automata with self-organization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fault tolerant data structures
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Highly fault-tolerant parallel computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Sorting and searching in the presence of memory faults (without redundancy)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing in Fault Tolerance Broadcast Networks
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Coding for interactive communication
IEEE Transactions on Information Theory - Part 1
On the maximum tolerable noise for reliable computation by formulas
IEEE Transactions on Information Theory
A tight lower bound for parity in noisy communication networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Towards efficient designs for in-network computing with noisy wireless channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
We prove the first non-trivial (superlinear) lower bound in the noisy broadcast model of distributed computation. In this model, there are n + 1 processors P0, P1,..., Pn. Each Pi, for i\ge 1, initially has a private bit xi and thegoal is for P0 to learn f(x1, . . . , xn) for some specified function f. At each time step, a designated processor broadcasts some function of its private bit and the bits it has heard so far. Each broadcast is received by the other processors but each reception may be corrupted by noise. In this model, Gallager [16] gave a noise-resistant protocol that allows P0 to learn the entire input in O(n log log n) broadcasts. We prove that Gallager驴s protocol is optimal up to a constant factor.Our lower bound follows from a lower bound in a new model, the generalized noisy decision tree model, which may be of independent interest.