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

Advertisements
Postdoc at Johns Hopkins University (apply by May 26, 2017)

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

Professor/Assistant Professor at Department of Computer Science, University of Warwick (apply by April 19, 2017)

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

Faculty Position at University of Oxford (apply by 5 May 2017)

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)

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

Post-doc Position – Algorithms on Tempor at Durham University, UK (apply by 21 April 2017 (Midday, UK time)

PhD positions computational complexity at KTH Royal Institute of Technology (apply by March 31, 2017)

The TCS Group at KTH Royal Institute of Technology invites applications for up to four PhD positions in computational complexity theory. The application deadline is March 31, 2017. See http://apc.csc.kth.se/D-2017-0117-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to apc@csc.kth.se .

Webpage: http://apc.csc.kth.se/D-2017-0117-Eng.php

Email: apc@csc.kth.se

PhD positions computational complexity at KTH Royal Institute of Technology (apply by March 31, 2017)