Suche

Abteilungen Algorithms and Complexity Department 1: Algorithms and Complexity The department investigates a broad range of theoretical and practical aspects of modern algorithmics. We design new algorithms and [...] bioinformatics to geometry, to scheduling, and several others. mehr Weitere Informationen Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different parameters of the [...] this, we are also studying the limits of such algorithms. mehr Weitere Informationen Fine-Grained Complexity and Algorithm Design Fine-grained Complexity Theory is the design of reductions that prove running

quality control and domain specific problems such as face recognition, recovery of CAD models for well-defined objects and basic visual surveillance. Robustness of perception and vision algorithms however is [...] multiple features and sensors facilitates robustness in environments of realistic complexity. The computer vision and machine learning department was founded by Bernt Schiele in 2010 and currently consists [...] Forschung Abteilungen Computer Vision and Machine Learning Department 2: Computer Vision and Machine Learning Perceptual Computing in general and Computer Vision in particular have great potentials to

external algorithms, distributed algorithms, complexity theory, combinatorial and continuous optimization, graph drawing, on-line algorithms, randomized algorithms, computational biology and implementation [...] Abteilungen Algorithms and Complexity Offers Offers The interests of the (around 40) research group members includes data structures, graph and network algorithms, computational geometry, parallel and external [...] Potential D1 supervisors and their availability will be listed here in due time, as well as on their personal webpages. Long Term Visits If you would like to visit the Algorithms and Complexity Group for an extended

bioinformatics to geometry, to scheduling, and several others. mehr Weitere Informationen Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different parameters of the [...] this, we are also studying the limits of such algorithms. mehr Weitere Informationen Fine-Grained Complexity and Algorithm Design Fine-grained Complexity Theory is the design of reductions that prove running [...] such problems: integer programming, fixed-parameter tractable and exact algorithms, approximation algorithms and combinatorial algorithms, among others. D1 works on applying these methods to various problems

Forschung Abteilungen 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 [...] Course Course type Speaker / Tutor Algorithms and Data Structures Core Course Karl Bringmann and Philip Wellnitz Sublinear Algorithms Advanced Course Karl Bringmann and Nithin Varma Ideen und Konzepte der [...] 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

Forschung Abteilungen Algorithms and Complexity People People Researchers Berendsohn, Benjamin Borst, Sander Bringmann, Karl Cembrano, Javier Dorfman, Dani Karrenbauer, Andreas Kipouridis, Evangelos Kociumaka

springen Institut D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] Abteilungen D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publikationen Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases and Information

Forschung Abteilungen Algorithms and Complexity People Former Members Former Members A Abed, Fidaa Abo-Hasna, Ziad Abraham, David Adamaszek, Michal Adamaszek, Anna Afanasev, Kirill Agarwal, Manindra Agarwal [...] Ghaffari, Mohsen Ghorbani, Mohammadnikan Ghosal, Pratik Ghosal, Angikar Ghosh, Arijit Gidenstam, Anders Giesen, Joachim Gill, Christian Goerg, Carsten Golin, Mordecai Goswami, Mayank Gouleakis, Themistoklis

Forschung Abteilungen Algorithms and Complexity Research Fine-Grained Complexity and Algorithm Design Fine-Grained Complexity and Algorithm Design Fine-grained Complexity Theory is the design of reductions [...] Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] time lower bounds assuming a plausible complexity-theoretic conjecture such as the Strong Exponential Time Hypothesis. In this area the design of efficient algorithms goes hand in hand with proving fine-grained

Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] such problems: integer programming, fixed-parameter tractable and exact algorithms, approximation algorithms and combinatorial algorithms, among others. D1 works on applying these methods to various problems [...] Forschung Abteilungen Algorithms and Complexity Research Optimization Optimization Many real world applications are naturally formulated as optimization problems, i.e., problems of finding the best solution(s)