Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2305.06120
Cited By
Average Awake Complexity of MIS and Matching
10 May 2023
M. Ghaffari
Julian Portmann
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Average Awake Complexity of MIS and Matching"
9 / 9 papers shown
Title
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
Alkida Balliu
Pierre Fraigniaud
Dennis Olivetti
Mikael Rabie
32
0
0
27 Oct 2024
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
M. Ghaffari
Anton Trygub
28
2
0
23 Sep 2024
Distributed Coloring in the SLEEPING Model
Fabien Dufoulon
Pierre Fraigniaud
Mikael Rabie
Hening Zheng
32
1
0
16 May 2024
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
21
8
0
19 May 2023
Energy-Efficient Distributed Algorithms for Synchronous Networks
Pierre Fraigniaud
Pedro Montealegre
I. Rapaport
Ioan Todinca
22
3
0
27 Jan 2023
Awake Complexity of Distributed Minimum Spanning Tree
John E. Augustine
W. Moses
Gopal Pandurangan
28
4
0
18 Apr 2022
Distributed MIS in
O
(
log
log
n
)
O(\log\log{n} )
O
(
lo
g
lo
g
n
)
Awake Complexity
Fabien Dufoulon
W. Moses
Gopal Pandurangan
21
9
0
18 Apr 2022
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
Yi-Jun Chang
21
3
0
10 May 2018
1