Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
On the Sperner Capacity of the Cyclic Triangle
Journal of Algebraic Combinatorics: An International Journal
A coding theorem for distributed computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Optimal space lower bounds for all frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Efficient gossip-based aggregate computation
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
The price of validity in dynamic networks
Journal of Computer and System Sciences
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Fault-Tolerant Aggregation by Flow Updating
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Communication Complexity with Synchronized Clocks
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Information theoretic bounds for distributed computation over networks of point-to-point channels
IEEE Transactions on Information Theory
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
LiMoSense --- live monitoring in dynamic sensor networks
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Coding for interactive communication
IEEE Transactions on Information Theory - Part 1
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Toward a theory of in-network computation in wireless sensor networks
IEEE Communications Magazine
| Hi-index | 0.00 |
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research, since the very beginning, has been to tolerate crash failures. It is thus natural to ask "If we want to compute a certain function in a fault-tolerant way, what will the communication complexity be?" This natural question, interestingly, has not been formally posed and thoroughly studied prior to this work. Whether fault-tolerant communication complexity is interesting to study largely depends on how big a difference failures make. This paper proves that the impact of failures is significant, at least for the SUM aggregation function in general networks: As our central contribution, we prove that there exists (at least) an exponential gap between the non-fault-tolerant and fault-tolerant communication complexity of SUM. Our results also imply the optimality (within polylog factors) of some recent fault-tolerant protocols for computing SUM via duplicate-insensitive techniques, thereby answering an open question as well. Part of our results are obtained via a novel reduction from a new two-party problem UNIONSIZECP that we introduce. UNIONSIZECP comes with a novel cycle promise, which is the key enabler of our reduction. We further prove that this cycle promise and UNIONSIZECP likely play a fundamental role in reasoning about fault-tolerant communication complexity.