2999 Departments D1 Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust [...] Research Departments Algorithms and Complexity Research String Algorithms and Data Compression String Algorithms and Data Compression Strings (texts, sequences) appear everywhere in our daily lives, and [...] datasets generated by humanity (such as the petabytes of genomic data). We develop cutting-edge algorithms for processing huge strings of all kinds, focusing on classical problems such as measuring the
human genetic diversity. This is enabled by new sequencing technologies in combination with novel algorithmic methods, which we develop actively. High-throughput methods for genome sequencing allow for reading [...] to new, medically relevant insights. Tobias Marschall DEPT. 3 Computational Biology and Applied Algorithmics Phone +49 681 302 70880 Email t.marschall mpi-inf.mpg.de http://mpi-inf.mpg.de Structural Variation
Research Departments Algorithms and Complexity Teaching Summer 2020 Sublinear Algorithms Sublinear Algorithms Advanced Course Basic Information Lectures: Thursday, 16:15 - 18:00 Lecturer: Karl Bringmann [...] basic knowledge in algorithms. Therefore, required prerequisite is a basic lecture in algorithms (such as "Grundzüge von Algorithmen und Datenstrukturen"). The core lecture "Algorithms and Data Structures" [...] design non-trivial and meaningful algorithms. In this course, we will learn how to design and analyze sublinear algorithms. Regarding space, we will focus on streaming algorithms, regarding time, we will see
Theory of Polynomial-Time Problems Randomized Algorithms and Probabilistic Analysis of Algorithms Mathematik für Informatiker 2 Reading Group Algorithms State of the Art Linear Programming Theory [...] (2+1). Lecturers: Karl Bringmann and Sebastian Krinninger. more Randomized Algorithms and Probabilistic Analysis of Algorithms Advanced Course (2+2). Lecturers: Thomas Kesselheim and Kurt Mehlhorn. more [...] Research Departments Algorithms and Complexity Teaching Summer Semester 2016 Optimization Core Course (4+2). Lecturers: Parinya Chalermsook and Andreas Wiese. more Complexity Theory of Polynomial-Time
Group Algorithms Seminar. Given by: Emanuele Natale, Kurt Mehlhorn, and Ruben Becker. more Optimization Approximation Algorithms Introduction to Geometric Complexity Theory Reading Group Algorithms [...] Research Departments Algorithms and Complexity Teaching Summer Semester 2017 Optimization Core Course (4+2). Lecturer: Andreas Karrenbauer. more Approximation Algorithms Advanced Course (2+2). Lecturers:
Research Departments Algorithms and Complexity Teaching Summer 2018 Summer Semester 2018 Keeping Time in Distributed Systems Advanced Course (2+2). Lecturer: Christoph Lenzen. more Selected Topics in [...] Ikenmeyer. more Optimization Core Course (4+2). Lecturer: Andreas Karrenbauer. more Reading Group Algorithms Seminar (2+0). Given by: Kurt Mehlhorn, and Daniel Vaz. more Keeping Time in Distributed Systems [...] Complexity Theory A first introduction to geometric complexity theory Optimization Reading Group Algorithms
Research Departments Algorithms and Complexity Teaching Summer 2019 Summer Semester 2019 Distributed and Sequential Graph Algorithms Advanced Course (2+1). Lecturer: Saeed Amiri and Pranabendu Misra. more [...] Lenzen. more Distributed and Sequential Graph Algorithms Fine-Grained Complexity Theory Introduction to Boolean Function Complexity Reading Group Algorithms Optimization Keeping Time in Distributed Systems [...] Boolean Function Complexity Advanced Course (2+1). Lecturer: Nitin Saurabh. more Reading Group Algorithms Seminar (2+0). Given by: Kurt Mehlhorn. more Optimization Core Course (4+2). Lecturer: Andreas
Sublinear Algorithms Advanced Course (2+1). Given by: Karl Bringmann and Vasileios Nakos more Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms [...] Lecturer: Andreas Karrenbauer. more Parameterized Algorithms Advanced Course (2+1). Given by: Pranabendu Misra and Dániel Marx more Reading Group Algorithms Seminar (2+0). Given by: Bhaskar Ray Chaudhury [...] Research Departments Algorithms and Complexity Teaching Summer 2020 Summer Semester 2020 Computational Geometry Advanced Course (3+1). Given by: Sándor Kisfaludi-Bak and Raimund Seidel more Optimization
Research Departments Algorithms and Complexity Teaching Summer 2022 Summer Semester 2022 Coping with computational hardness (external) Seminar. Lecturer: Dániel Marx more Competitive Programming (external) [...] Markus Bläser, Karl Bringmann, Martin Bromberger, Christoph Weidenbach more Reading Group: String Algorithms (external) Seminar. Lecturers: Karl Bringmann, Tomasz Kociumaka more How to Clock Your Computer [...] with computational hardness (external) Competitive Programming (external) Reading Group: String Algorithms (external) How to Clock Your Computer (external) Optimization
