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
See more...
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. |
| Goldberg LA, Jerrum M. (2019) Approximating Pairwise Correlations in the Ising Model Acm Transactions On Computation Theory. 11: 23 |
| Guo H, Jerrum M, Liu J. (2019) Uniform Sampling Through the Lovász Local Lemma Journal of the Acm. 66: 18 |
| Guo H, Jerrum M. (2019) A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability Siam Journal On Computing. 48: 964-978 |
| Galanis A, Goldberg LA, Jerrum M. (2017) A Complexity Trichotomy for Approximately Counting List H -Colorings Acm Transactions On Computation Theory. 9: 9 |
| Bulatov A, Goldberg LA, Jerrum M, et al. (2017) Functional clones and expressibility of partition functions Theoretical Computer Science. 687: 11-39 |
| Jerrum M, Meeks K. (2017) The parameterised complexity of counting even and odd induced subgraphs Combinatorica. 37: 965-990 |
| 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 |
| Galanis A, Goldberg LA, Jerrum M. (2016) Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard Siam Journal On Computing. 45: 680-711 |
| Faben JD, Jerrum M. (2015) The Complexity of Parity Graph Homomorphism: An Initial Investigation Theory of Computing. 11: 35-57 |
| Jerrum M, Meeks K. (2015) Some hard families of parameterized counting problems Acm Transactions On Computation Theory. 7 |