Homepage

Tobias Friedrich

Saarland University
Cluster of Excellence MMCI
Campus E1.7
66123 Saarbrücken
Germany

and

Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1.4, Room 311a
66123 Saarbrücken
Germany

Email: t.friedrichmpi-inf.mpg.de
Phone: +49 681 9325 1055
Fax: +49 681 9325 1099

Research Interests

Probabilistic methods and quasirandomness (e.g. Propp machine)
Algorithm engineering (e.g. efficient algorithms for the hypervolume)
Discrete mathematics (e.g. matrix rounding)
Graph algorithms (e.g. average-case analysis of dynamic graph algorithms)
Bio-inspired computation (e.g. runtime analysis of evolutionary algorithms)

Selected Publications (For the complete list of publications look here)

Why Rumors Spread Fast in Social Networks (with B. Doerr and M. Fouz)
Communications of the ACM, June 2012.
Fast Simulation of Large-Scale Growth Models (with L. Levine)
International Workshop on Randomization and Computation (RANDOM 2011), pages 555-566, 2011
Social Networks Spread Rumors in Sublogarithmic Time (with B. Doerr and M. Fouz)
ACM Symposium on Theory of Computing (STOC 2011), pages 21-30, 2011.
Randomized Diffusion for Indivisible Loads (with P. Berenbrink, C. Cooper, T. Friedetzky, and T. Sauerwald)
ACM-SIAM Symposium on Discrete Algorithms (SODA 2011). pages 429-439, 2011.
Quasirandom Load Balancing (with M. Gairing and T. Sauerwald)
ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). pages 1620-1629, 2010.
Efficient Broadcast on Random Geometric Graphs (with M. Bradonjić, R. Elsässer, T. Sauerwald, and A. Stauffer)
ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). pages 1412-1421, 2010.
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness (with B. Doerr and T. Sauerwald)
International Colloquium on Automata, Languages and Programming (ICALP 2009), pages 366-377, 2009.
Smoothed Analysis of Balancing Networks (with T. Sauerwald and D. Vilenchik)
International Colloquium on Automata, Languages and Programming (ICALP 2009), pages 472-483, 2009.
Near-Perfect Load Balancing by Randomized Rounding (with T. Sauerwald)
ACM Symposium on Theory of Computing (STOC 2009), pages 121-130, 2009.
Quasirandom Rumor Spreading (with B. Doerr and T. Sauerwald)
ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pages 773-781, 2008.
Deterministic Random Walks on Regular Trees (with B. Doerr, J. Cooper, and J. Spencer)
ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pages 766-772, 2008.

Recent Teaching

Winter semester 2011/12: Multi-Core Programming Lab on Swarm Algorithms
Summer semester 2011: Theoretical Foundations of Swarm Intelligence
Winter semester 2010/11: Randomized Algorithms
Winter semester 2009/10: Algorithms and Data Structures
Summer semester 2008: Bio-inspired Computation

Short Curriculum Vitæ

Independent research group leader (W2) at the Cluster of Excellence MMCI, Saarbrücken, Germany (since 2011)
Senior researcher and coordinator of the Bio-Inspired Computation Group at the Max-Planck-Institut für Informatik, Saarbrücken, Germany (since 2011)
Research associate at the Max-Planck-Institut für Informatik, Saarbrücken, Germany (2009-11)
Postdoc at the International Computer Science Institute, Berkeley, USA (2008-09)
Ph. D. (Dr. rer. nat.) in Computer Science, Max-Planck-Institut für Informatik, Saarbrücken, Germany (2007)
Master's degree (Dipl.-Math.) in Mathematics, Friedrich-Schiller-Universität Jena, Germany (2005)
Master's degree (M. Sc.) in Computer Science, The University of Sheffield, UK (2003)

Academic Activities and Miscellaneous

Currently in the program committee of GECCO 2012, PPSN 2012, RANDOM 2012, FOGA 2013
Co-Chair of the Theory Track at GECCO 2012 (with Jonathan E. Rowe)
Coordinator of the Indo-German Max-Planck Center for Computer Science (IMPECS)
Project “Theoretical Foundations of Swarm Intelligence” funded by German Research Foundation (DFG) (with Carsten Witt)
Project “Optimizing the Turbine Siting of Large Wind Farms” funded by Future SOC Lab of the Hasso-Plattner-Institut
Tutorial speaker at GECCO 2010, PPSN 2010, GECCO 2011 (with Frank Neumann), and ThRaSH 2012
Co-Organizer of the 29th Colloquium on Combinatorics (with Benjamin Doerr and many others)
Selected artist at the 2011 Joint Mathematics Meetings Exhibition of Mathematical Art in New Orleans
My group responsibility: Travel committee. Here (internal) links to the travel guide and the general rules.
ACM ICPC programming contest: More infos here. (in German)
My Erdős Number is two (path: Paul Erdős - Joel Spencer - me).

Offers

Bachlor/Master: For challenging and exciting topics for bachelor and master theses, just send me an email or come by my office 311a in building E1.4.
Doctorate: Our group is constantly looking for excellent PhD students. The typical way of application is via our graduate school IMPRS. If you have a particular interest or you already know with whom you want to work with, you can also contact the respective group member or the coordinator of the research area you are interested in.
Postdoc: Our research group offers a number of postdoctoral fellowships (one or two years) starting every autumn. For more details see the here.

Homepage

Tobias Friedrich

Research Interests

Selected Publications (For the complete list of publications look here)

Recent Teaching

Short Curriculum Vitæ

Academic Activities and Miscellaneous

Offers

Finally: Some beautiful math (use scroll wheel or buttons to zoom or click here for more)