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).
A fully-funded PhD position is available in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark (DTU Compute) as part of the Horizon 2020 TEAM (Technology EnAbled Mental health for young people) European Training Network (ETN).
The Center for Computation and Technology of LSU is looking for a Postdoc in the field of Combinatorial Optimization.
Topic: approximation algorithms for automated data tiling in high-performance computing environments. Project: Phylanx: A Distributed Array Toolkit.
Required: A PhD in CS or Math with a focus on Combinatorial Optimization, Algorithms.
Center for Algorithms and Machine Learning (http://caml.indiana.edu) at Indiana University invites applications for a postdoctoral position starting Fall’18. Position is initially for one year with a possibility for a renewal for an additional year. CAML postdoctoral researcher will be based in the new Luddy Hall building and will receive a competitive salary and a comprehensive set of benefits.
The ISTplus postdoctoral program is set up for exceptional researchers, and is partially funded by the European Union. The program provides fellows with an international and interdisciplinary research environment. Funding is usually provided for two years although extensions are possible.
Two one-year postdoctoral positions are available at UMONS, Belgium. Candidates should have a strong background in at least one of the following fields: formal methods, game theory, theoretical computer science, machine learning, control theory. Experience with practical applications and interaction with industry is also welcome (but not mandatory).
Copenhagen University is offering a Postdoctoral Fellowship in algorithms, expected to commence 1 August 2018 or as soon as possible thereafter. The length of the position is 2 years with possible extensions until end of 2021. The project focuses on algorithms theory for graph problems such as shortest paths, max flow, and minimum spanning trees in static and dynamic graphs.
The Theory of Combinatorial Algorithms Group within the Department of
Computer Science at ETH Zurich, Switzerland, invites applications for PhD positions. The thesis projects are supervised by Bernd Gärtner, Michael Hoffmann and Emo Welzl.