The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in computational complexity.
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 postdoctoral researchers will be working in the research group of Jakob Nordstrom (http://www.csc.kth.se/~jakobn). Much of the activities of this research group revolve around the themes of proof complexity and SAT solving. On the theoretical side, proof complexity has turned out to have deep, and sometimes surprising, connections to other topics such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore researchers in these or other related areas are more than welcome to apply.
This is a full-time employed position for one year with a possible one-year extension. The successful candidate is expected to start in August-September 2016, although this is to some extent negotiable.
The application deadline is January 24, 2016. More information and instructions how to apply can be found at http://www.csc.kth.se/~jakobn/openings/D-2015-0816-Eng.php . Informal enquiries are welcome and may be sent to Jakob Nordstrom.
Posts
