I am interested combinatorics, computational complexity and stochastic processes. All of these ingredients come together in the study of randomised algorithms: computational procedures that exploit the surprising power
of making random choices. A strong theme in this work is the analysis of the mixing time of combinatorially or geometrically defined Markov chains. More generally, I work on the computational complexity of counting problems, including weighted counted problems as exemplified by partition functions and generating functions. Statistical physics, Constraint Satisfaction Problems and graph polynomials provide a rich source of motivating examples.
Some publications are available
online.
Or, for a more nearly complete listing of publications, click
here.
(This listing is generated in real time by
MathSciNet.)
This page is maintained by Mark Jerrum.
The views and opinions expressed in these pages are mine.
The contents of these pages have not been reviewed or approved by
Queen Mary, University of London.