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 practical side, some interesting problems are to gain a better understanding of the performance of current state-of-the-art SAT solvers - in particular, solvers using conflict-driven clause learning (CDCL) - and to explore techniques that would go beyond CDCL, such as approaches based on algebraic or geometric reasoning.
These are full-time employed positions for one year with a possible one-year extension. The expected start date is 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-0823-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
