1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Distributed MIS with Low Energy and Time Complexities
Mohsen Ghaffari, Julian Portmann
We present randomized distributed algorithms for the maximal independent set problem (MIS) that, while keeping the time complexity nearly matching the best known, reduce the energy…
cs.DS2023★ 1 cited
Average Awake Complexity of MIS and Matching
Mohsen Ghaffari, Julian Portmann
Chatterjee, Gmyr, and Pandurangan [PODC 2020] recently introduced the notion of awake complexity for distributed algorithms, which measures the number of rounds in which a node is…