George Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In Thomas Schwentick, Christoph Dürr, editors, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. Volume 9 of LIPIcs, pages 57-68, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. [doi]
@inproceedings{Giakkoupis11,
title = {Tight bounds for rumor spreading in graphs of a given conductance},
author = {George Giakkoupis},
year = {2011},
doi = {10.4230/LIPIcs.STACS.2011.57},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.57},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Giakkoupis11},
cites = {0},
citedby = {0},
pages = {57-68},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany},
editor = {Thomas Schwentick and Christoph Dürr},
volume = {9},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-25-5},
}