for a postdoctoral position in Theoretical Computer Science.
KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. 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 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 (http://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 http://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). 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.
The application deadline is May 5, 2013, but candidates are encouraged to
apply right away since applications are reviewed on a continuous basis.
More information and instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0315-Eng.php. Informal
enquiries are welcome and may be sent to Jakob Nordstrom.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
