Quasi-random Rumor Spreading: Reducing Randomness Can be Costly

Doerr, Benjamin; Fouz, Mahmoud

doi:10.1016/j.ipl.2010.11.006

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Quasi-random Rumor Spreading: Reducing Randomness Can be Costly

MPS-Authors

/persons/resource/persons44338

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

/persons/resource/persons44440

Fouz, Mahmoud
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., & Fouz, M. (2011). Quasi-random Rumor Spreading: Reducing Randomness Can be Costly. Information Processing Letters, 111(5), 227-230. doi:10.1016/j.ipl.2010.11.006.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-128A-4

Abstract

There is no abstract available