[Proof Complexity] Associate professorship in computer science (including TCS) at KTH Royal Institute of Technology

Jakob Nordström jakobn at kth.se
Sat Jan 7 14:47:51 CET 2017

Dear colleagues,

We would be very grateful for your assistance in spreading the information that KTH Royal Institute of Technology is looking for a tenured associate professor in computer science with a broad profile, explicitly including (but not limited to) computational complexity theory.

KTH is the leading technical university in Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research environment covering a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. The group has a consistent track record of publishing in the leading theoretical computer science conferences and journals worldwide, and the research conducted here has attracted numerous international awards and grants in recent years.

The application deadline is February 17, 2017. See http://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:96024/where:4/ for the full announcement with more information and instructions how to apply. Informal enquiries about this position (and possibly about how to navigate the application procedure at KTH) are welcome and may be sent to Johan Hastad at johan at kth.se or Jakob Nordstrom at jakobn at 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)


More information about the Proof-Complexity mailing list