The Full Wiki

More info on Mark Jerrum

Mark Jerrum: Map


Wikipedia article:

Map showing all locations mentioned on Wikipedia article:

Mark Richard Jerrum is a Britishmarker computer scientist and computational theorist.

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 Londonmarker.

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.


  1. AMS genealogy project
  2. Queen Mary personnel page
  3. 1996 Gödel Prize citation
  4. 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. Link to article

External links

Embed code:

Got something to say? Make a comment.
Your name
Your email address