Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake
Complexity

Sleeping is Efficient: MIS in $O(1)$ -rounds Node-averaged Awake Complexity

12 June 2020

Soumyottam Chatterjee

Gopal Pandurangan

ArXiv (abs)PDF HTML

Papers citing "Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake Complexity"

17 / 17 papers shown

Title
Low-Distortion Clustering in Bounded Growth Graphs Yi-Jun Chang Varsha Dani Thomas P. Hayes 54 0 0 08 May 2024
Distributed MIS with Low Energy and Time Complexities M. Ghaffari Julian Portmann 44 10 0 19 May 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 48 13 0 10 May 2023
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient Zheqi Shen Zijin Wan Yan Gu Yihan Sun 62 12 0 25 May 2022
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks Varsha Dani Thomas P. Hayes 51 7 0 25 May 2022
Deterministic Logarithmic Completeness in the Distributed Sleeping Model Leonid Barenboim Tzalik Maimon 25 21 0 04 Aug 2021
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks Varsha Dani Aayush Gupta Thomas P. Hayes Seth Pettie 36 14 0 19 Apr 2021
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization Václav Rozhon M. Ghaffari OOD 60 196 0 25 Jul 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 55 98 0 08 Jan 2019
Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity Leonid Barenboim Y. Tzur 37 12 0 24 May 2018
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 107 24 0 22 May 2017
How Long It Takes for an Ordinary Node with an Ordinary ID to Output? Laurent Feuilloley 49 14 0 19 Apr 2017
Optimal Dynamic Distributed MIS K. Censor-Hillel Elad Haramaty Zohar Karnin 63 54 0 15 Jul 2015
Beeping a Maximal Independent Set Y. Afek N. Alon Z. Bar-Joseph Alejandro Cornejo Bernhard Haeupler Fabian Kuhn 111 116 0 01 Jun 2012
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average G. Blelloch Jeremy T. Fineman Julian Shun 92 130 0 15 Feb 2012
The Locality of Distributed Symmetry Breaking Leonid Barenboim Michael Elkin Seth Pettie Johannes Schneider 112 298 0 09 Feb 2012
Local Computation: Lower and Upper Bounds Fabian Kuhn Thomas Moscibroda Roger Wattenhofer 100 100 0 24 Nov 2010