Mark Richard Jerrum
Born1955 (age 70–71)
Alma materUniversity of Edinburgh
Known forMarkov chain Monte Carlo methods, approximation algorithms
AwardsGödel Prize (1996), Fulkerson Prize (2006)
Scientific career
FieldsComputer Science, Computational Theory

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

edit
  1. ^ Mark, Jerrum (1981). On the complexity of evaluating multivariate polynomials (Thesis). hdl:1842/12296.
  2. ^ Mark Jerrum at the Mathematics Genealogy Project
  3. ^ Personnel page, Queen Mary, University of London.
  4. ^ Gödel Prize citation Archived 12 February 2017 at the Wayback Machine, 1996.
  5. ^ 2006 Fulkerson Prize citation, Notices of the AMS, December 2006, volume 53, number 11.

Select publications

edit
edit


📚 Artikel Terkait di Wikipedia

Mark (given name)

philosopher Mark Frigo, American economist Mark Z. Jacobson (born 1965), American civil and environmental engineer Mark Jerrum (born 1955), British computer scientist

Fulkerson Prize

Agrawal, Neeraj Kayal and Nitin Saxena, for the AKS primality test. Mark Jerrum, Alistair Sinclair and Eric Vigoda, for approximating the permanent.

Gödel Prize

doi:10.1007/BF00299636, hdl:10338.dmlcz/120489, S2CID 10838178 Sinclair, A.; Jerrum, M. (1989), "Approximate counting, uniform generation and rapidly mixing

Alistair Sinclair

science from the University of Edinburgh in 1988 under the supervision of Mark Jerrum. He is professor at the Computer Science division at the University of

List of International Congresses of Mathematicians Plenary and Invited Speakers

Michael Jerome Hopkins Deborah Hughes Hallett Uwe Jannsen David Jerison Mark Jerrum Jeffry Kahn Gil Kalai Nikolaos Kapouleas Joseph B. Keller Eugene Khruslov [ru]

Lars Rasmussen (software developer)

University of Edinburgh in 1992. Rasmussen began his PhD, working with Mark Jerrum and Alistair Sinclair in the Laboratory for Foundations of Computer Science

Conductance (graph theory)

to the conductance of a graph. The conductance was first defined by Mark Jerrum and Alistair Sinclair in 1988 to prove that the permanent of a matrix

List of University of Edinburgh people

Biorobotics Laboratory at EPFL Mark Jerrum, Professor of Pure mathematics at the University of London, Gödel Prize Laureate Mark H. Johnson, cognitive neuroscientist