Name Mark Jerrum Role Author | ||
 | ||
Books Counting, Sampling and Integrating: Algorithms and Complexity | ||
Education University of Edinburgh | ||
The Computational Complexity of Counting List H-Colourings, and Related Problems
Mark Richard Jerrum (born 1955) is a British computer scientist and computational theorist.
Contents
- The Computational Complexity of Counting List H Colourings and Related Problems
- Select publications
- References
Jerrum received his Ph.D. in computer science in 1981 from University of Edinburgh under the supervision of Leslie Valiant. He is professor of pure mathematics at Queen Mary, University of London.
With his student Alistair Sinclair, Jerrum investigated the mixing behaviour of Markov chains to construct approximation algorithms for counting problems such as the computing the permanent, with applications in diverse fields such as matching algorithms, geometric algorithms, mathematical programming, statistics, physics-inspired applications, and dynamical systems. This work has been highly influential in theoretical computer science and was recognised with the Gödel Prize in 1996. A refinement of these methods led to a fully polynomial-time randomised approximation algorithm for computing the permanent, for which Jerrum and his co-authors received the Fulkerson Prize in 2006.