Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
- 15 May 2013
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 53 (2) , 318-340
Abstract
No abstract availableKeywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Distributed Verification and Hardness of Distributed ApproximationSIAM Journal on Computing, 2012
- Linear-Time Algorithms for Dominators and Other Path-Evaluation ProblemsSIAM Journal on Computing, 2008
- Self-stabilization by local checking and correction2002
- Memory requirements for silent stabilizationActa Informatica, 1999
- The local detection paradigm and its applications to self-stabilizationTheoretical Computer Science, 1997
- Optimal parallel verification of minimum spanning trees in logarithmic timeAlgorithmica, 1997
- A distributed control architecture of high-speed networksIEEE Transactions on Communications, 1995
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear TimeSIAM Journal on Computing, 1992
- A trade-off between information and communication in broadcast protocolsJournal of the ACM, 1990
- Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems1987