English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Simple and Optimal Fault-tolerant Rumor Spreading

MPS-Authors
/persons/resource/persons44338

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45750

Doerr,  Carola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons118057

Moran,  Shay
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons79394

Moran,  Shlomo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., Doerr, C., Moran, S., & Moran, S. (2016). Simple and Optimal Fault-tolerant Rumor Spreading. Distributed Computing, 29(2), 89-104. doi:10.1007/s00446-014-0238-z.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-5456-8
Abstract
There is no abstract available