Computer Laboratory

Thomas Sauerwald

University Lecturer at the Computer Laboratory (since July 2013).

Contact Details


Dr Thomas Sauerwald
University of Cambridge
Computer Laboratory
15 JJ Thomson Avenue
Cambridge CB3 0FD
United Kingdom

Email: firstname.lastname at cl.cam.ac.uk
Phone: +44 1223 763538
Fax: +44 1223 334678

Research Interests


  • Randomized algorithms
  • Markov chains and random walks
  • Distributed computing
  • Graph Theory
  • Game Theory

Selected Publications


For the complete list of my publications, please see my DBLP entry.

  • Randomized Rumor Spreading in Dynamic Graphs (with George Giakkoupis and Alexandre Stauffer)
    In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), 2014 (to appear).
  • HIT'nDRIVE: Multi-Driver Gene Prioritization based on Hitting Time (with Raunak Shrestha, Ermin Hodzic, Jake Yeung, Kendric Wang, Phuong Dao, Shawn Anderson, Himisha Beltran, Mark A. Rubin, Colin C. Collins, Gholamreza Haffari and S. Chenk Sahinalp)
    In Proceedings of the 18th Annual International Conference on Research in Computational Molecular Biology (RECOMB), pages 293-306, 2014.  
  • Randomized Diffusion for Indivisible Loads (with Petra Berenbrink, Colin Cooper, Tom Friedetzky and Tobias Friedrich)
    Journal of Computer and System Sciences, to appear. Preliminary version appeared in SODA'11, pages 429-439.  
  • Distributed Selfish Load Balancing on Networks (with Petra Berenbrink and Martin Hoefer)
    ACM Transactions on Algorithms, to appear. Preliminary version appeared in SODA'11, pages 1487-1497.  
  • Quasirandom Rumor Spreading (with Benjamin Doerr and Tobias Friedrich)
    ACM Transactions on Algorithms, to appear. Preliminary versions appeared in SODA'08, pages 773-781 and ICALP'09, pages 366-377.
  • Balls into Bins via Local Search (with Paul Bogdan, Alexandre Stauffer and He Sun)
    In Proceedings of the 24th ACM Symposium on Discrete Algorithms (SODA), pages 16-34, 2013. Full version available on Arxiv.  
  • Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies (with He Sun)
    In Proceedings of the 53rd IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 341-350, 2012. Full version available on Arxiv.  
  • Quasirandom Load Balancing (with Tobias Friedrich and Martin Gairing)
    SIAM Journal on Computing, 41(4):747-771, 2012. Preliminary version appeared in SODA'10, pages 1620-1629.  
  • Counting Arbitrary Subgraphs in Data Streams (with Daniel M. Kane, Kurt Mehlhorn and He Sun)
    In Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP), pages 598-609, 2012.
  • Rumor Spreading and Vertex Expansion (with George Giakkoupis)
    In Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1623-1641, 2012.
  • Ultra-Fast Rumor Spreading in Social Networks (with Nikolas Fountoulakis and Konstantinos Panagiotou)
    In Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1642-1661, 2012.
  • Tight Bounds for the Cover Time of Multiple Random Walks (with Robert Elsässer)
    Theoretical Computer Science, 412(24): 2623-2641, 2011. Preliminary version appeared in ICALP'09, pages 415-426.  
  • On Mixing and Edge Expansion Properties in Randomized Broadcasting
    Algorithmica, 56(1):51-88, 2010. Preliminary version appeared in ISAAC'07, pages 196-207.
  • Expansion and the Cover Time of Parallel Random Walks
    In Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pages 315-324, 2010.  
  • Speeding Up Random Walks with Neighborhood Exploration (with Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik)
    In Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1422-1435, 2010.  
  • The Impact of Randomization in Smoothing Networks (with Marios Mavronicolas)
    Distributed Computing, 22(5-6), pages 381-411, 2010. Preliminary version appeared in PODC'08, pages 345-354.    
  • Near-Perfect Load Balancing by Randomized Rounding (with Tobias Friedrich)
    In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pages 121-130, 2009.  

Program Committees


SODA 2015, DISC 2014, STACS 2013, SPAA 2012, SIROCCO 2012, SIROCCO 2010

Open Positions


Research Associate (postdoc), start date: 1 September or 1 October 2014 (More Details)

Teaching


  • Michaelmas term 2014/15: Part II course "Advanced Algorithms"
  • Lent term 2013/14: Part I course "Algorithms"