ThRaSH'2010 Tutorial on Discrete Optimization


We are happy to announce that Benjamin Doerr from the Max-Planck-Institut für Informatik in Saarbrücken, Germany agreed to give an invited tutorial on randomized search heuristics for discrete domains entitled "Drift for Dummies: Elementary Analysis Methods for Randomized Search Heuristics". The tutorial will be held in the beginning of the workshop to enable all participants to understand the basic principles of the upcoming talks on discrete optimization.


Abstract

In this tutorial, I give a brief introduction into the theory of randomized search heuristics with an emphasis on methods that can be easily used in different setting. The talk will be fully comprehensible for first-timers, but contain a decent amount of new (still elementary) results to also entertain the regular attendees of the workshop series.


Benjamin Doerr

Biography of Benjamin Doerr

June 1990 Abitur (A-levels) at Max-Planck-Gymnasium in Kiel, Germany, followed by alternative military service
Oct. 1992–May 1998 studies of computer science at the Christian-Albrechts-Universität in Kiel, Germany; starting with winter semester 1995/96 mathematics as additional major
Oct. 1994 Vordiplom (Bachelor) in computer science (minor in mathematics and business studies)
May 1998 diploma in mathematics with a minor in computer science; thesis title: "Nichtauflösbare J(T)–Komponenten (Gruppentheorie)" supervisor: Prof. Stellmacher
May 1998–Dec. 2000 doctoral studies in mathematics under a scholarship from the Deutsche Forschungsgemeinschaft (DFG, "German Science Foundation") within the Graduiertenkolleg 357 "Effiziente Algorithmen und Mehrskalenmethoden"
20.12.2000 doctor of natural sciences (Dr. rer. nat.) with distinction (summa cum laude); dissertation titel: Multi-Color Discrepancies; referee: Prof. Srivastav; co-referees: Prof. Betten (Kiel) und Prof. Spencer (New York)
Jan. 2001–March 2005 Research Assistant (BAT IIa, from 2003 on C1) in the group "discrete optimization" of Prof. Srivastav;
associate member of the Graduiertenkollegs 357
15.3.–12.6.2004 Research stay at Prof. Spencer's group at the Courant Institute of Mathematical Sciences, New York City, NY, USA
1.2.–31.3.2005 Research stay at the Alfréd Rényi Institute of the Hungarian Academy of Science
since April 2005 Senior Researcher (W2) at the group "Algorithms and Complexity" of Prof. Mehlhorn at the Max-Planck-Institut für Informatik (MPI) in Saarbrücken, Germany
Coordinator of the research area "foundations and discrete mathematics"
30.11.2005 habilitation in mathematics at the Christian-Albrechts-Universität in Kiel, Germany
Dec. 2007 offers for professorships (W2) in discrete optimization (RWTH Aachen, Germany) and theoretical computer science (TU Dortmund, Germany); both declined as soon as MPI offered a permanent position
Nov. 2009 appointed honorary professor for computer science at Universität des Saarlandes in Saarbrücken, Germany