Derandomizing Local Distributed Algorithms under Bandwidth Restrictions

4 August 2016

Gregory Schwartzman

Papers citing "Derandomizing Local Distributed Algorithms under Bandwidth Restrictions"

27 / 27 papers shown

Title
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 52 11 0 14 Feb 2023
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs Manuela Fischer Jeff Giliberti Christoph Grunau 53 5 0 26 Jan 2023
A Simple Deterministic Distributed Low-Diameter Clustering Václav Rozhon Bernhard Haeupler Christoph Grunau 45 1 0 21 Oct 2022
Tight Chernoff-Like Bounds Under Limited Independence Maciej Skorski 16 4 0 04 Sep 2022
Making Self-Stabilizing any Locally Greedy Problem Johanne Cohen Laurence Pilard Mikael Rabie Jonas Sénizergues 45 3 0 31 Aug 2022
Improved Deterministic Connectivity in Massively Parallel Computation Manuela Fischer Jeff Giliberti Christoph Grunau 54 5 0 03 Jun 2022
Deterministic Massively Parallel Algorithms for Ruling Sets Shreyas Pai Sriram V. Pemmaraju 132 2 0 25 May 2022
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity Dariusz R. Kowalski Miguel A. Mosteiro 24 4 0 15 Feb 2022
Improved Deterministic $(Δ+1)$ -Coloring in Low-Space MPC A. Czumaj Peter Davies M. Parter 43 21 0 10 Dec 2021
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 66 18 0 09 Aug 2021
Efficient CONGEST Algorithms for the Lovasz Local Lemma Yannic Maus Jara Uitto 50 10 0 05 Aug 2021
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 31 18 0 04 Jun 2021
Strong-Diameter Network Decomposition Yi-Jun Chang M. Ghaffari 60 15 0 19 Feb 2021
Superfast Coloring in CONGEST via Efficient Color Sampling Magnús M. Halldórsson Alexandre Nolin 63 15 0 08 Feb 2021
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition M. Ghaffari Fabian Kuhn 56 60 0 09 Nov 2020
Simple, Deterministic, Constant-Round Coloring in the Congested Clique A. Czumaj Peter Davies M. Parter 133 23 0 13 Sep 2020
Coloring Fast Without Learning Your Neighbors' Colors Magnús M. Halldórsson Fabian Kuhn Yannic Maus Alexandre Nolin 52 10 0 10 Aug 2020
Improved Deterministic Network Decomposition M. Ghaffari Christoph Grunau Václav Rozhon 44 81 0 16 Jul 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model U. Agarwal V. Ramachandran 42 23 0 19 May 2020
Distance-2 Coloring in the CONGEST Model Magnús M. Halldórsson Fabian Kuhn Yannic Maus 44 15 0 13 May 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 62 29 0 11 Dec 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization Václav Rozhon M. Ghaffari OOD 42 196 0 25 Jul 2019
Improved Distributed Approximations for Maximum Independent Set Ken-ichi Kawarabayashi Seri Khoury Aaron Schild Gregory Schwartzman 33 9 0 27 Jun 2019
Deterministic Distributed Dominating Set Approximation in the CONGEST Model Janosch Deurer Fabian Kuhn Yannic Maus 28 26 0 26 May 2019
Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs Fabian Kuhn Chaodong Zheng 32 4 0 09 May 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 82 132 0 22 Feb 2018
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models Leonid Barenboim Michael Elkin Uri Goldenberg 51 70 0 01 Dec 2017