Faster Deterministic Distributed MIS and Approximate Matching
Main Authors: | Ghaffari, Mohsen, Grunau, Christoph |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing
2023
|
Online Access: | https://hdl.handle.net/1721.1/151045 |
Similar Items
-
Distributed MIS with Low Energy and Time Complexities
by: Ghaffari, Mohsen, et al.
Published: (2023) -
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
by: Ghaffari, Mohsen, et al.
Published: (2021) -
A Near-Optimal Deterministic Distributed Synchronizer
by: Ghaffari, Mohsen, et al.
Published: (2023) -
Faster deterministic and Las vegas algorithms for offline approximate nearest neighbors in high dimensions
by: Alman, Joshua, et al.
Published: (2021) -
Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time
by: Ghaffari, Mohsen, et al.
Published: (2024)