Positions

The Johann Wolfgang Goethe-University Frankfurt, Department of Computer Science and Mathematics, invites applications to fill the position of a Professorship (W2, Tenure Track) for Theoretical Computer Science within the Institute of Computer Science. We are seeking a candidate widely recognized for excellent research in at least one of the research areas Algorithms, Complexity Theory, or

Applications are invited for postdoctoral research fellowships and for PhD scholarships in the Mathematics Department of the London School of Economics and Political Science. The positions are funded by the European Research Council (ERC) Starting Grant “Scaling Methods for Discrete and Continuous Optimization” held by László Végh. The project focuses on problems and methods on

PhD position in Algorithms at the University of Bergen is available. Application deadline Nov 15, 2017. https://www.jobbnorge.no/en/available-jobs/job/143360/phd-position-in-multivariate-algorithms

The Department of Mathematics at LSE seeks to appoint an Assistant Professor. For this post, we are particularly interested in candidates with expertise in a subject area related to the Mathematics of Operations Research. The successful candidate will have an established track record or trajectory of research at a level of international excellence, will be

A research position in algorithms and complexity at the University of Oxford, with a start date as soon as possible and an end date on 28 Feb 2019. Professor Leslie Ann Goldberg is looking for an additional postdoctoral researcher to join the ERC project “Mapping the Complexity of Counting” at the University of Oxford. This

The Algorithms and Complexity Group of IDSIA, University of Lugano (Switzerland), opens one PostDoc position in approximation algorithms. This position is supported by the Swiss National Foundation Grant “Approximation Algorithms for Network Problems”. The appointment is for one year, with tentative starting date on 1st November 2017. The gross salary is roughly 80.000 CHF per

The Algorithms and Complexity group of IRIF – previously LIAFA – (CNRS and University ParisDiderot), and Paris, France, is seeking excellent candidates for one or more postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, streaming algorithms, approximation algorithms, online algorithms, communication complexity, cryptography (including post-quantum cryptography),

Postdoc position available in Algorithms in Germany and Chile A joint postdoctoral fellowship will be available at MPII (Saarbruecken) and Universidad de Chile (Santiago) starting in August 2016, viagra or by mutual agreement at any date thereafter. The position is funded by the MPII-UChile collaborative grant “Fast algorithms for Massive Data Set”, ailment therefore we

The Algorithms and Complexity group of IRIF – previously LIAFA – (CNRS and University Paris Diderot), viagra Paris, physician France, is seeking excellent candidates for one or more postdoctoral positions. The financing of this position is provided by the ANR grant RDAM joint to that group and the Talgo team of the Computer Science Department

Note: Note that strong applicants in algorithmics and TCS in general are encouraged to apply, even though the call mentions other areas explicitly. One position is earmarked for Software Engineering, which does not rule out some TCS-related research. ——————————– The School of Computer Science at Reykjavik University invites applications for several full-time faculty positions. We