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"

9 / 9 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 70 9 0 17 Feb 2022
Locality in online, dynamic, sequential, and distributed graph algorithms Amir Akbari N. Eslami Henrik Lievonen Darya Melnyk Joona Särkijärvi Jukka Suomela 65 10 0 14 Sep 2021
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 125 1 0 04 Aug 2021
Locally Checkable Labelings with Small Messages Alkida Balliu K. Censor-Hillel Yannic Maus Dennis Olivetti Jukka Suomela 91 17 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 134 28 0 18 Feb 2021
Local Mending Alkida Balliu J. Hirvonen Darya Melnyk Dennis Olivetti Joel Rybicki Jukka Suomela LRM 103 9 0 17 Feb 2021
The Complexity Landscape of Distributed Locally Checkable Problems on Trees Yi-Jun Chang LRM 69 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 108 45 0 29 Nov 2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Will Rosenbaum Jukka Suomela 75 15 0 18 Jul 2019