Thomas Sauerwald

Cited by

	All	Since 2016
Citations	1817	856
h-index	27	17
i10-index	46	30

200

100

150

20072008200920102011201220132014201520162017201820192020202111 23 68 109 125 141 149 157 152 170 187 190 159 138 12

Co-authors

Robert ElsässerUniversity of SalzburgVerified email at cosy.sbg.ac.at
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
Benjamin DoerrProfessor at Ecole Polytechnique, France; senior researcher at Max Planck Institute for InformaticsVerified email at mpi-inf.mpg.de
He SunThe University of EdinburghVerified email at ed.ac.uk
Henning MeyerhenkeProfessor of Computer Science, HU BerlinVerified email at hu-berlin.de
George GiakkoupisResearcher, INRIA Rennes, FranceVerified email at inria.fr
Konstantinos PanagiotouUniversity of MunichVerified email at math.lmu.de
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Christian ScheidelerProfessor, Universität PaderbornVerified email at upb.de
Martin HoeferProfessor of Computer Science, Goethe University Frankfurt/MainVerified email at cs.uni-frankfurt.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Cenk SahinalpSenior Investigator, Cancer Data Science Lab, National Cancer Institute, NIHVerified email at nih.gov
Raunak Shrestha, PhDUniversity of California, San Francisco (UCSF)Verified email at ucsf.edu
Kendric WangUniversity of British ColumbiaVerified email at alumni.ubc.ca
Gholamreza (Reza) HaffariAssociate Professor, Faculty of Information Technology, Monash UniversityVerified email at monash.edu
Kamyar KhodamoradiUniversität WürzburgVerified email at uni-wuerzburg.de
Daniel KaneUniversity of California, San DiegoVerified email at ucsd.edu
Dominik PająkWroclaw University of Science and TechnologyVerified email at pwr.edu.pl
Adrian KosowskiHead of Research at NavAlgoVerified email at navalgo.com
Hoda AkbariPhD student, Simon Fraser UniversityVerified email at sfu.ca

Thomas Sauerwald

University Lecturer in Computer Science, University of Cambridge

Verified email at cl.cam.ac.uk - Homepage

Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Quasirandom rumor spreading B Doerr, T Friedrich, T Sauerwald arXiv preprint arXiv:1012.5351, 2010	98	2010
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	91	2012
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	91	2011
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	81	2009
Counting arbitrary subgraphs in data streams DM Kane, K Mehlhorn, T Sauerwald, H Sun International Colloquium on Automata, Languages, and Programming, 598-609, 2012	72	2012
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	72	2009
Tight bounds for the cover time of multiple random walks R Elsässer, T Sauerwald Theoretical Computer Science 412 (24), 2623-2641, 2011	69	2011
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	59	2008
Rumor spreading and vertex expansion G Giakkoupis, T Sauerwald Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	56	2012
Quasirandom load balancing T Friedrich, M Gairing, T Sauerwald SIAM Journal on Computing 41 (4), 747-771, 2012	52	2012
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	49	2012
On the runtime and robustness of randomized broadcasting R Elsässer, T Sauerwald Theoretical Computer Science 410 (36), 3414-3427, 2009	49	2009
Rumor spreading and vertex expansion on regular graphs T Sauerwald, A Stauffer Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	47	2011
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	46	2007
The power of memory in randomized broadcasting R Elsässer, T Sauerwald Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008	45	2008
The cover time of deterministic random walks T Friedrich, T Sauerwald International Computing and Combinatorics Conference, 130-139, 2010	41	2010
Near-perfect load balancing by randomized rounding T Friedrich, T Sauerwald Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	39	2009
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	36	2010
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	35	2010
Diameter and broadcast time of random geometric graphs in arbitrary dimensions T Friedrich, T Sauerwald, A Stauffer Algorithmica 67 (1), 65-88, 2013	34	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors