Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization

25 July 2019

Papers citing "Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization"

39 / 39 papers shown

Title
Distributed Lovász Local Lemma under Bandwidth Limitations Magnús M. Halldórsson Yannic Maus Saku Peltonen 45 2 0 12 May 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 59 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 36 6 0 28 Aug 2023
Conditionally Optimal Parallel Coloring of Forests Christoph Grunau R. Latypov Yannic Maus Shreyas Pai Jara Uitto 34 1 0 01 Aug 2023
Distributed MIS with Low Energy and Time Complexities M. Ghaffari Julian Portmann 26 8 0 19 May 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 27 13 0 10 May 2023
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model Leonid Barenboim Uri Goldenberg 42 2 0 07 May 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications Yi-Jun Chang 31 5 0 10 Apr 2023
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization Peter Davies 25 1 0 29 Mar 2023
Fast algorithms for Vizing's theorem on bounded degree graphs Anton Bernshteyn A. Dhawan 24 13 0 09 Mar 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 30 9 0 14 Feb 2023
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 40 7 0 03 Nov 2022
Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel M. Parter LRM 37 3 0 07 Sep 2022
Locally Restricted Proof Labeling Schemes (Full Version) Y. Emek Yuval Gil S. Kutten 26 0 0 18 Aug 2022
Fast Distributed Vertex Splitting with Applications Magnús M. Halldórsson Yannic Maus Alexandre Nolin 33 8 0 17 Aug 2022
Fault Tolerant Coloring of the Asynchronous Cycle Pierre Fraigniaud Patrick Lambein-Monette Mikael Rabie LRM 29 2 0 22 Jul 2022
Distributed domination on sparse graph classes O. Heydt Simeon Kublenz P. D. Mendez S. Siebertz Alexandre Vigny GNN 28 2 0 06 Jul 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 62 10 0 17 May 2022
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 30 18 0 09 Feb 2022
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 28 20 0 10 Dec 2021
Improved Distributed Fractional Coloring Algorithms Alkida Balliu Fabian Kuhn Dennis Olivetti 42 5 0 08 Dec 2021
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 21 1 0 04 Aug 2021
Distributed coloring and the local structure of unit-disk graphs Louis Esperet Sébastien Julliot A. D. Mesmay 24 2 0 23 Jun 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 31 22 0 03 Jun 2021
The randomized local computation complexity of the Lovász local lemma S. Brandt Christoph Grunau Václav Rozhon 23 10 0 30 Mar 2021
Strong-Diameter Network Decomposition Yi-Jun Chang M. Ghaffari 39 15 0 19 Feb 2021
Locally Checkable Problems in Rooted Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela A. Tereshchenko 40 24 0 18 Feb 2021
Secured Distributed Algorithms Without Hardness Assumptions Leonid Barenboim Harel Levin 20 0 0 16 Nov 2020
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition M. Ghaffari Fabian Kuhn 22 54 0 09 Nov 2020
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 39 8 0 26 Sep 2020
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition David G. Harris Hsin-Hao Su H. Vu 25 9 0 22 Sep 2020
Simple, Deterministic, Constant-Round Coloring in the Congested Clique A. Czumaj Peter Davies M. Parter 30 23 0 13 Sep 2020
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization Yi-Jun Chang Thatchaphol Saranurak 8 32 0 29 Jul 2020
Improved Deterministic Network Decomposition M. Ghaffari Christoph Grunau Václav Rozhon 19 80 0 16 Jul 2020
Sleeping is Efficient: MIS in $O(1)$ -rounds Node-averaged Awake Complexity Soumyottam Chatterjee R. Gmyr Gopal Pandurangan 29 32 0 12 Jun 2020
Distance-2 Coloring in the CONGEST Model Magnús M. Halldórsson Fabian Kuhn Yannic Maus 24 15 0 13 May 2020
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
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach M. Parter 47 27 0 08 Aug 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 20 93 0 08 Jan 2019