Postdoc in algorithms and complexity at Oxford with Leslie Ann Goldberg.
Applicant will join the project: http://www.cs.ox.ac.uk/people/leslieann.goldberg/mcc.html
Email: leslie.goldberg@cs.ox.ac.uk
Postdoc at EPFL (apply by June 9, 2017 (soft))
The theory group at EPFL invites applications for a postdoctoral position hosted by Ola Svensson. An ideal candidate should have a strong research track-record and willingness to work on important challenges in theoretical computer science. The position comes with a competitive salary and generous support for scientific travel.
Webpage: http://theory.epfl.ch/osven/postdoc.html
Email: ola + “dot” + svensson at epfl.ch
Postdoc at UC San Diego (apply by soon)
UCSD announces an exciting new initiative, the Data Science Postdoctoral Fellowship. We are looking for excellent self-motivated candidates in any field related to data science.
Webpage: http://datascience.ucsd.edu/
Tenure-track Assistant Professor in Algo at Department of Computer Science, University of Copenhagen (apply by 30 May 2017)
Tenure-track assistant Professor in Algorithms and Optimisation Department of Computer Science Faculty of Science
University of Copenhagen
Application deadline: 30 May 2017
Employment start: 1 November 2017
Webpage: http:////employment.ku.dk/all-vacancies/?show=896124
Email: mads@diku.dk
postdoc in algorithms Bergen at University of Bergen, Norway (apply by June 1, 2017)
One year research position at a postdoctoral level (with a possible one year extension) is available at Algorithms research group (http://www.uib.no/rg/algo/), University of Bergen, Norway.
The successful candidate will work on “Multivariate Algorithms: New domains and paradigms” project funded by the Norwegian Research Council and led by Fedor Fomin. The objective of the project is t
Webpage: http://dmatheorynet.blogspot.no/2017/04/dmanet-postdoc-in-algorithms-bergen.html
Email: fomin@ii.uib.no
Postdoc at Johns Hopkins University (apply by May 26, 2017)
A one year postdoc position is available starting Summer/Fall 2017, with starting date negotiable and a possible extension to a second year. Applicants should be recent Ph.D.’s with interest in theoretical computer science. Research areas include but are not limited to pseudorandomness, complexity theory, and cryptogrpahy. The postdoc will also be able to take advantage of possible collaboration
Webpage: http://www.cs.jhu.edu/~lixints/postdoc.html
Email: lixints@cs.jhu.edu
Professor/Assistant Professor at Department of Computer Science, University of Warwick (apply by April 19, 2017)
Multiple positions as Assistant Professor or Full Professor; the call is open to candidates working in all areas of Computer Science including those working in Theory.
Webpage: http://http://www2.warwick.ac.uk/fac/cross_fac/dimap/
Email: G.Cormode@warwick.ac.uk
Faculty Position at University of Oxford (apply by 5 May 2017)
Associate Professor (or Professor) of Algorithms and Complexity Theory, to be held in the Department of Computer Science with effect from 1 Oct 2017. The successful candidate will also be appointed as Fellow and Tutor in Computer Science at Hertford College.
Webpage: http://www.cs.ox.ac.uk/news/1283-full.html
Email: rahul.santhanam@cs.ox.ac.uk
Post-doc Position – Algorithms on Tempor at Durham University, UK (apply by 21 April 2017 (Midday, UK time)
A 3-year Post-Doctoral Researcher is sought with expertise in graph algorithms and complexity, preferably also in parameterized algorithms and/or approximation algorithms. The research in this grant “Algorithmic Aspects of Temporal Graphs” will investigate various optimization problems on temporal (i.e. dynamically changing) graphs and explore the computational complexity of these new problems
Webpage: http://www.jobs.ac.uk/job/AXW261/post-doctoral-research-associate/
Email: george.mertzios@durham.ac.uk
Post-doc Position – Algorithms on Tempor at Durham University, UK (apply by 21 April 2017 (Midday, UK time)
A 3-year Post-Doctoral Research Associate is sought, with expertise in graph algorithms and complexity, preferably also in parameterized algorithms and/or approximation algorithms. The successful candidate will work at Durham University under the guidance of Dr. George Mertzios on the EPSRC-funded grant “Algorithmic Aspects of Temporal Graphs”. The research in this grant will investigate vario
Webpage: http://www.jobs.ac.uk/job/AXW261/post-doctoral-research-associate/
Email: george.mertzios@durham.ac.uk
Theoretical Computer Science Jobs 