v1v2 (latest)

Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks

Distributed computing (Distrib. Comput.), 2021

19 April 2021

ArXiv (abs)PDF HTML Github

Papers citing "Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks"

6 / 6 papers shown

Low-Distortion Clustering in Bounded Growth GraphsColloquium on Structural Information & Communication Complexity (CSICC), 2024

Yi-Jun Chang

Varsha Dani

Thomas P. Hayes

230

08 May 2024

A Survey of Distributed Graph Algorithms on Massive Graphs

Jingren Zhou

286

09 Apr 2024

How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio NetworksInternational Symposium on Distributed Computing (DISC), 2022

Varsha Dani

Thomas P. Hayes

188

25 May 2022

Awake Complexity of Distributed Minimum Spanning TreeColloquium on Structural Information & Communication Complexity (SIROCCO), 2022

John E. Augustine

W. Moses

Gopal Pandurangan

297

18 Apr 2022

$Distributed MIS in $O(\log\log{n} )$ Awake Complexity$

Distributed MIS in

O(\log\log{n} )

Awake ComplexityACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022

Fabien Dufoulon

W. Moses

Gopal Pandurangan

380

18 Apr 2022

The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks

Yi-Jun Chang

315

10 May 2018