v1v2v3v4 (latest)

On Derandomizing Local Distributed Algorithms

6 November 2017

Papers citing "On Derandomizing Local Distributed Algorithms"

45 / 45 papers shown

Title
Distributed Lovász Local Lemma under Bandwidth Limitations Magnús M. Halldórsson Yannic Maus Saku Peltonen 62 2 0 12 May 2024
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms Marc Fuchs Fabian Kuhn 44 1 0 07 May 2024
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index Anton Bernshteyn F. Weilacher 58 6 0 28 Aug 2023
Edge-Coloring Algorithms for Bounded Degree Multigraphs A. Dhawan 53 3 0 13 Jul 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 63 11 0 14 Feb 2023
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 68 8 0 03 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 62 5 0 19 Aug 2022
Fast Distributed Vertex Splitting with Applications Magnús M. Halldórsson Yannic Maus Alexandre Nolin 56 8 0 17 Aug 2022
$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$ Narrowing the LOCAL $\unicode{x2013}$ CONGEST Gaps in Sparse Networks via Expander Decompositions Yi-Jun Chang Hsin-Hao Su 92 10 0 17 May 2022
Improved Distributed Fractional Coloring Algorithms Alkida Balliu Fabian Kuhn Dennis Olivetti 79 5 0 08 Dec 2021
Near-Optimal Distributed Degree+1 Coloring Magnús M. Halldórsson Fabian Kuhn Alexandre Nolin Tigran Tonoyan 55 39 0 01 Dec 2021
Efficient CONGEST Algorithms for the Lovasz Local Lemma Yannic Maus Jara Uitto 55 10 0 05 Aug 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 61 24 0 03 Jun 2021
Distributed Graph Coloring Made Easy Yannic Maus 65 25 0 12 May 2021
Strong-Diameter Network Decomposition Yi-Jun Chang M. Ghaffari 65 15 0 19 Feb 2021
Local Mending Alkida Balliu J. Hirvonen Darya Melnyk Dennis Olivetti Joel Rybicki Jukka Suomela LRM 85 9 0 17 Feb 2021
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition David G. Harris Hsin-Hao Su H. Vu 73 9 0 22 Sep 2020
The Complexity Landscape of Distributed Locally Checkable Problems on Trees Yi-Jun Chang LRM 46 31 0 21 Sep 2020
Coloring Fast Without Learning Your Neighbors' Colors Magnús M. Halldórsson Fabian Kuhn Yannic Maus Alexandre Nolin 63 10 0 10 Aug 2020
Improved Deterministic Network Decomposition M. Ghaffari Christoph Grunau Václav Rozhon 56 82 0 16 Jul 2020
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma S. Brandt Christoph Grunau Václav Rozhon 55 12 0 08 Jun 2020
Distance-2 Coloring in the CONGEST Model Magnús M. Halldórsson Fabian Kuhn Yannic Maus 57 15 0 13 May 2020
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta Alkida Balliu Fabian Kuhn Dennis Olivetti 54 12 0 25 Feb 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 62 8 0 18 Feb 2020
A Breezing Proof of the KMW Bound Corinna Coupette Christoph Lenzen 67 5 0 14 Feb 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 83 29 0 11 Dec 2019
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
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma S. Brandt Yannic Maus Jara Uitto 53 10 0 17 Aug 2019
Distributed Dense Subgraph Detection and Low Outdegree Orientation Hsin-Hao Su H. Vu 93 23 0 29 Jul 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization Václav Rozhon M. Ghaffari OOD 60 196 0 25 Jul 2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Will Rosenbaum Jukka Suomela 57 15 0 18 Jul 2019
Faster Deterministic Distributed Coloring Through Recursive List Coloring Fabian Kuhn 56 34 0 08 Jul 2019
On the Use of Randomness in Local Distributed Graph Algorithms M. Ghaffari Fabian Kuhn 35 7 0 02 Jun 2019
On the Complexity of Distributed Splitting Problems P. Bamberger M. Ghaffari Fabian Kuhn Yannic Maus Jara Uitto 55 7 0 28 May 2019
Deterministic Distributed Dominating Set Approximation in the CONGEST Model Janosch Deurer Fabian Kuhn Yannic Maus 45 26 0 26 May 2019
Towards the Locality of Vizing's Theorem Hsin-Hao Su H. Vu 65 29 0 02 Jan 2019
Hardness of minimal symmetry breaking in distributed computing Alkida Balliu J. Hirvonen Dennis Olivetti Jukka Suomela 68 32 0 05 Nov 2018
Distributed coloring of graphs with an optimal number of colors Étienne Bamas Louis Esperet 129 9 0 21 Sep 2018
Almost Global Problems in the LOCAL Model Alkida Balliu S. Brandt Dennis Olivetti Jukka Suomela 59 44 0 12 May 2018
Distributed Spanner Approximation K. Censor-Hillel Michal Dory 64 25 0 09 Feb 2018
Deterministic Distributed Edge-Coloring with Fewer Colors M. Ghaffari Fabian Kuhn Yannic Maus Jara Uitto 39 54 0 15 Nov 2017
An Optimal Distributed $(Δ+1)$ -Coloring Algorithm? Yi-Jun Chang Wenzheng Li Seth Pettie OOD 70 81 0 03 Nov 2017
The Complexity of Distributed Edge Coloring with Small Palettes Yi-Jun Chang Qizheng He Wenzheng Li Seth Pettie Jara Uitto 129 50 0 14 Aug 2017
Improved Distributed Degree Splitting and Edge Coloring M. Ghaffari J. Hirvonen Fabian Kuhn Yannic Maus Jukka Suomela Jara Uitto 121 27 0 15 Jun 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 58 102 0 20 Apr 2017