4 papers
Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers
John Augustine, Henning Hillebrandt, Manish Kumar +2
We consider a recently proposed \emph{supervised distributed computing} paradigm \cite{augustine2025supervised} that extends and refines the standard master-worker paradigm for par…
Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
Henning Hillebrandt, Andreas Padalkin, Christian Scheideler +2
The decomposition of complex structures into simpler substructures is a powerful technique with a wide range of applications. We study the computation of decompositions in the cont…
Distributed And Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs
Jinfeng Dou, Thorsten Götte, Henning Hillebrandt +2
We consider the distributed and parallel construction of low-diameter decompositions with strong diameter for (weighted) graphs and (weighted) graphs that can be separated through…
Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
Jinfeng Dou, Thorsten Götte, Henning Hillebrandt +2
We consider the problem of computing compact routing tables for a (weighted) planar graph in the PRAM, CONGEST, and the novel HYBRID communication model. We present…