The position below is no longer open. 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.
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.
The School of Computer Science and Communication (KTH CSC) 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, see www.kth.se/en/csc.
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.
This position is funded by the research project "Understanding the Hardness of Theorem Proving" in the area of proof complexity with connections to SAT solving, and much of the activities of the research group revolve around these themes. However, proof complexity has also turned out to have deep, and sometimes surprising, connections to other areas such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore researchers in these or other related areas are also of interest.
The project is led by Jakob Nordström (www.csc.kth.se/~jakobn) and is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. A more detailed description of the project can be found at www.csc.kth.se/~jakobn/project-proofcplx.
The group currently consists of one postdoctoral researcher and two PhD students (in addition to the project leader). 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 graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives 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 at the latest in August-September 2013, 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, and should have a passionate interest in research. Exceptional candidates are always of interest regardless of formal prerequisites. Problem solving skills and creativity are a must.
The successful candidate is expected to have a solid background in Theoretical Computer Science (in computational complexity and/or algorithms) and Mathematics (in areas such as combinatorics, algebra and/or geometry), as witnessed by a strong publication record in conferences such as STOC, FOCS, CCC, ICALP, SODA, SAT, IJCAI, or similar, or in journals of a comparable quality.
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: Sunday May 5, 2013
Applications should be sent via email to firstname.lastname@example.org. Write the reference number in the subject line. The application and all attachments should be sent as PDF files.
To receive full consideration, the application should be received by May 1, 2013. 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