In connection with the move of the Mathematical Insights into Algorithms for Optimization (MIAO) research group to Copenhagen and Lund, the computer science departments at the University of Copenhagen and Lund University announce openings for:
- PhD students in SAT solving and combinatorial optimization: http://www.csc.kth.se/~jakobn/openings/PhD-SAT-LTH-200706.php
- PhD students in theoretical computer science: http://www.csc.kth.se/~jakobn/openings/PhD-TCS-DIKU-200706.php
- Postdocs in theoretical computer science: http://www.csc.kth.se/~jakobn/openings/Postdoc-TCS-DIKU-200706.php
In one sentence, the goal of our research is on the one hand to show exponential lower bounds on running time for algorithms solving NP-complete problems, and on the other hand to devise new algorithms that crack such problems in linear time. To be able to do so, candidates will need a suitable combination of math wizardry, awesome programming skills, and a healthy dose of schizophrenia...
The application deadline is July 6, 2020, for all positions. Informal enquiries are welcome and may be sent to [email protected].
At the University of Copenhagen we expect to have tenure-track openings in theoretical computer science in the near future, and encourage postdoctoral researchers interested in exploring such opportunities. We also welcome candidates interested in applying for an Individual Fellowship within the EU Marie Sklodowska-Curie actions program (https://ec.europa.eu/research/mariecurieactions/actions/get-funding/individual-fellowships-2020_en).