| 2018 | ICALP | A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. | Heng Guo, Mark Jerrum |
| 2018 | ICALP | Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. | Heng Guo, Mark Jerrum |
| 2017 | SODA | Random cluster dynamics for the Ising model is rapidly mixing. | Heng Guo, Mark Jerrum |
| 2017 | STOC | Uniform sampling through the Lovasz local lemma. | Heng Guo, Mark Jerrum, Jingcheng Liu |
| 2016 | ICALP | A Complexity Trichotomy for Approximately Counting List H-Colourings. | Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum |
| 2016 | SODA | On the switch Markov chain for perfect matchings. | Martin E. Dyer, Mark Jerrum, Haiko Mller |
| 2015 | ICALP | Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. | Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum |
| 2013 | STACS | The complexity of approximating conservative counting CSPs. | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby |
| 2012 | ICALP | The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). | Leslie Ann Goldberg, Mark Jerrum |
| 2012 | STACS | Log-supermodular functions, functional clones and counting CSPs. | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
| 2011 | ICALP | A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. | Leslie Ann Goldberg, Mark Jerrum |
| 2010 | ICALP | Approximating the Partition Function of the Ferromagnetic Potts Model. | Leslie Ann Goldberg, Mark Jerrum |
| 2009 | STACS | A Complexity Dichotomy for Partition Functions with Mixed Signs. | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
| 2007 | STOC | Inapproximability of the Tutte polynomial. | Leslie Ann Goldberg, Mark Jerrum |
| 2002 | FOCS | Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. | Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin |
| 2002 | FOCS | Spectral Gap and log-Sobolev Constant for Balanced Matroids. | Mark Jerrum, Jung-Bae Son |
| 2001 | STOC | A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. | Mark Jerrum, Alistair Sinclair, Eric Vigoda |
| 2000 | ICALP | A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. | Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson |
| 2000 | SODA | An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher |
| 1999 | FOCS | On Counting Independent Sets in Sparse Graphs. | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
| 1999 | ICALP | Bisimulation Equivanlence Is Decidable for Normed Process Algebra. | Yoram Hirshfeld, Mark Jerrum |
| 1997 | SODA | Randomly Sampling Molecules. | Leslie Ann Goldberg, Mark Jerrum |
| 1997 | STOC | The Swendsen-Wang Process Does Not Always Mix Rapidly. | Vivek Gore, Mark Jerrum |
| 1996 | FOCS | Learning Linear Transformations. | Alan M. Frieze, Mark Jerrum, Ravi Kannan |
| 1995 | IPCO | Improved Approximation Algorithms for MAX | Alan M. Frieze, Mark Jerrum |
| 1994 | FOCS | A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes | Yoram Hirshfeld, Mark Jerrum, Faron Moller |
| 1994 | SODA | Approximately Counting Hamilton Cycles in Dense Graphs. | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
| 1994 | SPAA | An W(log log n) Lower Bound for Routing in Optical Networks. | Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie |
| 1993 | COLT | Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. | Paul Goldberg, Mark Jerrum |
| 1993 | FOCS | Simulated Annealing for Graph Bisection | Mark Jerrum, Gregory B. Sorkin |
| 1993 | IPCO | An analysis of a Monte Carlo algorithm for estimating the permanent. | Mark Jerrum |
| 1993 | SPAA | A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. | Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao |
| 1992 | FOCS | A Mildly Exponential Approximation Algorithm for the Permanent | Mark Jerrum, Umesh V. Vazirani |
| 1990 | ICALP | Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). | Mark Jerrum, Alistair Sinclair |
| 1988 | STOC | Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) | Mark Jerrum, Alistair Sinclair |
| 1987 | WG | Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. | Alistair Sinclair, Mark Jerrum |
| 1985 | ICALP | Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract). | Mark Jerrum |
| 1984 | ICALP | The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract). | Mark Jerrum |
| 1982 | FOCS | A Compact Representation for Permutation Groups | Mark Jerrum |