20 citations · 20 across the 1 of their papers we have counts for
2 papers
cs.DC2015★ 20 cited
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Liah Kor, Amos Korman, David Peleg
This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight…
cs.DC2010
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma, Stephan Holzer, Liah Kor +5
We study the {\em verification} problem in distributed networks, stated as follows. Let be a subgraph of a network where each vertex of knows which edges incident on it…