Tobias Friedrich: Talks

24.01.2012	“A Comparison of Hypervolume- and Approximation-Guided MOEAs” Seminar Learning in Multiobjective Optimization, Dagstuhl, Germany
11.01.2012	“Taming Randomness: From Physics to Efficient Algorithms” Joint MPI-INF/MPI-SWS Lecture Series, Max-Planck-Institut Informatik, Saarbücken, Germany
17.08.2011	“Fast Simulation of Large-Scale Growth Models” 15th International Workshop on Randomization and Computation (RANDOM), Princeton, NJ, USA
15.07.2011	“Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness” Genetic and Evolutionary Computation Conference (GECCO), Dublin, Ireland
13.07.2011	“Foundations of Evolutionary Multi-Objective Optimization” (tutorial) Genetic and Evolutionary Computation Conference (GECCO), Dublin, Ireland
30.06.2011	“Zufall in der Algorithmik” (invited talk) Department of Mathematics and Computer Science, Friedrich-Schiller-Universität Jena, Germany
14.06.2011	“Zufällige Prozesse und Quasizufällige Algorithmen” (invited talk) Institute of Computer Science, Johannes Gutenberg-Universität, Mainz, Germany
01.06.2011	“Quasirandomness and Load Balancing” Institute of Mathematics, Technische Universität Berlin, Germany
02.04.2011	“Quasizufällige Irrfahrten” (invited talk) Institute of Mathematics, Ilmenau University of Technology, Ilmenau, Germany
30.03.2011	“Quasizufällige Irrfahrten und Algorithmen” (invited talk) Hamburg University of Technology, Hamburg-Harburg, Germany
24.03.2011	“Random and Quasirandom Algorithms” Cluster of Excellence on Multimodal Computing and Interaction, Saarbrücken, Germany
09.03.2011	“The Hypervolume Indicator” Evolutionary Computation Seminar, School of Computer Science, University of Adelaide, Australia
23.01.2011	“Randomized Diffusion for Indivisible Loads” ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, USA
06.01.2011	“Fast Simulation of Large-Scale Growth Models” 2011 Joint Mathematics Meetings, New Orleans, LA, USA
27.10.2010	“High-Performance Computing for Large-scale Physical Models” Future SOC Lab, Hasso-Plattner-Institut, Potsdam, Germany
12.09.2010	“Foundations of Evolutionary Multi-Objective Optimization” (tutorial) 11th International Conference on Parallel Problem Solving From Nature (PPSN), Krakow, Poland
06.09.2010	“Approximation Quality of the Hypervolume Indicator” Seminar Theory of Evolutionary Algorithms, Dagstuhl, Germany
20.07.2010	“The Cover Time of Deterministic Random Walks” 16th Annual International Computing and Combinatorics Conference (COCOON), Nha Trang, Vietnam
15.07.2010	“Zufall in der Algorithmik” (habilitation) Department of Computer Science, Universität des Saarlandes, Saarbrücken, Germany
10.07.2010	“The Maximum Hypervolume Set Yields Near-optimal Approximation” Genetic and Evolutionary Computation Conference (GECCO), Portland, Oregon, USA
08.07.2010	“Foundations of Evolutionary Multi-Objective Optimization” (tutorial) Genetic and Evolutionary Computation Conference (GECCO), Portland, Oregon, USA
16.06.2010	“Zufall in der Algorithmik” (invited talk) Department of Computer Science, Albert-Ludwigs-Universität Freiburg, Germany
04.06.2010	“Quasirandom Load Balancing” Microsoft Research Theory Group Seminar, Redmond, Washington, USA
01.06.2010	“Quasirandom Load Balancing” University of Washington Computer Science & Engineering Theory Seminar, Seattle, Washington, USA
19.01.2010	“Quasirandom Load Balancing” ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, Texas, USA
12.01.2010	“Quasirandom Load Balancing” Noon seminar, Max-Planck-Institut Informatik, Saarbücken, Germany
14.11.2009	“Quasirandom Rumor Spreading on Expanders” Colloquium on Combinatorics, Magdeburg, Germany
08.09.2009	“Quasirandom Rumor Spreading on Expanders” European Conference on Combinatorics, Graph Theory and Applications (EuroComb), Bordeaux, France
07.07.2009	“Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness” 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece
15.05.2009	“Random and Quasirandom Algorithms” (invited talk) Karlsruhe Institute of Technology, Universität Karlsruhe, Karlsruhe, Germany
30.03.2009	“Engineering of Random and Quasirandom Algorithms” (invited talk) Department of Mathematics and Computer Science, Friedrich-Schiller-Universität Jena, Germany
04.03.2009	“Deterministic random walks and quasirandom rumor spreading” Berkeley Probability Seminar, Statistics Department, University of California, Berkeley, USA
17.02.2009	“Deterministic random walks and their application to rumor spreading” (invited talk) MIT Probability Seminar, Department of Mathematics, Massachusetts Institute of Technology, Boston, USA
11.01.2009	“Don't be greedy when calculating hypervolume contributions” 10th ACM Foundations of Genetic Algorithms (FOGA), Orlando, USA
17.12.2008	“Average Update Times for Fully-Dynamic All-Pairs Shortest Paths” 19th International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia
16.12.2008	“Approximating the volume of unions and intersections of high-dimensional geometric objects” 19th International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia
07.10.2008	“Random walks without randomness but with applications” International Computer Science Institute Algorithms Group Seminar, Berkeley, USA
20.08.2008	“Quasirandom Broadcasting” 9th Max-Planck Advanced Course on the Foundations of Computer Science (ADFOCS), Saarbrücken, Germany
15.08.2008	“Deterministic Random Walks on Regular Trees” Fete of Combinatorics and Computer Science, Keszthely, Hungary
14.07.2008	“Theoretical Analysis of Diversity Mechanisms for Global Exploration” Genetic and Evolutionary Computation Conference (GECCO), Atlanta, USA
03.06.2008	“When to Use Bit-wise Neutrality” IEEE Congress on Evolutionary Computation (CEC), Hong Kong
29.04.2008	“Verwendung und Vermeidung von Zufall” Kolloquium zum GI Dissertationspreis 2008, Dagstuhl, Germany
12.03.2008	“Brauchen wir Zufall?” (talk for pupils) Universität des Saarlandes, Saarbrücken, Germany
21.01.2008	“Deterministic Random Walks on Regular Trees” ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, USA
18.12.2007	“Average-Case Analysis of Online Topological Ordering” International Symposium on Algorithms and Computation (ISAAC), Sendai, Japan
13.12.2007	“Use and Avoidance of Randomness” Department of Computer Science, Universität des Saarlandes, Saarbrücken, Germany
17.11.2007	“Deterministic Random Walks on Trees” Colloquium on Combinatorics, Magdeburg, Germany
16.11.2007	“Quasirandom Rumor Spreading” Colloquium on Combinatorics, Magdeburg, Germany
22.10.2007	“Deterministic Random Walks and their Applications to Rumor Spreading” (invited talk) Colloquium Computational Intelligence, Collaborative Research Center 531, Dortmund, Germany
27.09.2007	“Plateaus Can Be Harder in Multi-Objective Optimization” IEEE Congress on Evolutionary Computation (CEC), Singapore
11.09.2007	“Deterministic Random Walks on Regular Trees” European Conference on Combinatorics, Graph Theory and Applications (EuroComb), Seville, Spain
14.07.2007	“Plateaus Can Be Harder in Multi-Objective Optimization” Workshop Theory of Randomized Search Heuristics (colocated with ICALP 2007), Wroclaw, Poland
09.07.2007	“Rigorous Analyses of Simple Diversity Mechanisms” Genetic and Evolutionary Computation Conference (GECCO), London, UK
08.05.2007	“Deterministic Random Walks on Grids and Trees” (invited talk) Oberseminar AG Monien, Paderborn, Germany
20.12.2006	“Deterministic Random Walks on the Two-Dimensional Grid” 17th International Symposium on Algorithms and Computation (ISAAC), Kolkata, India
17.11.2006	“Deterministic Random Walks on the Infinite Grid” Colloquium on Combinatorics, Magdeburg, Germany
23.10.2006	“Deterministic Random Walks” Oberseminar Theoretical Computer Science, Jena, Germany
21.09.2006	“Deterministic Random Walks on the Two-Dimensional Grid” Jahrestagung der Deutschen Mathematiker-Vereinigung, Bonn, Germany
20.07.2006	“Deterministic Random Walks on the Two-Dimensional Grid” Horizon of Combinatorics, Balatonalmádi, Hungary
15.07.2006	“Unbiased Matrix Rounding” Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, Czech Republic
07.06.2006	“Quasirandomness in Graphs” Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), Lambrecht, Germany
02.06.2006	“Deterministic Random Walks” Noon seminar, Max-Planck-Institut Informatik, Saarbücken, Germany
27.04.2006	“Worldwide Programming Contests” Universität des Saarlandes, Saarbrücken, Germany
15.03.2006	“Linear time controlled rounding of matrices” 7th German Open Conference on Probability and Statistics, Goethe-Universität, Frankfurt am Main, Germany
03.03.2006	“Worldwide Programming Contests” (invited talk) Fachtagung zum Informatikunterricht der Zukunft, Jena, Germany
27.02.2006	“Quasirandom walks” FSU-Seminar on Complexity Theory, Römhild, Germany
07.10.2005	“Rounding of Sequences and Matrices, with Applications” Workshop on Approximation and Online Algorithms (WAOA), Palma de Mallorca, Spain
07.09.2005	“An Extension of Baranyai's Rounding Lemma” European Conference on Combinatorics, Graph Theory, and Applications (EuroComb), Berlin, Germany
22.12.2004	“Nonlinear Dimensionality Reduction” Noon seminar, Max-Planck-Institut Informatik, Saarbücken, Germany
19.01.2004	“Worldwide Programming Contests - Ein Insider Report” Ringvorlesung der Regionalgruppe Ostthüringen der Gesellschaft für Informatik (GI), Jena, Germany