max planck institut
mpii logo Minerva of the Max Planck Society

Job Openings in Karl Bringmann's Group

Postdoc Positions

A full-time postdoc position is available in the research group Algorithms & Complexity led by Professor Karl Bringmann at Saarland University and affiliated to Max Planck Institute for Informatics. The research group is known for developing fine-grained complexity theory, the area of theoretical computer science that proves conditional lower bounds based on conjectures such as the Strong Exponential Time Hypothesis. The group is both designing new efficient algorithms and establishing their optimality by conditional lower bounds, thus arriving at "best-possible" algorithms for problems from various application areas such as: discrete optimization, string algorithms, computational geometry, sublinear algorithms, graph algorithms, database theory, algorithm engineering, and algorithmic foundations of machine learning. We want to hire a postdoc who either brings some knowledge in fine-grained complexity theory or brings expertise in any of these application areas and wants to explore the use of fine-grained complexity in their area of expertise. The research group is partially funded by an ongoing ERC Grant awarded to Karl Bringmann. It is located on Saarland Informatics Campus, which is a vivid environment hosting several renowned algorithms researchers including Daniel Marx, Kurt Mehlhorn, Danupon Nanongkai, and Raimund Seidel.

The position has a flexible starting date in 2022 and can last until end of 2024. If you are interested, please send your application to <mylastname> Your application should include a CV with a list of publications, a research statement, and a short paragraph describing possible connections to the research group. To receive full consideration please send your application by January 12, 2022.