v1v2 (latest)

Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization

25 July 2019

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

50 / 111 papers shown

Title
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 41 1 0 20 Apr 2022
$Distributed MIS in $O(\log\log{n} )$ Awake Complexity$ Distributed MIS in $O(\log\log{n} )$ Awake Complexity Fabien Dufoulon W. Moses Gopal Pandurangan 60 12 0 18 Apr 2022
$Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms$ Undirected $(1+\varepsilon)$ -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms Václav Rozhon Christoph Grunau Bernhard Haeupler Goran Zuzic Jason Li 58 29 0 12 Apr 2022
Moser-Tardos Algorithm with small number of random bits Endre Csóka L. Grabowski András Máthé O. Pikhurko K. Tyros 38 7 0 11 Mar 2022
Efficient Classification of Locally Checkable Problems in Regular Trees Alkida Balliu S. Brandt Yi-Jun Chang Dennis Olivetti Jan Studený Jukka Suomela 47 8 0 17 Feb 2022
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 51 20 0 09 Feb 2022
Towards a Complexity Classification of LCL Problems in Massively Parallel Computation S. Brandt R. Latypov Jara Uitto 48 0 0 17 Dec 2021
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 56 21 0 10 Dec 2021
Improved Distributed Fractional Coloring Algorithms Alkida Balliu Fabian Kuhn Dennis Olivetti 73 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
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings S. Faour Marc Fuchs Fabian Kuhn 46 11 0 20 Nov 2021
Distributed $Δ$ -Coloring Plays Hide-and-Seek Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 63 29 0 01 Oct 2021
Distributed Vertex Cover Reconfiguration K. Censor-Hillel Yannic Maus S. Peled Tigran Tonoyan 24 3 0 14 Sep 2021
Sinkless Orientation Made Simple Alkida Balliu Janne H. Korhonen Fabian Kuhn Henrik Lievonen Dennis Olivetti ... Joel Rybicki Stefan Schmid Jan Studený Jukka Suomela Jara Uitto LRM 51 5 0 05 Aug 2021
Efficient CONGEST Algorithms for the Lovasz Local Lemma Yannic Maus Jara Uitto 55 10 0 05 Aug 2021
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models P. Bastide Pierre Fraigniaud LRM 110 1 0 04 Aug 2021
Deterministic Logarithmic Completeness in the Distributed Sleeping Model Leonid Barenboim Tzalik Maimon 23 21 0 04 Aug 2021
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model Ioannis Anagnostides Themis Gouleakis 44 11 0 03 Aug 2021
Distributed coloring and the local structure of unit-disk graphs Louis Esperet Sébastien Julliot A. D. Mesmay 53 2 0 23 Jun 2021
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 42 18 0 04 Jun 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 55 24 0 03 Jun 2021
Can We Break Symmetry with o(m) Communication? Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson LRM 70 9 0 19 May 2021
Distributed Graph Coloring Made Easy Yannic Maus 56 25 0 12 May 2021
Ultrafast Distributed Coloring of High Degree Graphs Magnús M. Halldórsson Alexandre Nolin Tigran Tonoyan 27 7 0 10 May 2021
The randomized local computation complexity of the Lovász local lemma S. Brandt Christoph Grunau Václav Rozhon 49 10 0 30 Mar 2021
Strong-Diameter Network Decomposition Yi-Jun Chang M. Ghaffari 65 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 62 28 0 18 Feb 2021
Local Mending Alkida Balliu J. Hirvonen Darya Melnyk Dennis Olivetti Joel Rybicki Jukka Suomela LRM 65 9 0 17 Feb 2021
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs S. A. Amiri 31 2 0 16 Feb 2021
Superfast Coloring in CONGEST via Efficient Color Sampling Magnús M. Halldórsson Alexandre Nolin 72 15 0 08 Feb 2021
Constant round distributed domination on graph classes with bounded expansion Simeon Kublenz S. Siebertz Alexandre Vigny 23 7 0 04 Dec 2020
Approximate Bipartite Vertex Cover in the CONGEST Model S. Faour Fabian Kuhn 29 3 0 19 Nov 2020
Secured Distributed Algorithms Without Hardness Assumptions Leonid Barenboim Harel Levin 48 0 0 16 Nov 2020
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition M. Ghaffari Fabian Kuhn 69 60 0 09 Nov 2020
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model Kishore Kothapalli Shreyas Pai Sriram V. Pemmaraju 74 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 47 9 0 22 Sep 2020
The Complexity Landscape of Distributed Locally Checkable Problems on Trees Yi-Jun Chang LRM 44 31 0 21 Sep 2020
Simple, Deterministic, Constant-Round Coloring in the Congested Clique A. Czumaj Peter Davies M. Parter 146 23 0 13 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
Local Conflict Coloring Revisited: Linial for Lists Yannic Maus Tigran Tonoyan 43 41 0 30 Jul 2020
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization Yi-Jun Chang Thatchaphol Saranurak 36 34 0 29 Jul 2020
Improved Deterministic Network Decomposition M. Ghaffari Christoph Grunau Václav Rozhon 56 82 0 16 Jul 2020
A Fast Distributed Algorithm for $(Δ+ 1)$ -Edge-Coloring Anton Bernshteyn 64 1 0 28 Jun 2020
Sleeping is Efficient: MIS in $O(1)$ -rounds Node-averaged Awake Complexity Soumyottam Chatterjee R. Gmyr Gopal Pandurangan 57 34 0 12 Jun 2020
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma S. Brandt Christoph Grunau Václav Rozhon 50 11 0 08 Jun 2020
Distributed Approximation on Power Graphs R. Bar-Yehuda K. Censor-Hillel Yannic Maus Shreyas Pai Sriram V. Pemmaraju 61 9 0 06 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 Lower Bounds for Ruling Sets Alkida Balliu S. Brandt Dennis Olivetti 42 41 0 17 Apr 2020
Massively Parallel Algorithms for Distance Approximation and Spanners Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 61 20 0 02 Mar 2020
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta Alkida Balliu Fabian Kuhn Dennis Olivetti 51 12 0 25 Feb 2020