This paper presents near-optimal deterministic parallel and distributed algorithms for
computing (1+ eps)-approximate single-source shortest paths in any undirected weighted …

This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …

The Distributed Computing Column Page 1 The Distributed Computing Column by Stefan
Schmid Faculty of Computer Science, University of Vienna Währinger Strasse 29, AT - 1090 …

Many distributed optimization algorithms achieve existentially-optimal running times,
meaning that there exists some pathological worst-case topology on which no algorithm can …

We present a universally-optimal distributed algorithm for the exact weighted min-cut. The
algorithm is guaranteed to complete in Õ (D+√ n) rounds on every graph, recovering the …

We develop a new technique for constructing sparse graphs that allow us to prove near-
linear lower bounds on the round complexity of computing distances in the CONGEST …

We provide universally-optimal distributed graph algorithms for (1+∊)-approximate shortest
path problems including shortest-path-tree and transshipment. The universal optimality of …

While research on the geometry of planar graphs has been active in the past decades, many
properties of planar metrics remain mysterious. This paper studies a fundamental aspect of …

We present improved distributed algorithms for variants of the triangle finding problem in the
model. We show that triangle detection, counting, and enumeration can be solved in rounds …

We present a randomized distributed algorithm that computes a minimum spanning tree in τ
(G)· 2O (√(log n log log n))) rounds, in any n-node graph G with mixing time τ (G). This result …