Postdoc positions in Theoretical Computer Science at KTH Royal Institute of Technology, Stockholm (Sweden)
The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in theoretical computer science.
The postdoc positions are in the area of computational complexity theory. Current research in the group focuses mostly on approximation algorithms/hardness of approximation, subexponential algorithms, and proof complexity, but excellent researchers in neighbouring areas such as, e.g., communication complexity, circuit complexity, algebraic complexity, and harmonic analysis are also warmly welcome to apply.
This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council. In addition to the PIs, the research project is planned to involve a total of 4-5 postdocs and 4-5 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.
These postdoc positions are full-time employed positions for one year with a possible(and expected) one-year extension. The expected starting date is in August-September 2018, although this is to some extent negotiable.