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

12 June 2020

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

6 / 6 papers shown

Title
Low-Distortion Clustering in Bounded Growth Graphs Yi-Jun Chang Varsha Dani Thomas P. Hayes 23 0 0 08 May 2024
Distributed MIS with Low Energy and Time Complexities M. Ghaffari Julian Portmann 13 8 0 19 May 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 14 13 0 10 May 2023
Energy-Efficient Distributed Algorithms for Synchronous Networks Pierre Fraigniaud Pedro Montealegre I. Rapaport Ioan Todinca 14 3 0 27 Jan 2023
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks Varsha Dani Thomas P. Hayes 14 7 0 25 May 2022
Beeping a Maximal Independent Set Y. Afek N. Alon Z. Bar-Joseph Alejandro Cornejo Bernhard Haeupler Fabian Kuhn 71 114 0 01 Jun 2012