The distributed complexity of locally checkable problems on paths is
decidable

v1v2 (latest)

The distributed complexity of locally checkable problems on paths is decidable

5 November 2018

Dennis Olivetti

ArXiv (abs)PDF HTML

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

7 / 7 papers shown

Title
Efficient Classification of Locally Checkable Problems in Regular Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela 52 8 0 17 Feb 2022
Locally Checkable Labelings with Small Messages Alkida Balliu K. Censor-Hillel Yannic Maus Dennis Olivetti Jukka Suomela 47 16 0 12 May 2021
Locally Checkable Problems in Rooted Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela A. Tereshchenko 73 28 0 18 Feb 2021
Local Mending Alkida Balliu J. Hirvonen Darya Melnyk Dennis Olivetti Joel Rybicki Jukka Suomela LRM 85 9 0 17 Feb 2021
The Complexity Landscape of Distributed Locally Checkable Problems on Trees Yi-Jun Chang LRM 46 31 0 21 Sep 2020
Classification of distributed binary labeling problems Alkida Balliu S. Brandt Yuval Efron J. Hirvonen Yannic Maus Dennis Olivetti Jukka Suomela 56 44 0 29 Nov 2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Will Rosenbaum Jukka Suomela 63 15 0 18 Jul 2019