Coloring Fast with Broadcasts
Main Authors: | Flin, Maxime, Ghaffari, Mohsen, Halld?rsson, Magn?s, Kuhn, Fabian, Nolin, Alexandre |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
2023
|
Online Access: | https://hdl.handle.net/1721.1/150982 |
Similar Items
-
Fast Broadcast in Highly Connected Networks
by: Chandra, Shashwat, et al.
Published: (2024) -
Randomized broadcast in radio networks with collision detection
by: Ghaffari, Mohsen, et al.
Published: (2016) -
Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time
by: Ghaffari, Mohsen, et al.
Published: (2024) -
The cost of radio network broadcast for different models of unreliable links
by: Ghaffari, Mohsen, et al.
Published: (2014) -
Broadcasting in Unreliable Radio Networks
by: Oshman, Rotem, et al.
Published: (2010)