Search

Departments D1 Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] 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 they constitute [...] Learning String Algorithms and Data Compression

Computational Biology and Applied Algorithmics Phone +49 681 302 70880 Email t.marschall mpi-inf.mpg.de http://mpi-inf.mpg.de Structural Variation in Genomes Protein Structure and Interactions Bioinformatical [...] in chromosomes: we inherit 23 chromosomes from our mother and father, respectively. A chromosome consists of a long DNA molecule, stabilized and spatially structured by special proteins. The DNA encodes [...] constituting bases adenine (A), cytosine (C), guanine (G), and thymine (T). In this sense, a chromosome can be viewed as a sequence of the letters A, C, G, and T. Likewise, we can represent a genome as a set of

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 [...] can 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 [...] assume mathematical maturity and comfort with basic probability theory. We also assume basic knowledge in algorithms. Therefore, required prerequisite is a basic lecture in algorithms (such as "Grundzüge von

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 [...] 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 Mathematik [...] more Optimization Complexity 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

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: [...] to Geometric Complexity Theory Advanced Course (4+2). Lecturers: Markus Bläser, Christian Ikenmeyer. more Reading 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 2018 Summer Semester 2018 Keeping Time in Distributed Systems Advanced Course (2+2). Lecturer: Christoph Lenzen. more Selected Topics in [...] Fine-Grained Complexity Theory Seminar (2+0). Lecturers: Karl Bringmann and Marvin Künnemann. more A first introduction to geometric complexity theory Advanced Course (2+2). Lecturers: Markus Bläser, Christian [...] Karrenbauer. more Reading Group Algorithms Seminar (2+0). Given by: Kurt Mehlhorn, and Daniel Vaz. more Keeping Time in Distributed Systems Selected Topics in Fine-Grained Complexity Theory A first introduction

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 [...] Christoph Lenzen. more Distributed and Sequential Graph Algorithms Fine-Grained Complexity Theory Introduction to Boolean Function Complexity Reading Group Algorithms Optimization Keeping Time in Distributed [...] more Fine-Grained Complexity Theory Advanced Course (3+1). Lecturers: Karl Bringmann and Marvin Künnemann. more Introduction to Boolean Function Complexity Advanced Course (2+1). Lecturer: Nitin Saurabh

Sublinear Algorithms Advanced Course (2+1). Given by: Karl Bringmann and Vasileios Nakos more Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms [...] 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 [...] . 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 and Karl Bringmann more Sublinear

Departments Algorithms and Complexity Teaching Summer 2021 Summer Semester 2021 Clock Synchronization and Adversarial Fault Tolerance Advanced Course (2+2). Lecturers: Christoph Lenzen and Ben Wiederhake [...] me, and parameterized algorithms (external) Advanced Course (2+2). Given by: Dániel Marx more Geometric algorithms with limited resources Advanced Course (2+1). Given by: Sándor Kisfaludi-Bak and Themis [...] Synchronization and Adversarial Fault Tolerance Coping with computational hardness: approximation, moderately exponential-time, and parameterized algorithms (external) Geometric algorithms with limited resources

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