Algorithms
Brief overview of the research field
This research field brings together aspects of theoretical and practical computer science. Typically it concerns the analysis of existing methods, or the development of new ones, for solving a problem. Primary criteria are the accuracy of the results, complexity, and efficiency optimization with respect to runtime or space requirements. Datastructures and probability theory play a central role here.
This area is represented by research groups in the Department of Computer Science, the Cluster of Excellence MMCI and the Max Planck Institute for Informatics.
Professors in this field
Prof. Dr. Markus Bläser
Professor, Saarland UniversityComputational Complexity
Prof. Dr. Karl Bringmann
Professor, Saarland UniversityAlgorithms and Complexity
Prof. Dr. Dániel Marx
Professor, Helmholtz Center for Information Security (CISPA)Algorithms and Complexity
Prof. Dr. Dr. h.c. mult. Kurt Mehlhorn
Seniorprofessor and Professor, Saarland UniversityAlgorithms and Complexity
Junior faculty in this field
Dr. Andreas Karrenbauer
Group Leader, Max Planck Institute for Informatics (MPI INF)Combinatorial Optimization
Ph.D. Daniel Marx
Group Leader, Helmholtz Center for Information Security (CISPA)Parameterized Algorithms & Complexity
