Shay Kutten
Sublinear bounds for randomized leader election
Kutten, Shay; Pandurangan, Gopal; Peleg, David; Robinson, Peter; Trehan, Amitabh
Authors
Gopal Pandurangan
David Peleg
Peter Robinson
Dr Amitabh Trehan amitabh.trehan@durham.ac.uk
Associate Professor
Citation
Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2015). Sublinear bounds for randomized leader election. Theoretical Computer Science, 561, 134 - 143. https://doi.org/10.1016/j.tcs.2014.02.009
| Journal Article Type | Article |
|---|---|
| Publication Date | 2015 |
| Deposit Date | Oct 5, 2020 |
| Journal | Theoretical Computer Science |
| Print ISSN | 0304-3975 |
| Publisher | Elsevier |
| Peer Reviewed | Peer Reviewed |
| Volume | 561 |
| Pages | 134 - 143 |
| DOI | https://doi.org/10.1016/j.tcs.2014.02.009 |
| Public URL | https://durham-repository.worktribe.com/output/1261133 |
You might also like
Termination of amnesiac flooding
(2023)
Journal Article
Compact routing messages in self-healing trees
(2018)
Journal Article
DEX: self-healing expanders
(2016)
Journal Article
On the Complexity of Universal Leader Election
(2015)
Journal Article
Xheal: a localized self-healing algorithm using expanders
(2014)
Journal Article
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 © 2025
Advanced Search