On Derandomizing Local Distributed Algorithms

6 November 2017

Papers citing "On Derandomizing Local Distributed Algorithms"

30 / 80 papers shown

Title
Classification of distributed binary labeling problems Alkida Balliu S. Brandt Yuval Efron J. Hirvonen Yannic Maus Dennis Olivetti Jukka Suomela 17 44 0 29 Nov 2019
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma S. Brandt Yannic Maus Jara Uitto 19 10 0 17 Aug 2019
Deterministic coloring algorithms in the LOCAL model Dariusz R. Kowalski Piotr Krysta 9 2 0 30 Jul 2019
Distributed Dense Subgraph Detection and Low Outdegree Orientation Hsin-Hao Su H. Vu 23 22 0 29 Jul 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization Václav Rozhon M. Ghaffari OOD 13 186 0 25 Jul 2019
P-SLOCAL-Completeness of Maximum Independent Set Approximation Yannic Maus LRM 7 0 0 24 Jul 2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Will Rosenbaum Jukka Suomela 26 15 0 18 Jul 2019
Faster Deterministic Distributed Coloring Through Recursive List Coloring Fabian Kuhn 21 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 31 7 0 28 May 2019
Deterministic Distributed Dominating Set Approximation in the CONGEST Model Janosch Deurer Fabian Kuhn Yannic Maus 6 26 0 26 May 2019
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators Lijie Chen O. Grossman 15 6 0 19 May 2019
Locality of not-so-weak coloring Alkida Balliu J. Hirvonen Christoph Lenzen Dennis Olivetti Jukka Suomela 6 12 0 11 Apr 2019
An Automatic Speedup Theorem for Distributed Problems S. Brandt 8 53 0 26 Feb 2019
How much does randomness help with locally checkable problems? Alkida Balliu S. Brandt Dennis Olivetti Jukka Suomela 11 29 0 18 Feb 2019
Local approximation of the Maximum Cut in regular graphs Étienne Bamas Louis Esperet 21 4 0 13 Feb 2019
Towards the Locality of Vizing's Theorem Hsin-Hao Su H. Vu 20 27 0 02 Jan 2019
The distributed complexity of locally checkable problems on paths is decidable Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Mikael Rabie Jukka Suomela 8 27 0 05 Nov 2018
Hardness of minimal symmetry breaking in distributed computing Alkida Balliu J. Hirvonen Dennis Olivetti Jukka Suomela 29 30 0 05 Nov 2018
Distributed coloring of graphs with an optimal number of colors Étienne Bamas Louis Esperet 22 9 0 21 Sep 2018
Deterministic Distributed Ruling Sets of Line Graphs Fabian Kuhn Yannic Maus Simon Weidner 16 24 0 18 May 2018
Almost Global Problems in the LOCAL Model Alkida Balliu S. Brandt Dennis Olivetti Jukka Suomela 24 42 0 12 May 2018
On Local Distributed Sampling and Counting Weiming Feng Yitong Yin 19 17 0 19 Feb 2018
Distributed Spanner Approximation K. Censor-Hillel Michal Dory 29 25 0 09 Feb 2018
Adapting Local Sequential Algorithms to the Distributed Setting Ken-ichi Kawarabayashi Gregory Schwartzman 27 3 0 28 Nov 2017
Deterministic Distributed Edge-Coloring with Fewer Colors M. Ghaffari Fabian Kuhn Yannic Maus Jara Uitto 17 53 0 15 Nov 2017
An Optimal Distributed $(Δ+1)$ -Coloring Algorithm? Yi-Jun Chang Wenzheng Li Seth Pettie OOD 16 78 0 03 Nov 2017
The Complexity of Distributed Edge Coloring with Small Palettes Yi-Jun Chang Qizheng He Wenzheng Li Seth Pettie Jara Uitto 16 49 0 14 Aug 2017
Improved Distributed Degree Splitting and Edge Coloring M. Ghaffari J. Hirvonen Fabian Kuhn Yannic Maus Jukka Suomela Jara Uitto 26 24 0 15 Jun 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 28 95 0 20 Apr 2017