L
Liah Kor
Researcher at Weizmann Institute of Science
Publications - 6
Citations - 397
Liah Kor is an academic researcher from Weizmann Institute of Science. The author has contributed to research in topics: Distributed algorithm & Upper and lower bounds. The author has an hindex of 4, co-authored 6 publications receiving 357 citations.
Papers
More filters
Journal ArticleDOI
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma,Stephan Holzer,Liah Kor,Amos Korman,Danupon Nanongkai,Gopal Pandurangan,David Peleg,Roger Wattenhofer +7 more
TL;DR: The verification problem in distributed networks is studied, 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.
Proceedings ArticleDOI
Distributed verification and hardness of distributed approximation
Atish Das Sarma,Stephan Holzer,Liah Kor,Amos Korman,Danupon Nanongkai,Gopal Pandurangan,David Peleg,Roger Wattenhofer +7 more
TL;DR: In this paper, the authors study the verification problem in distributed networks, 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.
Proceedings ArticleDOI
Tight Bounds For Distributed MST Verification
Liah Kor,Amos Korman,David Peleg +2 more
TL;DR: An MST verification algorithm that achieves simultaneously tilde ~O(|E|) messages and $tilde O(sqrt{n} + D) time, where |E| is the number of edges in the given graph G and D is G's diameter.
Journal ArticleDOI
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Liah Kor,Amos Korman,David Peleg +2 more
TL;DR: The notion of distributed verification without preprocessing is introduced and the upper bound result appears to indicate that the verification of an MST may be easier than its construction, since for MST construction, both lower bounds of $\tilde{\varOmega}(m)$ messages and \(\sqrt{n} + D)$ time hold.
Posted Content
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma,Stephan Holzer,Liah Kor,Amos Korman,Danupon Nanongkai,Gopal Pandurangan,David Peleg,Roger Wattenhofer +7 more
TL;DR: The 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].