92 citations · 220 across the 35 of their papers we have counts for
5 papers · 1 filter
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
Stephan Friedrichs, Christoph Lenzen
A \emph{metric tree embedding} of expected \emph{stretch~} maps a weighted -node graph to a weighted tree with s…
Near-Optimal Distributed Maximum Flow
Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn +2
We present a near-optimal distributed algorithm for -approximation of single-commodity maximum flow in undirected weighted networks that runs in $(D+ \sqrt{n})\cdot n^{o(…
Efficient counting with optimal resilience
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Consider a complete communication network of nodes, where the nodes receive a common clock pulse. We study the synchronous -counting problem: given any starting state and up…
Towards Optimal Synchronous Counting
Christoph Lenzen, Joel Rybicki, Jukka Suomela
Consider a complete communication network of nodes, where the nodes receive a common clock pulse. We study the synchronous -counting problem: given any starting state and up…
Algebraic Methods in the Congested Clique
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen +3
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multipli…