Saturday, April 21, 2018

[DMANET] PhD position in SAT solving at KTH Royal Institute of Technology

The TCS Group at KTH Royal Institute of Technology invites applications for a PhD position in CS focusing on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms. To receive full consideration your application should be submitted via http://www.csc.kth.se/~jakobn/openings/J-2018-0940-Eng.php by the deadline May 15, 2018, but candidates will be reviewed continuously and early applications are encouraged.

This is a position within the AI-Math Graduate School of the Wallenberg Artificial Intelligence, Autonomous Systems and Software Program WASP (http://wasp-sweden.org/), Sweden's largest ever individual research program and a major national initiative for strategically motivated basic research, education and faculty recruitment. The PhD student will be part of the WASP AI-Math Graduate School, providing a valuable network with other researchers within WASP and presenting unique opportunities for students who are dedicated to achieving international research excellence with industrial relevance.

The TCS Group (http://www.kth.se/tcs) at KTH offers a strong research environment spanning a wide range of research topics such as theory of computation, computer and network security, cryptography, software engineering, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The PhD student will be working in the research group of Jakob Nordstrom (http://www.csc.kth.se/~jakobn/), which currently consists of 4 postdoctoral researchers and 4 PhD students in addition to the PI. There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is an excellent opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.

This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidate is expected to start at the latest in August-September 2018, although this is to some extent negotiable. The position is fully funded and comes with a competitive salary.

************************************************************ 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/***********************************************************