Logic List Mailing Archive

Postdoctoral Researcher in Complexity Theory and Algorithms, Liverpool (U.K.), Deadline: 10 July 2008

Postdoctoral Researcher

29,138 pa

Complexity Theory and Algorithms Group
Department of Computer Science
University of Liverpool

Ref: R-567080/WWW

Closing date for receipt of applications: 10 July 2008

To join an EPSRC funded project, "Markov Chain Algorithms for Sampling
Stable Matchings, Tilings, and Euler tours".

The focus of this grant is applications of, and development of
techniques for, the Markov Chain Monte Carlo method for investigating
various combinatorial structures.

You should have (or be about to obtain) a PhD in Computer Science,
Mathematics, or related discipline, and knowledge of algorithms,
discrete mathematics, and/or probability theory, in particular,
randomised algorithms and combinatorics. Programming skills would be
advantageous. The post is available for 2 years.

Further information, including application procedure available at:

     www.liv.ac.uk/working/job_vacancies/research/R-567080.htm