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. Antoine Joux
Professor, CISPA Helmholtz Center for Information SecurityAlgorithmic Foundations and Cryptography
Prof. Dr. Benjamin Kaminski
Professor, Department of Computer ScienceQuantitative Verification
Prof. Dr. Dr. h.c. mult. Kurt Mehlhorn
Seniorprofessor and Professor, Saarland UniversityAlgorithms and Complexity
Prof. Ph.D. Danupon Nanongkai
Scientific Director and Professor, Max Planck Institute for Informatics (MPI INF)Algorithms and Complexity
Junior faculty in this field
Dr. Andreas Karrenbauer
Group Leader, Max Planck Institute for Informatics (MPI INF)Combinatorial Optimization
Dr. Daria Stepanova
Group Leader, Max Planck Institute for Informatics (MPI INF)Semantic Data
