A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Locality in distributed graph algorithms
SIAM Journal on Computing
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Communication complexity
Size-estimation framework with applications to transitive closure and reachability
Journal of Computer and System Sciences
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
External memory algorithms
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Approximation algorithms
Distributed Algorithms
SIAM Journal on Computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Distributed approximation: a survey
ACM SIGACT News
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
ACM SIGACT News
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: what can be computed without communication?
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: maintaining large dense subgraphs on dynamic networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
What can be computed without communications?
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
"Tri, tri again": finding triangles and small subgraphs in a distributed setting
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Journal of the ACM (JACM)
Fast routing table construction using small messages: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Hi-index | 0.00 |
We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it are in H. We would like to verify whether H has some properties, e.g., if it is a tree or if it is connected (every node knows in the end of the process whether H has the specified property or not). We would like to perform this verification in a decentralized fashion via a distributed algorithm. The time complexity of verification is measured as the number of rounds of distributed communication. In this paper we initiate a systematic study of distributed verification, and give almost tight lower bounds on the running time of distributed verification algorithms for many fundamental problems such as connectivity, spanning connected subgraph, and s-t cut verification. We then show applications of these results in deriving strong unconditional time lower bounds on the hardness of distributed approximation for many classical optimization problems including minimum spanning tree, shortest paths, and minimum cut. Many of these results are the first non-trivial lower bounds for both exact and approximate distributed computation and they resolve previous open questions. Moreover, our unconditional lower bound of approximating minimum spanning tree (MST) subsumes and improves upon the previous hardness of approximation bound of Elkin [STOC 2004] as well as the lower bound for (exact) MST computation of Peleg and Rubinovich [FOCS 1999]. Our result implies that there can be no distributed approximation algorithm for MST that is significantly faster than the current exact algorithm, for any approximation factor. Our lower bound proofs show an interesting connection between communication complexity and distributed computing which turns out to be useful in establishing the time complexity of exact and approximate distributed computation of many problems.