An Automatic Speedup Theorem for Distributed Problems

DOI10.1145/3293611.3331611OpenAlexW2964145385WikidataQ130857321 ScholiaQ130857321MaRDI QIDQ5145238

Sebastian F. Brandt

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.09958

zbMATH Keywords

distributed graph algorithmsweak coloringlocally checkable problems

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (8)

Locally checkable problems in rooted trees ⋮ Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering ⋮ Distributed coloring of hypergraphs ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 ⋮ Distributed Lower Bounds for Ruling Sets ⋮ Linial for lists ⋮ Distributed algorithms for fractional coloring

This page was built for publication: An Automatic Speedup Theorem for Distributed Problems