Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets

22 May 2017

Papers citing "Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets"

7 / 7 papers shown

Title
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 48 13 0 10 May 2023
Can We Break Symmetry with o(m) Communication? Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson LRM 70 9 0 19 May 2021
Sleeping is Efficient: MIS in $O(1)$ -rounds Node-averaged Awake Complexity Soumyottam Chatterjee R. Gmyr Gopal Pandurangan 59 34 0 12 Jun 2020
Distributed Lower Bounds for Ruling Sets Alkida Balliu S. Brandt Dennis Olivetti 47 41 0 17 Apr 2020
Distributed Reconfiguration of Maximal Independent Sets K. Censor-Hillel Mikael Rabie LRM 24 11 0 04 Oct 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 64 70 0 01 Dec 2017
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion Amir Abboud K. Censor-Hillel Seri Khoury Christoph Lenzen 83 29 0 05 Nov 2017