The Complexity Landscape of Distributed Locally Checkable Problems on Trees

21 September 2020

Papers citing "The Complexity Landscape of Distributed Locally Checkable Problems on Trees"

19 / 19 papers shown

Title
Distributed Quantum Advantage for Local Problems Alkida Balliu S. Brandt Xavier Coiteux-Roy Francesco d’Amore Massimo Equi ... Dennis Olivetti M. Renou Jukka Suomela Lucas Tendick Isadora Veeren 41 6 0 05 Nov 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 76 2 0 12 Nov 2023
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index Anton Bernshteyn F. Weilacher 61 6 0 28 Aug 2023
On the Node-Averaged Complexity of Locally Checkable Problems on Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti Gustav Schmid 40 4 0 08 Aug 2023
Conditionally Optimal Parallel Coloring of Forests Christoph Grunau R. Latypov Yannic Maus Shreyas Pai Jara Uitto 63 2 0 01 Aug 2023
Recurrent Problems in the LOCAL model A. Agrawal John E. Augustine David Peleg Srikkanth Ramachandran 55 1 0 30 Dec 2022
Optimal Deterministic Massively Parallel Connectivity on Forests Alkida Balliu R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 68 5 0 07 Nov 2022
Exponential Speedup Over Locality in MPC with Optimal Memory Alkida Balliu S. Brandt Manuela Fischer R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 65 5 0 19 Aug 2022
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees S. Brandt Yi-Jun Chang Jan Grebík Christoph Grunau Václav Rozhon Zoltán Vidnyánszky 42 1 0 20 Apr 2022
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
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 59 20 0 09 Feb 2022
Towards a Complexity Classification of LCL Problems in Massively Parallel Computation S. Brandt R. Latypov Jara Uitto 50 0 0 17 Dec 2021
Locality in online, dynamic, sequential, and distributed graph algorithms Amir Akbari N. Eslami Henrik Lievonen Darya Melnyk Joona Särkijärvi Jukka Suomela 63 10 0 14 Sep 2021
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 120 1 0 04 Aug 2021
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics Sebastian Brandt Yi-Jun Chang Jan Grebík Christoph Grunau Václav Rozhon Zoltán Vidnyánszky 52 29 0 03 Jun 2021
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
Distributed graph problems through an automata-theoretic lens Yi-Jun Chang Jan Studený Jukka Suomela 64 20 0 18 Feb 2020