v1v2v3 (latest)

The Locality of Distributed Symmetry Breaking

9 February 2012

Papers citing "The Locality of Distributed Symmetry Breaking"

26 / 126 papers shown

Title
Dynamic Networks of Finite State Machines Y. Emek Jara Uitto 55 12 0 12 Jun 2017
Deterministic subgraph detection in broadcast CONGEST Janne H. Korhonen Joel Rybicki 73 52 0 29 May 2017
Triangle Finding and Listing in CONGEST Networks Taisuke Izumi F. Gall 62 56 0 25 May 2017
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Talal Riaz Peter Robinson 110 24 0 22 May 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 75 55 0 16 May 2017
Beeping a Maximal Independent Set Fast S. Holzer Nancy A. Lynch 29 13 0 24 Apr 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 61 102 0 20 Apr 2017
Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity Leonid Barenboim Michael Elkin Tzalik Maimon 53 17 0 21 Oct 2016
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions K. Censor-Hillel M. Parter Gregory Schwartzman 82 75 0 04 Aug 2016
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model Dan Hefetz Fabian Kuhn Yannic Maus Angelika Steger 49 19 0 18 Jul 2016
Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis Arnaud Casteigts Yves Métivier J. Robson A. Zemmari 64 6 0 11 Jul 2016
Using Read- $k$ Inequalities to Analyze a Distributed MIS Algorithm Sriram V. Pemmaraju Talal Riaz 19 2 0 20 May 2016
Distributed $(Δ+1)$ -Coloring in Sublogarithmic Rounds David G. Harris Johannes Schneider Hsin-Hao Su OOD 72 11 0 04 Mar 2016
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model Yi-Jun Chang T. Kopelowitz Seth Pettie 107 166 0 26 Feb 2016
$A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds$ A Distributed $(2+ε)$ -Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds R. Bar-Yehuda K. Censor-Hillel Gregory Schwartzman 61 5 0 11 Feb 2016
Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring P. Jeavons A. Scott Lei Xu 37 18 0 17 Jan 2016
Local Conflict Coloring Pierre Fraigniaud Marc Heinrich A. Kosowski 57 136 0 04 Nov 2015
A Lower Bound for the Distributed Lovász Local Lemma S. Brandt Orr Fischer J. Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto 62 133 0 03 Nov 2015
Computing in Additive Networks with Bounded-Information Codes K. Censor-Hillel Erez Kantor Nancy A. Lynch M. Parter 40 2 0 14 Aug 2015
Optimal Dynamic Distributed MIS K. Censor-Hillel Elad Haramaty Zohar Karnin 77 54 0 15 Jul 2015
On Distributed Computing with Beeps Yves Métivier J. Robson A. Zemmari 63 10 0 09 Jul 2015
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation Leonid Barenboim Michael Elkin C. Gavoille 48 9 0 21 May 2015
Simple Distributed Delta + 1 Coloring in the SINR Model Fabian Fuchs Roman Prutkin 30 9 0 09 Feb 2015
Lessons from the Congested Clique Applied to MapReduce James Hegeman Sriram V. Pemmaraju 84 86 0 17 May 2014
Linear-in- $Δ$ Lower Bounds in the LOCAL Model Mika Göös J. Hirvonen Jukka Suomela FedML 111 16 0 03 Apr 2013
Super-Fast 3-Ruling Sets Kishore Kothapalli Sriram V. Pemmaraju 85 32 0 12 Jul 2012