Biography:Mark Jerrum
Mark Richard Jerrum (born 1955) is a British computer scientist and computational theorist.
Jerrum received his Ph.D. in computer science 'On the complexity of evaluating multivariate polynomials'[1] in 1981 from University of Edinburgh under the supervision of Leslie Valiant.[2] He is professor of pure mathematics at Queen Mary, University of London.[3]
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.[4] 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.[5]
References
- ↑ Mark, Jerrum (1981) (in en). On the complexity of evaluating multivariate polynomials.
- ↑ Mark Jerrum at the Mathematics Genealogy Project
- ↑ Personnel page, Queen Mary, University of London.
- ↑ Gödel Prize citation , 1996.
- ↑ 2006 Fulkerson Prize citation, Notices of the AMS, December 2006, volume 53, number 11.
Select publications
- Frieze, A., Jerrum, M., Molloy M., Robinson, R., & Wormald, N. (1996). Generating and counting Hamilton cycles in random regular graphs. Journal of Algorithms, 21, 176–198.
External links
- Mark Jerrum home page at Queen Mary, University of London
- List of publications from Microsoft Academic
 |  |
