[Proof Complexity] Postdoc positions in TCS at KTH Royal Institute of Technology

[Jakob Nordström]

Dear colleagues,



We would be very grateful for your assistance in spreading the information that the Theory Group at KTH Royal Institute of Technology is looking for postdocs in TCS (including proof complexity).



The positions are within a research project led by Johan Hastad, Per Austrin, and Jakob Nordstrom focusing mostly on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity, but excellent researchers interested in neighbouring areas such as, e.g., communication complexity, circuit complexity, algebraic complexity, and harmonic analysis are also warmly welcome to apply.



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 2019, although this is to some extent negotiable.



The application deadline is February 4, 2019. See https://apc.eecs.kth.se/J-2018-3169-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to apc at eecs.kth.se .



With best regards,

Jakob Nordstrom



Jakob Nordström, Associate Professor

KTH Royal Institute of Technology

Phone: +46 8 790 69 19 (office), +46 70 742 21 98 (cell)

http://www.csc.kth.se/~jakobn/