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

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

A classic 1993 paper by Althöfer et al. proved a tight reduction from spanners, emulators,
and distance oracles to the extremal function γ of high-girth graphs. This paper initiated a …

Spanners for metric spaces have been extensively studied, perhaps most notably in low-
dimensional Euclidean spaces-due to their numerous applications. Euclidean spanners can …

We present a new algorithmic framework for distributed network optimization in the presence
of eavesdropper adversaries, also known as passive wiretappers. In this setting, the …

We present a new algorithmic approach to distributed secure algorithms that is based on
combining two independent lines of research: secure computation and distributed universal …

Graph coloring is fundamental to distributed computing. We give the first general treatment
of the coloring of virtual graphs, where the graph $ H $ to be colored is locally embedded …

We study the store-and-forward packet routing problem for simultaneous multicasts, in which
multiple packets have to be forwarded along given trees as fast as possible. This is a natural …

Graph problems have been widely researched and possess a broad class of applications.
The increasing large-scale graphs in various applications have necessitated the …

The local interaction system is the system in which multiple computing entities communicate
locally to achieve a specific goal, and many models of the local interaction system has been …