How much does randomness help with locally checkable problems?

v1v2 (latest)

How much does randomness help with locally checkable problems?

18 February 2019

Dennis Olivetti

ArXiv (abs)PDF HTML

Papers citing "How much does randomness help with locally checkable problems?"

10 / 10 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
Reactive Proof Labeling Schemes for Distributed Decision Jiaqi Chen Shlomi Dolev S. Kutten 35 0 0 04 Nov 2020
The Complexity Landscape of Distributed Locally Checkable Problems on Trees Yi-Jun Chang LRM 46 31 0 21 Sep 2020
A Breezing Proof of the KMW Bound Corinna Coupette Christoph Lenzen 67 5 0 14 Feb 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 60 15 0 18 Jul 2019
Fast Deterministic Algorithms for Highly-Dynamic Networks K. Censor-Hillel Neta Dafni V. I. Kolobov A. Paz Gregory Schwartzman 67 5 0 13 Jan 2019