On derandomizing local distributed algorithms

DOI10.1109/FOCS.2018.00069MaRDI QIDQ6944343zbMATH OpenFDO

Authors David G. Harris, Mohsen Ghaffari, Fabian Kuhn

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2018.00069

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(10)

• Brief announcement: Local advice and local decompression
• Parallel derandomization for coloring
• Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
• Locally computing edge orientations
• Local distributed rounding: generalized to MIS, matching, set cover, and beyond
• Exponential speedup over locality in \textsf{MPC} with optimal memory
• Fast algorithms for Vizing's theorem on bounded degree graphs
• The distributed complexity of locally checkable labeling problems beyond paths and trees
• Distributed symmetry breaking on power graphs via sparsification
• Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index

This page was built for publication: On derandomizing local distributed algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944343)