ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2007.09816
  4. Cited By
The Energy Complexity of BFS in Radio Networks

The Energy Complexity of BFS in Radio Networks

19 July 2020
Yi-Jun Chang
Varsha Dani
Thomas P. Hayes
Seth Pettie
ArXiv (abs)PDFHTML

Papers citing "The Energy Complexity of BFS in Radio Networks"

12 / 12 papers shown
Title
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic
  Energy Cost
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
Alkida Balliu
Pierre Fraigniaud
Dennis Olivetti
Mikael Rabie
63
0
0
27 Oct 2024
A Near-Optimal Low-Energy Deterministic Distributed SSSP with
  Ramifications on Congestion and APSP
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
M. Ghaffari
Anton Trygub
61
4
0
23 Sep 2024
Low-Distortion Clustering in Bounded Growth Graphs
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
Distributed MIS with Low Energy and Time Complexities
M. Ghaffari
Julian Portmann
46
10
0
19 May 2023
The Complexity of Distributed Approximation of Packing and Covering
  Integer Linear Programs
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
Yi-Jun Chang
Zeyong Li
72
6
0
02 May 2023
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
Fabien Dufoulon
S. Kutten
W. Moses
Gopal Pandurangan
David Peleg
68
5
0
03 Oct 2022
Node and Edge Averaged Complexities of Local Graph Problems
Node and Edge Averaged Complexities of Local Graph Problems
Alkida Balliu
M. Ghaffari
Fabian Kuhn
Dennis Olivetti
60
7
0
17 Aug 2022
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy
  Conservation in Radio Networks
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
Awake Complexity of Distributed Minimum Spanning Tree
Awake Complexity of Distributed Minimum Spanning Tree
John E. Augustine
W. Moses
Gopal Pandurangan
52
4
0
18 Apr 2022
Distributed MIS in $O(\log\log{n} )$ Awake Complexity
Distributed MIS in O(log⁡log⁡n)O(\log\log{n} )O(loglogn) Awake Complexity
Fabien Dufoulon
W. Moses
Gopal Pandurangan
62
12
0
18 Apr 2022
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching
  in Radio Networks
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
The Energy Complexity of Diameter and Minimum Cut Computation in
  Bounded-Genus Networks
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
Yi-Jun Chang
66
3
0
10 May 2018
1