Distributed MST for constant diameter graphs
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
MST construction in O(log log n) communication rounds
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Fast deterministic distributed algorithms for sparse spanners
Theoretical Computer Science
Brief announcement: a note on distributed stable matching
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed approximation algorithms for finding 2-edge-connected subgraphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
A local distributed algorithm to approximate MST in unit disc graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast distributed graph partition and application
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast deterministic distributed algorithms for sparse spanners
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
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)
Optimal deterministic routing and sorting on the congested clique
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.02 |
This paper presents a lower bound of $\Omega(D+\sqrt n/\log n)$ on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter $D=\Omega(\log n)$, in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is $O(D + \sqrt n \log^* n)$.