Distributed MIS with Low Energy and Time Complexities
Abstract
References
Index Terms
- Distributed MIS with Low Energy and Time Complexities
Recommendations
Average Awake Complexity of MIS and Matching
SPAA '22: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and ArchitecturesChatterjee, 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 awake. In the other rounds, the node is sleeping and performs no ...
Distributed MIS in O(log log n) Awake Complexity
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed ComputingMaximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best known (randomized) MIS algorithms have O(log n) round complexity on general ...
Awake Complexity of Distributed Minimum Spanning Tree
Structural Information and Communication ComplexityAbstractThe awake complexity of a distributed algorithm measures the number of rounds in which a node is awake. When a node is not awake, it is sleeping and does not do any computation or communication and spends very little resources. Reducing the awake ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/3a17ec98-f34f-4520-b9f1-67deb1468cf7/3583668.cover.jpg)
- Chair:
- Rotem Oshman,
- Proceedings Editor:
- Alexandre Nolin,
- Program Chair:
- Magnus Mar Halldorsson,
- Workshop Chair:
- Alkida Balliu
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 117Total Downloads
- Downloads (Last 12 months)96
- Downloads (Last 6 weeks)3
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in