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.
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: We are 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.
Finally: Some beautiful math
(use scroll wheel or buttons to zoom
or
click here for more information)