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
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP M. Ghaffari Anton Trygub 56 4 0 23 Sep 2024
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs Maxime Flin Magnús M. Halldórsson Alexandre Nolin 63 2 0 20 Aug 2024
Shared Randomness Helps with Local Distributed Problems Alkida Balliu Mohsen Ghaffari Fabian Kuhn Augusto Modanese Dennis Olivetti Mikael Rabie Jukka Suomela Jara Uitto 57 4 0 07 Jul 2024
Distributed Delta-Coloring under Bandwidth Limitations Yannic Maus Magnús M. Halldórsson 62 5 0 16 May 2024
Distributed Lovász Local Lemma under Bandwidth Limitations Magnús M. Halldórsson Yannic Maus Saku Peltonen 57 2 0 12 May 2024
Local Advice and Local Decompression Alkida Balliu Sebastian Brandt Fabian Kuhn Krzysztof Nowicki Dennis Olivetti Eva Rotenberg Jukka Suomela 56 1 0 07 May 2024
On Distributed Computation of the Minimum Triangle Edge Transversal K. Censor-Hillel Majd Khoury 90 0 0 21 Feb 2024
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs Yuval Gil 83 1 0 14 Feb 2024
Distributed Binary Labeling Problems in High-Degree Graphs Henrik Lievonen Timothé Picavet Jukka Suomela 58 2 0 19 Dec 2023
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model Yi-Jun Chang Gopinath Mishra Hung Thuan Nguyen Mingyang Yang Yu-Cheng Yeh 51 2 0 03 Dec 2023
The Message Complexity of Distributed Graph Optimization Fabien Dufoulon Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson 60 6 0 24 Nov 2023
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 71 2 0 12 Nov 2023
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index Anton Bernshteyn F. Weilacher 48 6 0 28 Aug 2023
On the Node-Averaged Complexity of Locally Checkable Problems on Trees Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti Gustav Schmid 23 4 0 08 Aug 2023
Fast Coloring Despite Congested Relays Maxime Flin Magnús M. Halldórsson Alexandre Nolin 60 3 0 02 Aug 2023
Conditionally Optimal Parallel Coloring of Forests Christoph Grunau R. Latypov Yannic Maus Shreyas Pai Jara Uitto 51 2 0 01 Aug 2023
No distributed quantum advantage for approximate graph coloring Xavier Coiteux-Roy Francesco d’Amore Rishikesh R. Gajjala Fabian Kuhn Franccois Le Gall Henrik Lievonen Augusto Modanese M. Renou Gustav Schmid Jukka Suomela 74 15 0 18 Jul 2023
Distributed MIS with Low Energy and Time Complexities M. Ghaffari Julian Portmann 37 10 0 19 May 2023
A Near-Optimal Deterministic Distributed Synchronizer M. Ghaffari Anton Trygub 41 5 0 10 May 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 38 13 0 10 May 2023
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model Leonid Barenboim Uri Goldenberg 59 2 0 07 May 2023
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs Yi-Jun Chang Zeyong Li 62 6 0 02 May 2023
Coloring Fast with Broadcasts Maxime Flin M. Ghaffari Magnús M. Halldórsson Fabian Kuhn Alexandre Nolin 80 7 0 19 Apr 2023
List Defective Colorings: Distributed Algorithms and Applications Marc Fuchs Fabian Kuhn 29 10 0 19 Apr 2023
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model Yi-Jun Chang Oren Hecht Dean Leitersdorf 17 0 0 13 Apr 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications Yi-Jun Chang 43 5 0 10 Apr 2023
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization Peter Davies 47 1 0 29 Mar 2023
Faster Deterministic Distributed MIS and Approximate Matching M. Ghaffari Christoph Grunau 55 23 0 28 Mar 2023
Optimal Message-Passing with Noisy Beeps Peter Davies 13 2 0 27 Mar 2023
Fast algorithms for Vizing's theorem on bounded degree graphs Anton Bernshteyn A. Dhawan 50 13 0 09 Mar 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 55 11 0 14 Feb 2023
Distributed Self-Stabilizing MIS with Few States and Weak Communication George Giakkoupis Isabella Ziccardi 41 5 0 12 Jan 2023
$(1-ε)$ -Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings Shang-En Huang Hsin-Hao Su 49 2 0 29 Dec 2022
Fast Distributed Brooks' Theorem Manuela Fischer Yannic Maus Magnús M. Halldórsson OOD 41 17 0 14 Nov 2022
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 60 8 0 03 Nov 2022
A Simple Deterministic Distributed Low-Diameter Clustering Václav Rozhon Bernhard Haeupler Christoph Grunau 45 1 0 21 Oct 2022
Self-stabilization and byzantine tolerance for maximal independent Johanne Cohen Laurence Pilard François Pirot Jonas Sénizergues 16 0 0 12 Oct 2022
Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel M. Parter LRM 60 3 0 07 Sep 2022
Making Self-Stabilizing any Locally Greedy Problem Johanne Cohen Laurence Pilard Mikael Rabie Jonas Sénizergues 45 3 0 31 Aug 2022
Exponential Speedup Over Locality in MPC with Optimal Memory Alkida Balliu S. Brandt Manuela Fischer R. Latypov Yannic Maus Dennis Olivetti Jara Uitto 52 5 0 19 Aug 2022
Locally Restricted Proof Labeling Schemes (Full Version) Y. Emek Yuval Gil S. Kutten 45 0 0 18 Aug 2022
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring Peter Davies 57 17 0 18 Aug 2022
Node and Edge Averaged Complexities of Local Graph Problems Alkida Balliu M. Ghaffari Fabian Kuhn Dennis Olivetti 53 7 0 17 Aug 2022
Fast Distributed Vertex Splitting with Applications Magnús M. Halldórsson Yannic Maus Alexandre Nolin 48 8 0 17 Aug 2022
Locally-iterative $(Δ+1)$ -Coloring in Sublinear (in $Δ$ ) Rounds Xinyu Fu Yitong Yin Chaodong Zheng 22 1 0 29 Jul 2022
Fault Tolerant Coloring of the Asynchronous Cycle Pierre Fraigniaud Patrick Lambein-Monette Mikael Rabie LRM 48 2 0 22 Jul 2022
Distributed domination on sparse graph classes O. Heydt Simeon Kublenz P. D. Mendez S. Siebertz Alexandre Vigny GNN 50 2 0 06 Jul 2022
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs Michal Dory M. Ghaffari S. Ilchi 51 6 0 10 Jun 2022
Distributed Edge Coloring in Time Polylogarithmic in $Δ$ Alkida Balliu S. Brandt Fabian Kuhn Dennis Olivetti 49 18 0 02 Jun 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