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 is a five-year project from 1 Mar 2014 to 28 Feb 2019. After the new appointment, we will have four postdocs in all.
The salary range is GBP 31,076 – 38,183 per year, depending on experience.
Deadline for applications noon 19 July Interviews (skype) 2 August
Details and application form at http://www.cs.ox.ac.uk/news/1329-full.html
Any questions? email@example.com
The project is about figuring out the complexity of computational counting problems, which includes
complexity theory, phase transitions, dichotomy theorems, mixing rates of stochastic processes, etc.
Candidates should have a PhD in algorithms and complexity or in a closely related area of discrete mathematics.
Expertise in one or more of the following would be helpful: combinatorics or discrete
probability, graph polynomials or partition functions, mixing
rates of Markov chains, constraint satisfaction problems including algebraic methods
for classifying their difficulty, holographic algorithms or holant problems.