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). The forgiving graph: a distributed data structure for low stretch under adversarial attack.
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
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
(2024)
Presentation / Conference Contribution
All You Need are Random Walks: Fast and Simple Distributed Conductance Testing
(2024)
Presentation / Conference Contribution
Intrusion Detection in Critical SD-IoT Ecosystem
(2023)
Presentation / Conference Contribution
Termination of amnesiac flooding
(2023)
Journal Article
Payment scheduling in the Interval Debt Model
(2023)
Presentation / Conference Contribution
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