Benjamin Doerr: Talks

2009:: I stopped putting my slides here, because it was too much work. If you're interested in slides, please send me an email.
14.11.-15.11.2008, KolKom 2008, Magdeburg: t.b.a.
Conference
03.11.-07.11.2008, Random Grals 2008, Bertinoro: Quasi-Random Rumor Spreading
Conference
Slides: [ppt]
13.09.-17.09.2008, PPSN 2008, Dortmund: How Much Colony is a Single Ant?
Conference
11.08.-15.08.08, Fete of Combinatorics and Computer Science, Keszthely: Quasi-Random Rumor Spreading
Conference
Slides: [ppt] [pdf]
12.07.-16.07.08, Gecco 2008, Atlanta: Crossover Can Provably be Useful in Evolutionary Computation
Conference
Slides: [ppt] [pdf]
06.07.-11.07.08, MCQMC 08, Montreal: Component-by-Component Construction of Low-Discrepancy Point Sets of Small Size
Conference
Slides: [ppt] [pdf]
25.02.08, Sm@rt Seminar Series, Sapienza Universita, Rom, Italy: Introduction to Quasirandomness
Slides: [pps]
27.01.-01.02.08, Seminar "Theory of Evolutionary Algorithms", Dagstuhl: Crossover can provably speed up evolutionary computation
Slides: [pdf]
25.09.-28.09.07, Congress on Evolutionary Computation (CEC 2007), Singapur: A Rigorous View on Neutrality
Slides: [ppt]
23.09.-28.09.07, Dagstuhl-Seminar No. 07391: "Probabilistic Methods in the Design and Analysis of Algorithms", Dagstuhl: Quasirandomness
26.06.-28.06.07, Schülervorträge im Rahmen der MPG-Jahresversammlung, Kiel: Mehr oder weniger zufällige Irrfahrten
11.09.-15.09.07, EuroComb 2007, Seville, Spain: Partial Colorings of Unimodular Hypergraphs
Slides: [ppt] Conference
14.07.-15.07.07, Workshop "Theory of Randomized Search Heuristics" colocated with the 34th International Colloquium on Automata, Languages and Programming (ICALP), Wroclaw, Poland: Crossover can provably speed up evolutionary computation
Slides: [pdf]
18.06.-22.06.07, Workshop "Discrepancy Theory and Related Areas", Varenna, Italy: News from the Propp machine
Slides: [pdf]
22.02.-24.02.07, 24th International Symposium on Theoretical Aspects of Computer Science (STACS), Aachen, Germany: Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
Slides: [ps] [pdf]
16.11.-18.11.06, Kolloquium Ã¼ber Kombinatorik, Magdeburg: Partial Coloring of Unimodular Hypergraphs
Slides: [pps]
30.10.-04.11.06, Oberwolfachseminar: Combinatorics, Probability and Computing: Deterministic Random Walks
Slides: [Slides] Conference
17.09.-23.09.06, Jahrestagung der Deutschen Mathematiker-Vereinigung 2006, Minisymposium "Random Discrete Structures and Algorithms", Bonn: Generating Randomized Roundings with Cardinality Constraints and Derandomizations
Slides: [pdf]
09.09.-13.09.06, PPSN - Parallel Problem Solving from Nature, Reykjavik, Iceland: Speeding Up Evolutionary Algorithms by Restricted Mutation Operators
Poster: [pdf (a poster, since PPSN is a poster-only conference)]
16.07.-22.07.06, EMS Summer School and Conference, Horizon of Combinatorics, Lake Balaton: Matrix (Quasi-)Rounding
Slides: [pdf ps]
10.07.-15.07.06, Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague: "Ulam's" Liar Game with Lies in an Interval
Slides: [pps]
05.06.-09.06.06, Cologne-Twente Workshop on Graphs and Combinatorial Optimization, PfalzAkademie Lambrecht: Controlled Randomized Rounding
Slides: [pps]
03.05.06, Minisymposium - Evolutionary Algorithms, Saarbrücken: Speeding up Evolutionary Algorithms by Restricted Mutation Operators
Slides: [pdf]
23.03.06, Statistics Seminar UW Madison, Madison, WI, U.S.A.: The Rotor-Router Modell
[Black board talk]
11.03.-16.03.06, BIRS Workshop on Coarsely Quantized Representations of Signals, Banff, Canada: Discrepancies and Halftoning
Slides [pdf] [ps] [ps.gz]
23.02.-25.02.06, 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), Marseille, France: Generating Randomized Roundings with Cardinality Constraints and Derandomizations
Slides [pdf] [ps] [ps.gz]
03.02.06, Kolloquium des Instituts für Informatik, Christian-Albrechts-Universität, Kiel: Das Rotor-Router Modell
Slides [pps] [pdf]
30.11.05, Probevorlesung, Christian-Albrechts-Universität, Kiel: Datenstromalgorithmen
[Black board talk]
14.09.05, Oberseminar Meyer auf der Heide, Heinz-Nixdorf-Institut, Paderborn: On the Propp Machine
[Black board talk]
05.-09.09.05, EuroComb 2005, Berlin: Simulating Random Walks on the Integers
``Slides'' [Black board talk]
08.08.05, Mittagsseminar Diskrete Optimierung, Kiel: Just-in-Time Scheduling and an Extension of Baranyai's Matrix Rounding Lemma
[Black board talk]
05.08.05, 12th International Conference on Random Structures and Algorithms, Poznan, Poland: On the Propp Machine
[Black board talk]
06.06.05, Seminar Algebra und Geometrie, Magdeburg: On the Propp Machine
[Black board talk]
03.06.05, Institutskolloquium Mathematisches Seminar der Universität zu Kiel: Kombinatorische Diskrepanzen
[Black board talk]
11.05.05, Mittagsseminar, MPI Saarbrücken: Discrepancy Theory
Slides
28.04.05, Erdős Magic for Algorithms and Games, Bertinoro (Forlì), Italy: On the Propp Machine
[Black board talk]
25.03.05, Rényi Intézet Sztochasztika Szeminárium, Budapest, Hungary: On Tusnády's Problem
[Black board talk]
07.03.-09.03.05, Workshop on Random Graphs and Probabilistic Methods, Berlin, Germany: Generating Random Graphs with Connectivity Information
Slides Conference
03.03.05, Rényi Intézet Kombinatorika Szeminárium, Budapest, Hungary: Matrix Rounding Problems
Slides
24.02.-26.02.05, 22nd International Symposium on Theoretical Aspects of Computer Science (STACS 2005), Stuttgart, Germany: Roundings Respecting Hard Constraints
Slides Conference
27.01.05, Algorithms-Seminar (A. Czumaj, W. Rytter), New Jersey Institute of Technology, USA: Generating Randomized Roundings with Constraints
22.01.-25.01.05, 16th Symposium on Discrete Algorithms (SODA), Vancouver, Canada: Matrix Rounding with Low Error in Small Submatrices
Slides Conference
12.11.-13.11.04, Kiel-Goeteborg Workshop on Probability and Combinatorics, Kiel: Combinatorial Discrepancies
Slides Conference
08.10.-11.10.04, Joint Indian-German Workshop on Algorithms and Complexity, Bangalore, India: Dependent Randomized Rounding
Slides Conference
30.09.-06.10.04, Research stay at the AMU Poznan, Poland: Dependent Randomized Rounding - Create and exploit dependencies!
Slides
27.09.04, MPI Saarbrücken: Dependent Randomized Rounding
Slides
29.08.-03.09.04, Dagstuhl-Workshop Nr. 04363 "Analysis of Combinatorial Algorithms and Concentration of Measure": Organizers: D. Dubhashi, A. Srivastav.
Dependent Randomized Rounding
Slides
28.04.04, Algorithms-Seminar (A. Czumaj, W. Rytter), New Jersey Institute of Technology, USA: Discrepancies and Declustering
Slides
19.03., 01.04.04, Working group seminar (J. Spencer), Courant Institute of Mathematical Sciences, New York City, USA: Dependent Randomized Rounding; The Linear Discrepancy of Two by Two Boxes is Less Than 3/2
07.03.-13.03.04, Oberwolfach-Seminar: Discrepancy Theory and Its Applications: Multi-Color Discrepancies
Slides Extended Abstract
10.01.-13.01.04, 15th Symposium on Discrete Algorithms (SODA), New Orleans, LA, USA: Matrix Rounding and Approximation
Slides Conference Extended Abstract
27.11.-01.12.03, Forschungsaufenthalt HNI Paderborn (AG Meyer auf der Heide): Discrepancies and Rounding Problems
Slides 1 Slides 2
14.09.-19.09.03, Jahrestagung der Deutschen Mathematiker-Vereinigung, Rostock: Matrix Rounding, Discrepancy and the Digital Halftoning Problem
Conference
08.09.-12.09.03, EUROCOMB 2003, Prague, Czech Republic: Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
Slides Abstract Conference
31.08.-05.09.2003, Dagstuhl Seminar 03361: Algorithmic Aspects of Large and Complex Networks.: Organizers: M. Adler (Amherst MA, US), F. Meyer auf der Heide (Univ. Paderborn, D), D. Wagner (Univ. Konstanz, D)
Non-independent Randomized Rounding
Seminar-Homepage
09.08.-13.08.2003, 11th International Conference on Random Structures and Algorithms, Poznan, Poland: Non-independent Randomized Rounding
Conference
31.01.-01.02.03, Gemeinsamer Workshop der Graduiertenkollegs ,,Effiziente Algorithmen und Mehrskalenmethoden'' (Uni Kiel) und ,,Algorithmische Mathematik'' (TU München), Kiel: Discrepancies and Image Processing
Slides Conference
28.01.03, Oberseminar Theoretische Informatik, MU Lübeck: Discrepancy Theory
Slides
12.01.-14.01.03, 14th Symposium on Discrete Algorithms (SODA), Baltimore, MD, USA: Non-independent Randomized Rounding
Slides Conference
03.10.-04.10.02, Diskrete Mathematik '02, Dresden: Multi-Colour Discrepancies (invited talk)
Slides Conference
16.09.-21.09.02, APPROX '02, Rome, Italy: Typical Rounding Problems
Slides Conference
16.09.-21.09.02, ESA '02, Rome, Italy: Non-independent Randomized Rounding and an Application to Digital Halftoning
Slides Conference
19.08.02, Bewerbungsvortrag C3-Stelle AG 1 (Mehlhorn), MPI Saarbrücken: Discrepancy Theory and Digital Halftoning
Slides
08.07.-13.07.02, ICALP '02, Malaga, Spain: Antirandomizing the Wrong Game
Slides Conference
27.05.02, Oberseminar Gruppe Monien, Paderborn: Discrepancy Theory and Digital Halftoning
Slides
14.03.-16.03.02, STACS '02, Antibes, France: Balanced Coloring: Equally Easy for all Numbers of Colors?
Slides Conference
27.02.-01.03.02, Mini Symposium on Theoretical Computer Science, ETH Zuerich, Switzerland: Discrepancy Theory
Slides Conference
17.02.-22.02.2002, Dagstuhl-Seminar No. 02081 on Algorithmic Combinatorial Game Theory: Organizers: E. Demaine, R. Fleischer, A. Fraenkel, R. Nowakowski
Tenure Games
Slides Seminar
12.09.-15.09.2001, EuroConference on Combinatorics, Graph Theory and Applications (COMB 2001), Barcelona, Spain: Vector Balancing Games with Aging
Abstract Slides Full Paper Conference
24.08.-25.08.2001, 1st International Workshop on Efficient Algorithms (WEA 2001), Riga, Latvia: Structured Randomized Rounding and Coloring
Abstract Slides Conference
05.08.-11.08.2001, 10th International Conference on Random Structures and Algorithms, Poznan, Poland: Discrepancies of Boxes
Slides Conference
06.06.-08.06.2001, 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Köln: Multicolor Discrepancies of Arithmetic Progressions
Abstract Slides Conference
15.02.-17.02.01, STACS '01, Dresden: Recursive Randomized Coloring Beats Fair Dice Random Colorings
Slides Conference
07.01.-09.01.01, 12th Symposium on Discrete Algorithms (SODA), Washington: Lattice Approximation and Linear Discrepancy of Totally Unimodular Matrices
Slides Conference
15.12.2000, Defense of my doctoral dissertation: Mehrfarbendiskrepanzen [german]
Slides
27.11.2000, Kolloquium des DFG-Graduiertenkollegs 357: Rekursives Färben [german]
Slides
03.10.2000, Klausurtagung des DFG-Graduiertenkollegs 357, Malente: Diskrete Fourieranalysis in der Diskrepanztheorie [german]
Slides
18.09.-22.09.00, Jahrestagung der DMV, Dresden: Mehrfarbendiskrepanzen [german]
Slides Conference
08.08.-11.08.99, APPROX '99, Berkeley: Approximation of Multi-Color Discrepancy
Abstract Slides Conference
05.06.99, Workshop on Randomized Algorithms, Kiel: Multi-Color Discrepancy
Abstract Slides Conference
15.02.-17.02.99, Klausurtagung des DFG-Graduiertenkollegs 357, Leck: Kombinatorische Diskrepanzen [german]
Slides Conference
13.11.-14.11.98, Colloquium on Combinatorics, Braunschweig: Linear and Hereditary Discrepancy
Abstract Slides Conference
06.09.-10.09.98, Discrepancy and its Applications, Kiel: Discrepancies of Cartesian Products of Arithmetic Progressions
Paper Conference

Conferences, Workshops, etc. (except the ones above):

05.08.-09.08.08, Budapest: Building Bridges
Conference
01.06.-06.06.08, Hongkong: CEC 2008
Conference
25.09.-28.09.07: CEC 2007
07.07.-11.07.07, London, England: GECCO 2007
Conference
06.07.-08.07.06, Riga (Latvia): SWAT 2006
Conference
03.10.-07.11.05, Mallorca (Balearic Islands, Spain): ALGO 2005
Conference
17.07.-22.7.05, Dagstuhl-Seminar: Sublinear Algorithms
22.08.-27.08.2004, Prague, Czech Republic: MFCS 2004
Conference
14.05.2004, Columbia, New York City, NY, USA: Columbia | NYU | IBM Research THEORY DAY
Conference
15.01.-18.01.2003, Baltimore, MD, USA: Joint Mathematics Meeting of the AMS and MAA
Conference
07.10.-08.10.2002, Berlin: Combinatorics in honour of Walter Deuber's 60th Birthday
H. J. Prömel
Conference
06.01.-08.01.2002, San Francisco: Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA02)
(Program Committee Member)
Conference
22.08.-24.08.2001, Riga, Latvia: 13th International Symposium on Fundamentals of Computation Theory (FCT 2001)
Conference
25.03.-30.03.01, ARACNE-Summerschool (Kiel): Approximation Algorithms for Scheduling and Telecommunications
K. Jansen
Pictures
28.08-01.09.00, BRICS Workshop: Probabilistic Methods in Combinatorial Optimization
Michal Karonski, Tibor Jordan, Erik Meineche Schmidt, Alessandro Panconesi
Speakers and Talks
23.01.-28.01.00, Dagstuhl-Seminar No. 00041: Linear, Semidefinite Programming and Randomization Methods for Combinatorial Optimization Problems
K. Jansen, J. Rolim, M. Sudan
Postscript Topics People
06.06.-08.06.99, Summerschool (Plön): Probabilistic Methods and Algorithms
A. Srivastav
Conference
24.04.-25.04.98, Berlin: Diskrete Mathematik '98
H. J. Prömel
Conference
20.12.-21.12.96, Bielefeld: Perspectives in Mathematics: Groups and Geometries
C. M. Ringel, G. Röhrle
Conference