Logic List Mailing Archive

PhD student position on algorithms for SAT solving, Stockholm (Sweden), Deadline: 31 Oct 2018

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-2101-Eng.php by the deadline 
October 31, 2018, but candidates will be reviewed continuously and early 
applications are strongly encouraged.

This is a position within 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 would ideally start 
sometime as early as possible in 2019, though this is negotiable. The 
position is fully funded and comes with a competitive salary.

See http://www.csc.kth.se/~jakobn/openings/J-2018-2101-Eng.php for the 
full announcement with more information and instructions how to apply. 
Informal enquiries are welcome and may be sent to jakobn@kth.se .


--
[LOGIC] mailing list
http://www.dvmlg.de/mailingliste.html
Archive: http://www.illc.uva.nl/LogicList/

provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam