Research Departments Algorithms and Complexity Teaching Summer 2024 Teaching - Summer 2024 Fine-Grained Complexity Theory Core Course (4+2). Lecturer: Karl Bringmann. more Topics in Computational Social
Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6
Processing Algorithms & Complexity People Current Members Former Members Research Algorithmic Game Theory Clustering Distributed Computing Fine-Grained Complexity and Algorithm Design Graph Algorithms Learn [...] Learning-Augmented Algorithms Optimization Parameterized and Counting Algorithms and Complexity String Algorithms and Data Compression Offers Postdoc Application Teaching Winter 2023/24 Algorithms and Data Structures [...] Randomized Algorithms and Probabilistic Analysis of Algorithms Approximation Algorithms Ideen und Konzepte der Informatik Summer 2022 Winter 2021/22 Summer 2021 Winter 2020/21 Summer 2020 Winter 2019/20
of the area. The topics include network protocol mechanisms, implementation principles, network algorithms, advanced network architectures, network simulations, measurements and protocol specifications
Research Departments Algorithms and Complexity Teaching Teaching The members of the algorithms group of MPI-INF offer courses and thesis (bachelor, master, and PhD) topics in algorithmics. We offer the core [...] Course type Speaker / Tutor Randomized Algorithms and Probabilistic Analysis of Algorithms Advanced Course Philip Wellnitz , Tutor: Baris Can Esmer Approximation Algorithms Advanced Course Joachim Spoerhase [...] Karrenbauer Parameterized Algorithms Advanced Course Pranabendu Misra and Dániel Marx Reading Group Algorithms Seminar Bhaskar Ray Chaudhury and Karl Bringmann Sublinear Algorithms Advanced Course Karl Bringmann
Research Departments Algorithms and Complexity Teaching Summer 2023 Techniques for Counting Problems Techniques for Counting Problems Advanced Course, 2+1 Basic Information Lectures: Thursdays, 14:00 to [...] 2nd Credits: 5 Exam: Tuesday, August 08, 10:00, E1.4 Room 0.24 Prerequisites: Basic knowledge in Algorithms Description In this course we give an introduction to counting problems and counting complexity [...] Counting (Quantum) Graph Homomorphisms; WG 2019. Techniques for Counting Problems Parametrized Algorithms (external) Seminar: Foundations of Machine Learning