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