v1v2v3 (latest)

The Locality of Distributed Symmetry Breaking

9 February 2012

Papers citing "The Locality of Distributed Symmetry Breaking"

50 / 126 papers shown

Title
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra Maciej Besta Zur Vonarburg-Shmaria Yannick Schaffner Leonardo Schwarz Grzegorz Kwa'sniewski ... Philipp Lindenberger Pavel Kalvoda Marek Konieczny O. Mutlu Torsten Hoefler 82 26 0 05 Mar 2021
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs Mélanie Cambus Davin Choo Havu Miikonen Jara Uitto 53 15 0 23 Feb 2021
Superfast Coloring in CONGEST via Efficient Color Sampling Magnús M. Halldórsson Alexandre Nolin 72 15 0 08 Feb 2021
Approximate Bipartite Vertex Cover in the CONGEST Model S. Faour Fabian Kuhn 34 3 0 19 Nov 2020
Secured Distributed Algorithms Without Hardness Assumptions Leonid Barenboim Harel Levin 49 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 80 8 0 26 Sep 2020
Time-Optimal Construction of Overlay Networks Thorsten Götte Kristian Hinnenthal Christian Scheideler Julian Werthmann 57 21 0 08 Sep 2020
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality Maciej Besta Armon Carigiet Zur Vonarburg-Shmaria Kacper Janda Lukas Gianinazzi Torsten Hoefler 97 25 0 26 Aug 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 48 41 0 30 Jul 2020
Improved Deterministic Network Decomposition M. Ghaffari Christoph Grunau Václav Rozhon 56 81 0 16 Jul 2020
Sleeping is Efficient: MIS in $O(1)$ -rounds Node-averaged Awake Complexity Soumyottam Chatterjee R. Gmyr Gopal Pandurangan 65 34 0 12 Jun 2020
Distance-2 Coloring in the CONGEST Model Magnús M. Halldórsson Fabian Kuhn Yannic Maus 57 16 0 13 May 2020
Distributed Lower Bounds for Ruling Sets Alkida Balliu S. Brandt Dennis Olivetti 57 41 0 17 Apr 2020
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond M. Ghaffari Christoph Grunau Ce Jin 62 30 0 22 Feb 2020
Truly Tight-in- $Δ$ Bounds for Bipartite Maximal Matching and Variants S. Brandt Dennis Olivetti 45 26 0 19 Feb 2020
Distributed graph problems through an automata-theoretic lens Yi-Jun Chang Jan Studený Jukka Suomela 64 20 0 18 Feb 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 62 8 0 18 Feb 2020
Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond M. Ghaffari Julian Portmann 38 14 0 09 Aug 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization Václav Rozhon M. Ghaffari OOD 60 196 0 25 Jul 2019
Faster Deterministic Distributed Coloring Through Recursive List Coloring Fabian Kuhn 56 34 0 08 Jul 2019
A Topological Perspective on Distributed Network Algorithms Armando Castañeda Pierre Fraigniaud A. Paz S. Rajsbaum Matthieu Roy Corentin Travers 58 25 0 08 Jul 2019
Improved Distributed Approximations for Maximum Independent Set Ken-ichi Kawarabayashi Seri Khoury Aaron Schild Gregory Schwartzman 50 9 0 27 Jun 2019
On the Use of Randomness in Local Distributed Graph Algorithms M. Ghaffari Fabian Kuhn 41 8 0 02 Jun 2019
On the Complexity of Distributed Splitting Problems P. Bamberger M. Ghaffari Fabian Kuhn Yannic Maus Jara Uitto 61 7 0 28 May 2019
Locality-Promoting Representation Learning Johannes Schneider 40 2 0 25 May 2019
Fast Deterministic Algorithms for Highly-Dynamic Networks K. Censor-Hillel Neta Dafni V. I. Kolobov A. Paz Gregory Schwartzman 67 5 0 13 Jan 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 99 62 0 11 Jan 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 70 98 0 08 Jan 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 61 29 0 07 Jan 2019
Towards the Locality of Vizing's Theorem Hsin-Hao Su H. Vu 67 29 0 02 Jan 2019
Distributed coloring of graphs with an optimal number of colors Étienne Bamas Louis Esperet 147 9 0 21 Sep 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 52 18 0 17 Jul 2018
Distributed Computation in Node-Capacitated Networks John E. Augustine M. Ghaffari R. Gmyr Kristian Hinnenthal Fabian Kuhn Jason Li Christian Scheideler 20 2 0 18 May 2018
Deterministic Distributed Ruling Sets of Line Graphs Fabian Kuhn Yannic Maus Simon Weidner 43 26 0 18 May 2018
Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs Fabian Kuhn Chaodong Zheng 40 4 0 09 May 2018
Distributed Maximal Independent Set on Scale-Free Networks Hasan Heydari S. Taheri K. Kavousi 20 1 0 07 Apr 2018
$A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds$ A Deterministic Distributed $2$ -Approximation for Weighted Vertex Cover in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds Ran Ben-Basat G. Even Ken-ichi Kawarabayashi Gregory Schwartzman 48 4 0 04 Apr 2018
Improved Distributed $Δ$ -Coloring M. Ghaffari J. Hirvonen Fabian Kuhn Yannic Maus 52 39 0 08 Mar 2018
Local Distributed Algorithms in Highly Dynamic Networks P. Bamberger Fabian Kuhn Yannic Maus 82 14 0 27 Feb 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 98 132 0 22 Feb 2018
$MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds$ MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds C. Konrad 43 8 0 21 Feb 2018
Distributed Algorithms Made Secure: A Graph Theoretic Approach M. Parter E. Yogev FedML 67 16 0 04 Dec 2017
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 74 70 0 01 Dec 2017
Deterministic Distributed Edge-Coloring with Fewer Colors M. Ghaffari Fabian Kuhn Yannic Maus Jara Uitto 47 54 0 15 Nov 2017
On Derandomizing Local Distributed Algorithms M. Ghaffari David G. Harris Fabian Kuhn OOD FedML 75 137 0 06 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 132 50 0 14 Aug 2017
Distributed Approximation of Maximum Independent Set and Maximum Matching R. Bar-Yehuda K. Censor-Hillel M. Ghaffari Gregory Schwartzman 54 51 0 01 Aug 2017