S
Stephan Holzer
Researcher at Massachusetts Institute of Technology
Publications - 31
Citations - 954
Stephan Holzer is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Time complexity & Distributed algorithm. The author has an hindex of 11, co-authored 31 publications receiving 891 citations. Previous affiliations of Stephan Holzer include University of Mainz & ETH Zurich.
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
Networks cannot compute their diameter in sublinear time
TL;DR: A new technique is used to prove an Ω (√n + D) lower bound on approximating the girth of a graph by a factor 2 − e, which is valid even if the diameter of the network is a small constant.
Proceedings ArticleDOI
Optimal distributed all pairs shortest paths and applications
Stephan Holzer,Roger Wattenhofer +1 more
TL;DR: A new lower bound for approximating the diameter D of a graph is presented: being allowed to answer D+1 or D can speed up the computation by at most a factor D, and an algorithm is provided that achieves such a speedup of D and computes an (1+εepsilon) multiplicative approximation of the diameter.
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
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
Stephan Holzer,Nathan Pinsker +1 more
TL;DR: In this article, it was shown that any randomized (2-o(1))-approximation of all pairs shortest paths (APSP) takes Ω(n) time in the worst case, and that any negligible improvement in the approximation factor requires significantly more time.