Shay Kutten
Singularly Near Optimal Leader Election in Asynchronous Networks
Kutten, Shay; Moses Jr., William K.; Pandurangan, Gopal; Peleg, David
Authors
Contributors
Seth Gilbert
Editor
Citation
Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2021). Singularly Near Optimal Leader Election in Asynchronous Networks. In S. Gilbert (Ed.), . https://doi.org/10.4230/lipics.disc.2021.27
Conference Name | 35th International Symposium on Distributed Computing (DISC 2021) |
---|---|
Publication Date | 2021 |
Deposit Date | Dec 6, 2022 |
Pages | 27:1-27:18 |
Series Title | Leibniz International Proceedings in Informatics (LIPIcs) |
DOI | https://doi.org/10.4230/lipics.disc.2021.27 |
Public URL | https://durham-repository.worktribe.com/output/1134865 |
Publisher URL | https://drops.dagstuhl.de/opus/volltexte/2021/14829/ |
Related Public URLs | https://arxiv.org/abs/2108.02197 |
You might also like
Awake Complexity of Distributed Minimum Spanning Tree
(2024)
Conference Proceeding
Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd
(2024)
Conference Proceeding
Time- and Communication-Efficient Overlay Network Construction via Gossip
(2023)
Conference Proceeding
Efficient live exploration of a dynamic ring with mobile robots
(2023)
Journal Article
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search