Thomas P. Hayes
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Hayes, Thomas P.; Saia, Jared; Trehan, Amitabh
Citation
Hayes, T. P., Saia, J., & Trehan, A. (2009, December). The forgiving graph: a distributed data structure for low stretch under adversarial attack. Presented at PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing, New York, NY, USA
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing |
| Publication Date | 2009 |
| Deposit Date | Oct 5, 2020 |
| Pages | 121-130 |
| Public URL | https://durham-repository.worktribe.com/output/1141591 |
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
Sublinear bounds for randomized leader election
(2015)
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