Use this form to post an ad on cstheory-jobs.org. If something is not clear, see an example. Ads should be for academic positions such as faculty, postdocs, teaching fellows, or researchers in universities or research labs. This website is maintained by the Committee for the Advancement of Theoretical Computer Science (CATCS).
The Department of Computer Science at the University of Warwick, UK, invites applications for multiple tenure-track positions on Assistant Professor level. The call is open to candidates working in all areas of Computer Science including those working in Theory.
The Computer Engineering group at Bar-Ilan University has an opening for a postdoctoral researcher in the fields of coding theory, communication systems and distributed computations. The position is for one or two years and should ideally start by October 2018, yet the starting date is flexible.
Department of Computer Science, University of Copenhagen is offering Postdoctoral Fellowships in algorithms expected to commence 1 October 2018 or as soon as possible thereafter. The applications deadline is 1 July 2018. Please find the full announcement at http://barc.ku.dk/about/#career
The Wallenberg AI, Autonomous Systems and Software Program (WASP) announces 18 PhD positions at 7 Swedish universities focusing on the mathematical foundations of artificial intelligence. Deadlines range from May 10 to May 24. See http://wasp-sweden.org/phd-positions-ai-math/ for links to the individual announcements with instructions how to apply.
We invite applications for a postdoc position hosted by Hsin-Hao Su at Boston College. Areas of specific interests include but not limited to distributed graph algorithms, local algorithms, dynamic graph algorithms, gossip algorithms, and bio-inspired algorithms. The position is expected to start after September 1, 2018, with a flexible starting date. The position is for a period of up to 2 years.
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 email@example.com .
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.