Thomas Sauerwald
Thomas Sauerwald
University Lecturer in Computer Science, University of Cambridge
Verified email at cl.cam.ac.uk - Homepage
Title
Cited by
Cited by
Year
Quasirandom rumor spreading
B Doerr, T Friedrich, T Sauerwald
arXiv preprint arXiv:1012.5351, 2010
992010
Ultra-fast rumor spreading in social networks
N Fountoulakis, K Panagiotou, T Sauerwald
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
902012
Stabilizing consensus with the power of two choices
B Doerr, LA Goldberg, L Minder, T Sauerwald, C Scheideler
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
902011
Quasirandom rumor spreading: Expanders, push vs. pull, and robustness
B Doerr, T Friedrich, T Sauerwald
International Colloquium on Automata, Languages, and Programming, 366-377, 2009
782009
Tight bounds for the cover time of multiple random walks
R Elsässer, T Sauerwald
Theoretical Computer Science 412 (24), 2623-2641, 2011
682011
A new diffusion-based multilevel algorithm for computing graph partitions
H Meyerhenke, B Monien, T Sauerwald
Journal of Parallel and Distributed Computing 69 (9), 750-761, 2009
682009
Counting arbitrary subgraphs in data streams
DM Kane, K Mehlhorn, T Sauerwald, H Sun
International Colloquium on Automata, Languages, and Programming, 598-609, 2012
662012
Rumor spreading and vertex expansion
G Giakkoupis, T Sauerwald
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
562012
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality
H Meyerhenke, B Monien, T Sauerwald
2008 IEEE International Symposium on Parallel and Distributed Processing, 1-13, 2008
542008
Quasirandom load balancing
T Friedrich, M Gairing, T Sauerwald
SIAM Journal on Computing 41 (4), 747-771, 2012
512012
On the runtime and robustness of randomized broadcasting
R Elsässer, T Sauerwald
Theoretical Computer Science 410 (36), 3414-3427, 2009
502009
Broadcasting vs. mixing and information dissemination on Cayley graphs
R Elsässer, T Sauerwald
Annual Symposium on Theoretical Aspects of Computer Science, 163-174, 2007
482007
Tight bounds for randomized load balancing on arbitrary network topologies
T Sauerwald, H Sun
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 341-350, 2012
472012
Rumor spreading and vertex expansion on regular graphs
T Sauerwald, A Stauffer
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
472011
The power of memory in randomized broadcasting
R Elsässer, T Sauerwald
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
472008
The cover time of deterministic random walks
T Friedrich, T Sauerwald
International Computing and Combinatorics Conference, 130-139, 2010
422010
Near-perfect load balancing by randomized rounding
T Friedrich, T Sauerwald
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
382009
Efficient broadcast on random geometric graphs
M Bradonjić, R Elsässer, T Friedrich, T Sauerwald, A Stauffer
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
372010
On mixing and edge expansion properties in randomized broadcasting
T Sauerwald
Algorithmica 56 (1), 51, 2010
352010
Speeding up random walks with neighborhood exploration
P Berenbrink, C Cooper, R Elsässer, T Radzik, T Sauerwald
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
342010
The system can't perform the operation now. Try again later.
Articles 1–20