The position below has been filled, and this webpage is kept for archival purposes only.
Postdoc Position in Theoretical Computer Science
The Theoretical Computer Science group at KTH Computer Science and Communication (KTH CSC) invites applications for a postdoctoral position in Theoretical Computer Science with a focus on proof complexity and connections to SAT solving.
KTH Royal Institute of Technology is the largest and oldest technical university in Sweden. No less than one-third of Sweden's technical research and engineering education capacity at university level is provided by KTH. Education and research spans from natural sciences to all branches of engineering and includes architecture, industrial management and urban planning. There are a total of just over 15,000 first and second level students and more than 1,600 doctoral students. KTH has almost 4,300 employees.
KTH Computer Science and Communication is one of Sweden's leading research and education institutions in Information Technology, with activities at both KTH and Stockholm University. The activities of the school focus on higher education and research within the traditional core areas of numerical analysis and computer science; from theory building and analysis of mathematical models to algorithm construction, implementation and simulation. Other core areas of growing importance are technology and methods for the support of human communication and computer mediated cooperation. The applied research includes scientific computing, computer science, computer vision, robotics, neuroinformatics and neural networks, human-computer interaction, media technology, and communication through speech and music. For more information, go to www.kth.se/csc and follow the link to our "international website".
The Theoretical Computer Science group at KTH CSC (www.csc.kth.se/tcs) offers a strong research environment spanning 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 regularly 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.
We are seeking a postdoctoral researcher in Theoretical Computer Science within the framework of the research project "Understanding the Hardness of Theorem Proving." This is a project in proof complexity with connections to SAT solving.
In this project, we aim to advance the frontiers of proof complexity by studying proof space and connections between proof size and proof space, a line of research that has seen exciting developments in the last decade. We also intend to attack (and hopefully make progress on) some of the more classical long-standing open problems in the field. Our hope is then that we can leverage this theoretical research to shed light on questions related to SAT solving. A more detailed description of the project can be found at www.csc.kth.se/~jakobn/project-proofcplx.
The project is led by Jakob Nordström (www.csc.kth.se/~jakobn) and is financed by a Starting Independent Researcher Grant from the European Research Council. The postdoctoral researcher will be part of a team together with the PI and two PhD students. Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the development of the project. Taking part in teaching a graduate seminar course (in proof complexity or neighbouring areas) is encouraged but not required. Travel funding is included, and the group also expects to continue receiving short-term and long-term visitors on a regular basis.
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 2012, although this is to some extent negotiable.
Form of employment:
One year temporary position with a possible one-year extension
Applicants should have or be about to receive a PhD degree in a subject relevant for the research area, such as Computer Science or Mathematics (preferably focused on proof complexity or neighbouring areas), and should have a passionate interest in research.
The successful candidate is expected to have a solid background in Theoretical Computer Science (computational complexity) and Mathematics (in areas such as combinatorics, algebra and/or geometry). Exceptional candidates are always of interest regardless of formal prerequisites. Problem solving skills and creativity are a must.
The working language of the TCS group is English, and knowledge of English is also fully sufficient to navigate life in Sweden in general.
Application deadline: January 31, 2012
Applications should be sent via email to firstname.lastname@example.org. Write the reference number in the email subject. The application and all attachments should be sent as PDF files.
To receive full consideration, the application should be received by January 31, 2012. Applications will be reviewed until the position has been filled.
The application should include the following documents:
We are currently gathering information to help improve our recruitment process. We would therefore be very grateful if you could include an answer to the following question in your application: Where did you initially come across this job advertisement? (To which the answer is, if you are reading this: on the project leader's webpages, or on whatever page linked to here.)
For enquiries about employment conditions please contact:
For enquiries about the project please contact:
David Spangenberg, SACO
Niclas Carlsson, ST
Per-Ove Öster, LO/SEKO