A 2-year postdoc position in algorithms and complexity is available with Rahul Santhanam at the University of Oxford. Applicants must have a PhD in theoretical computer science or mathematics, with experience in complexity theory and/or parameterized algorithms and exact algorithms for NP-hard problems.
Webpage: http://www.cs.ox.ac.uk/news/1104-full.html
Email: rahul.santhanam@cs.ox.ac.uk
The CS department at TU Dortmund searches for a junior professor in algorithms theory.
The position is initially for three years with the possibility of extension for another
three years after a positive evaluation. There is no tenure or tenure track option. The
candidate must be fluent in German or English. Official announcement (in German; apologies) see below.
Email: christian.sohler@tu-dortmund.de
If you you work in the area of Algorithms or Lower Bounds and have published several papers in SODA, STOC or FOCS, we have a great postdoc position for you. See http://u.cs.biu.ac.il/~porately/positions/postdoc.html
Webpage: http://u.cs.biu.ac.il/~porately/positions/postdoc.html
Email: datalabrecruit@gmail.com
Several postdoctoral research positions are available in the research group of Prof. Ely Porat at Bar Ilan University. Applicants are expected to have a PhD in computer science, mathematics, or a related field, and have a strong record of research in algorithms and data structures, combinatorics, or optimization.
The research group focuses on streaming algorithms (with an emphasis on pattern m
Email: datalabrecruit@gmail.com
Outstanding candidates are sought to be part of the Warwick involvement in the newly created Alan Turing Institute (ATI), of which Warwick is a founding partner (with Cambridge, Edinburgh, Oxford and UCL).
This is an opportunity to join one or more of the world’s most prominent and most research-active departments in the Mathematical Sciences and to be part of the ATI.
Webpage: http://www2.warwick.ac.uk/fac/sci/dcs/news/?newsItem=094d434552f8f06e0152f961109706da
Email: S.A.Jarvis@warwick.ac.uk
Start fall 2016, tenure-track, preference for theory. Review of applicants is ongoing until the position is filled.
Webpage: http://cs.indstate.edu/info/positions.html
Email: cs-search@cs.indstate.edu
A research associate position is available at the University of New South Wales.
You will join the UNSW Algorithms group and conduct research with Serge Gaspers in the areas of exact algorithms, parameterized complexity, approximation algorithms, computational social choice, and/or algorithmic game theory.
Webpage: http://www.cse.unsw.edu.au/~sergeg/PostdocPosition2016.html
Email: sergeg@cse.unsw.edu.au
A research associate position is available at the University of New South Wales.
You will join the UNSW Algorithms group and conduct research with Serge Gaspers in the areas of exact algorithms, parameterized complexity, approximation algorithms, computational social choice, and/or algorithmic game theory.
Webpage: http://www.cse.unsw.edu.au/~sergeg/PostdocPosition2016.html
Email: sergeg@cse.unsw.edu.au
The UCSD theory group is looking for strong applicants for post-doctoral positions. The positions are for one academic year, with a start date of October 2016.
After the first year, it may be possible to continue the post-doctoral positions for a 2nd year, contingent on approval by the theory faculty and on available funding.
Webpage: http://cacc.ucsd.edu/postdoc_application.html
Email: shachar.lovett@gmail.com
The Theory Group in the Department of Computing Science at University of Alberta
invites applications for a postdoctoral fellowship position to start in Fall of 2016 (or until it is filled).
The applicant is expected to work closely Zachary Friggstad and Mohammad Salavatipour
in the areas of: approximation algorithms, hardness of approximation, combinatorial optimization, and randomized met
Webpage: http://https://webdocs.cs.ualberta.ca/~zacharyf/pdf-ad-2016.pdf
Email: zacharyf@ualberta.ca
Theoretical Computer Science Jobs 