Department of Computer Science | Institute of Theoretical Computer Science
Prof. Dr. Angelika Steger
Prof. Dr. David Steurer
Dr. Johannes Lengler
The first meeting is Wednesday, Sep 19, at 15:15 in CAB G 15.2. On the first meeting, we will agree on a time slot for the rest of the semester.
In this course students will develop solutions for algorithmic problems posed by researchers from other fields. The course addresses master students in computer science, and is suited both for students with a theoretical and with a more applied focus.
The main goal is to learn how to solve algorithmic problems in an interdisciplinary or applied context. The key is to combine (i) a solid understanding of algorithmic methodology with (ii) insights into the problem at hand to judge which side constraints are essential and which can be loosened. Or, phrased differently, real world problems are often ill posed. And a major step toward a solution is to find an appropriate formalization of the problem.
Since we are dealing with real data, performance will be evaluated experimentally. For this evaluation, students need to implement algorithms, preferably by using and combining available tools. The course will be run during the term. The course is 5CP and we thus expect that students work for the lab a full day each week.