Mark Richard Jerrum

Affiliations: 
1988 University of Edinburgh, Edinburgh, Scotland, United Kingdom 
Google:
"Mark Jerrum"

Parents

Sign in to add mentor
Leslie G. Valiant grad student 1981 Edinburgh
 (On the Complexity of Evaluating Multivariate Polynomials)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Dyer M, Jerrum M, Miiller H. (2016) On the switch Markov chain for perfect matchings Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 3: 1972-1983
Goldberg LA, Jerrum M. (2015) A complexity classification of spin systems with an external field. Proceedings of the National Academy of Sciences of the United States of America. 112: 13161-6
Jerrum M, Meeks K. (2015) Some hard families of parameterized counting problems Acm Transactions On Computation Theory. 7
Goldberg LA, Jerrum M. (2015) The complexity of counting locally maximal satisfying assignments of Boolean CSPs Theoretical Computer Science
Jerrum M, Meeks K. (2015) The parameterised complexity of counting connected subgraphs and graph motifs Journal of Computer and System Sciences. 81: 702-716
Goldberg LA, Jerrum M, McQuillan C. (2015) Approximating the partition function of planar two-state spin systems Journal of Computer and System Sciences. 81: 330-358
Chen X, Dyer M, Goldberg LA, et al. (2015) The complexity of approximating conservative counting CSPs Journal of Computer and System Sciences. 81: 311-329
Galanis A, Goldberg LA, Jerrum M. (2015) Approximately counting h-colourings is #bis-hard Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9134: 529-541
Cai JY, Galanis A, Goldberg LA, et al. (2014) BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region Leibniz International Proceedings in Informatics, Lipics. 28: 582-595
Goldberg LA, Jerrum M. (2014) The complexity of approximately counting tree homomorphisms Acm Transactions On Computation Theory. 6
See more...