Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, February 16, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jukka Suomela (Aalto University)

Understanding computation with computation

As theoretical computer scientists, we seek to understand what can be automated, but what do we know about automating our own work? Is it possible for us to outsource our own research questions to computers? In this talk I will survey some of our recent success stories related to the use of computational techniques in the study of algorithms and computational complexity. My focus will be on the theory of distributed computing; the models of distributed computing appear to be particularly well-suited for computational investigations. I will give examples of distributed algorithms that were designed or co-designed by computers and that far outperform any previous human-designed algorithms. I will describe some meta-algorithmic techniques - how to design algorithms for designing algorithms - and we will also see an example of how to use computers to discover lower bound proofs.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login