The distributed complexity of locally checkable problems on paths is decidable

5 November 2018

Papers citing "The distributed complexity of locally checkable problems on paths is decidable"

6 / 6 papers shown

Title
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 59 1 0 12 Nov 2023
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 30 18 0 09 Feb 2022
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 21 1 0 04 Aug 2021
Temporal Locality in Online Algorithms Maciej Pacut Mahmoud Parham Joel Rybicki Stefan Schmid Jukka Suomela A. Tereshchenko 27 0 0 18 Feb 2021
Locally Checkable Problems in Rooted Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela A. Tereshchenko 40 24 0 18 Feb 2021
Exact bounds for distributed graph colouring Joel Rybicki Jukka Suomela 114 12 0 17 Feb 2015