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

[Jakob Nordström]

Dear colleagues,



I 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 computational complexity (including proof complexity).



The postdoctoral researchers will be working in the research group of Jakob Nordstrom (www.csc.kth.se/~jakobn). The group currently consists of two postdoctoral researchers and four PhD students (in addition to the PI). There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity (in particular, within the research project Approximation and Proof Complexity http://apc.csc.kth.se/), and so this is a unique opportunity to explore new connections between different areas of theoretical computer science within a vibrant and growing research environment.



These postdoc positions are full-time employed positions for one year with a possible one-year extension. The expected starting date is in August-September 2017, although this is to some extent negotiable.



The application deadline is March 31, 2017. See http://www.csc.kth.se/~jakobn/openings/D-2017-0137-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to jakobn at kth.se.


Please note that this is an additional announcement on top of D-2016-0871 due to additional research funding. Candidates who already applied for the position D-2016-0871 need not apply again --- all applicants for both announcements are evaluated in parallel.



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/