v1v2v3 (latest)

Hardness of minimal symmetry breaking in distributed computing

5 November 2018

Papers citing "Hardness of minimal symmetry breaking in distributed computing"

22 / 22 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 38 6 0 05 Nov 2024
Completing the Node-Averaged Complexity Landscape of LCLs on Trees Alkida Balliu Sebastian Brandt Fabian Kuhn Dennis Olivetti Gustav Schmid 54 2 0 02 May 2024
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
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
Distributed $Δ$ -Coloring Plays Hide-and-Seek Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 72 29 0 01 Oct 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
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 50 18 0 04 Jun 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 49 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
The Complexity Landscape of Distributed Locally Checkable Problems on Trees Yi-Jun Chang LRM 49 31 0 21 Sep 2020
Distributed Lower Bounds for Ruling Sets Alkida Balliu S. Brandt Dennis Olivetti 57 41 0 17 Apr 2020
Truly Tight-in- $Δ$ Bounds for Bipartite Maximal Matching and Variants S. Brandt Dennis Olivetti 45 26 0 19 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 63 15 0 18 Jul 2019
An Automatic Speedup Theorem for Distributed Problems S. Brandt 22 56 0 26 Feb 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 70 98 0 08 Jan 2019