An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model

26 February 2016

Papers citing "An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model"

30 / 30 papers shown

Title
Tight Lower Bounds in the Supported LOCAL Model Alkida Balliu Thomas Boudier Sebastian Brandt Dennis Olivetti 24 0 0 01 May 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 54 1 0 12 Nov 2023
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index Anton Bernshteyn F. Weilacher 31 6 0 28 Aug 2023
Recurrent Problems in the LOCAL model A. Agrawal John E. Augustine David Peleg Srikkanth Ramachandran 25 1 0 30 Dec 2022
Optimal Deterministic Massively Parallel Connectivity on Forests Alkida Balliu R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 33 5 0 07 Nov 2022
Descriptive combinatorics and distributed algorithms Anton Bernshteyn 21 5 0 04 Aug 2022
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 25 18 0 09 Feb 2022
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 25 20 0 10 Dec 2021
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 16 1 0 04 Aug 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 27 22 0 03 Jun 2021
The randomized local computation complexity of the Lovász local lemma S. Brandt Christoph Grunau Václav Rozhon 20 10 0 30 Mar 2021
Locally Checkable Problems in Rooted Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela A. Tereshchenko 35 24 0 18 Feb 2021
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality Maciej Besta Armon Carigiet Zur Vonarburg-Shmaria Kacper Janda Lukas Gianinazzi Torsten Hoefler 22 26 0 26 Aug 2020
Improved Deterministic Network Decomposition M. Ghaffari Christoph Grunau Václav Rozhon 8 79 0 16 Jul 2020
Introduction to local certification Laurent Feuilloley 22 31 0 28 Oct 2019
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma S. Brandt Yannic Maus Jara Uitto 6 10 0 17 Aug 2019
Faster Deterministic Distributed Coloring Through Recursive List Coloring Fabian Kuhn 15 34 0 08 Jul 2019
On the Use of Randomness in Local Distributed Graph Algorithms M. Ghaffari Fabian Kuhn 26 7 0 02 Jun 2019
On the Complexity of Distributed Splitting Problems P. Bamberger M. Ghaffari Fabian Kuhn Yannic Maus Jara Uitto 26 7 0 28 May 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 15 93 0 08 Jan 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 20 29 0 07 Jan 2019
Almost Global Problems in the LOCAL Model Alkida Balliu S. Brandt Dennis Olivetti Jukka Suomela 19 42 0 12 May 2018
Improved Distributed Degree Splitting and Edge Coloring M. Ghaffari J. Hirvonen Fabian Kuhn Yannic Maus Jukka Suomela Jara Uitto 23 24 0 15 Jun 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 31 55 0 16 May 2017
Constant Space and Non-Constant Time in Distributed Computing Tuomo Lempiäinen Jukka Suomela 19 0 0 10 May 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 23 95 0 20 Apr 2017
How Long It Takes for an Ordinary Node with an Ordinary ID to Output? Laurent Feuilloley 13 14 0 19 Apr 2017
LCL problems on grids S. Brandt J. Hirvonen Janne H. Korhonen Tuomo Lempiäinen P. Östergård Christopher Purcell Joel Rybicki Jukka Suomela P. Uznański LRM 30 56 0 17 Feb 2017
Local Conflict Coloring Pierre Fraigniaud Marc Heinrich A. Kosowski 11 132 0 04 Nov 2015
A Lower Bound for the Distributed Lovász Local Lemma S. Brandt Orr Fischer J. Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto 28 128 0 03 Nov 2015