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]
Abstract is missing.