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 March 2014 to 28 February 2019. After the new appointment, we will have four postdocs in all. See http://www.cs.ox.ac.uk/people/leslieann.goldberg/mcc.html.
The salary range is GBP 31,076 - 38,183 per year, depending on experience.
Deadline for applications noon 19 July, 2017.
Interviews (skype) 2 August.
Details and application form at http://www.cs.ox.ac.uk/news/1329-full.html.
Any questions? leslie.goldberg@cs.ox.ac.uk<mailto:leslie.goldberg@cs.ox.ac.uk>
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.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
