The TCS Group at KTH 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. See http://www.csc.kth.se/~jakobn/openings/J-2018-0940-Eng.php for more information. Informal enquiries are welcome and may be sent to firstname.lastname@example.org .
A postdoc position on the complexity of CSPs is available at Oxford, supported by Standa Zivny’s ERC grant. The goal of the project is to study tractability (in a broad sense) of CSPs and convex relaxations. An ideal candidate would have a strong background in universal algebra and/or approximation algorithms/relaxations.
The eScience Centre is now expanding its staff in all its core areas and is therefore looking to recruit senior experts in core fields who can successfully engage and facilitate teams of software/hardware developers and, together with the management of the centre, set the strategic direction for the development of the centre, both its services and its infrastructure.
The Copenhagen Center for Health Technology (CACHET) is looking for an experienced software architect to be responsible for the technological design and development in the center. You will have a central role in managing the software infrastructure and technical aspects of the center’s activities.