Homepage
- (Randomized) Query complexities
- Randomized and quasi-randomized algorithms
- Geometric discrepancies
- Theory of randomized search heuristics
For the complete list of publications, submitted work, and preprints look here.
A list of my talks can be found here
3 Most Recent Journal Articles:
3 Most Recent Conference Articles:
- [WG 2013]
Carola Doerr,
Jens M. Schmidt, and
G. Ramakrishna,
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time.
In: Proc. of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013), to appear.
arXiv version.
- [GECCO 2013]
Carola Doerr and
François-Michel De Rainville.
Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), to appear.
arXiv version.
- [GECCO 2013]
Benjamin Doerr,
Carola Doerr, and
Franziska Ebel.
Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), to appear.
New Preprints:
- [Preprint 2013]
Andrea Clementi,
Pierluigi Crescenzi,
Carola Doerr,
Pierre Fraigniaud,
Marco Isopi,
Alessandro Panconesi,
Francesco Pasquale, and
Riccardo Silvestri,
Rumor Spreading in Random Evolving Graphs.
arXiv version.
We analyze the random PUSH rumor spreading protocol on edge-Markovian evolving graphs.
- [Preprint 2012]
Benjamin Doerr,
Carola Doerr,
Shay Moran, and
Shlomo Moran.
Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity.
arXiv version.
We introduce a simple randomized broadcasting protocol for distributing messages in a complete network topology.
- [Preprint 2012]
Peyman Afshani,
Manindra Agrawal,
Benjamin Doerr,
Carola Doerr,
Kasper Green Larsen, and
Kurt Mehlhorn
The Query Complexity of Finding a Hidden Permutation.
ECCC version.
We regard the query complexity of finding a hidden permutation through queries that reveal only very limited information about it. We provide tight bounds, both for the deterministic and the randomized query complexity.
Courses:
- Summer Semester 2012:
Co-organizer of the lecture Basic Mathematical Techniques for Computer Scientists,
together with
Timo Kötzing,
Xavier Pèrez-Gimènez,
Chandan Saha,
Thomas Sauerwald,
Reto Spöhel, and
Jens Schmidt
- Summer Semester 2012:
Co-organizer of the seminar Reading Group in Algorithms,
together with Kurt Mehlhorn.
- Winter Semester 2011/12:
Co-organizer of the seminar Reading Group in Algorithms,
together with Kurt Mehlhorn.
- Summer Semester 2011:
Co-organizer of the seminar Reading Group in Algorithms,
together with Kurt Mehlhorn.
- Summer Semester 2010:
Teaching assistant for Algorithms and Randomization
held by Chinmoy Dutta, Nikolaos Fountoulakis, and Anna Huber.
- Winter Semester 2004 - Winter Semester 2006:
Teaching assistant for various courses held by the department for mathematics at Kiel University
Students:
- Co-Advisor of the master student Franziska Ebel.
- Co-Advisor of the master student Vijay Ingalalli.
Title of the thesis: Evolutionary Algorithms to Compute Lower Bounds for the Star Discrepancy
- Co-Advisor of the intern Jong-Hyun Lee.
Title of the project: Playing Mastermind with Constant Size Memory
- Since October 2012:
Postdoctoral researcher at LIAFA in Paris.
My stay is supported by a Feodor Lynen Research Fellowship for Postdoctoral Researchers (Humboldt foundation).
I am also supported by the Robert Bosch Foundation, via their Fast Track program.
- Since January 2012:
Postdoctoral researcher at the Max-Planck-Institut für Informatik
- January 2010 - December 2011:
Ph. D. student in Computer Science at the Universität des Saarlandes, Saarbrücken, Germany and the Max-Planck-Institut für Informatik
My Ph. D. studies were supported by the Google Europe Fellowship in Randomized Algorithms (click here for program details)
Advisor of my thesis is Benjamin Doerr and the supervisor is Kurt Mehlhorn
- December 2007 - January 2012:
Consultant with McKinsey&Company, Inc., Munich. From December 2009 until January 2012, I was on educational leave.
- August 2007:
Diploma in Mathematics at the Christian-Albrechts-Universität (CAU) Kiel
Title of my diploma thesis: Approximative Berechnung der Sterndiskrepanz (advisor: Dr. Michael Gnewuch, supervisor: Prof. Dr. Anand Srivastav)
- July 2006 - October 2006:
Internship with Deutsche Lufthansa AG
- October 2003 - August 2007:
Studies of Mathematics (major subject), Business Administration (minor subject, Studienkolleg), Economics (Vordiplom, for fun), and Computer Science (for fun)
at the CAU Kiel
My studies were supported by a stipend of the Klaus Murmann Fellowship Programme of the Foundation of German Business/ Studienförderwerk Klaus Murmann der Stiftung der Deutschen Wirtschaft (SDW)
- July 2003:
Abitur at the Heinrich-Suso-Gymnasium, Konstanz
- August 2000 - July 2001:
AFS high school exchange student in Tobati, Paraguay.
