Items where authors include "Jerrum, M"
Up a levelArticle
Dyer, M orcid.org/0000-0002-2018-0374, Jerrum, M, Müller, H orcid.org/0000-0002-1123-1774 et al. (1 more author) (2021) Counting Weighted Independent Sets beyond the Permanent. SIAM Journal on Discrete Mathematics, 35 (2). pp. 1503-1524. ISSN 0895-4801
Dyer, M orcid.org/0000-0002-2018-0374, Heinrich, M, Jerrum, M et al. (1 more author) (2021) Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Combinatorics, Probability and Computing, abs/2005.07944. ISSN 0963-5483
Dyer, ME orcid.org/0000-0002-2018-0374, Galanis, A, Goldberg, LA et al. (2 more authors) (2020) Random Walks on Small World Networks. ACM Transactions on Algorithms, 16 (3). 37. ISSN 1549-6325
Dyer, M, Jerrum, M and Muller, H (2017) On the switch Markov chain for perfect matchings. Journal of the ACM, 64 (2). 12. ISSN 0004-5411
Chen, X, Dyer, M orcid.org/0000-0002-2018-0374, Goldberg, LA et al. (4 more authors) (2015) The complexity of approximating conservative counting CSPs. Journal of Computer and System Sciences, 81 (1). pp. 311-329. ISSN 0022-0000
Bulaov, AA, Dyer, M, Goldberg, LA et al. (2 more authors) (2013) The Expressibility of Functions on the Boolean Domain, with Applications to Counting CSPs. Journal of the ACM, 60 (5). 32. ISSN 1535-9921
Proceedings Paper
Chen, X, Dyer, M, Goldberg, LA et al. (4 more authors) (2013) The complexity of approximating conservative counting CSPs. In: Portier, N and Wilke, T, (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), 27 Feb - 02 Mar 2013, Kiel, Germany. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, Dagstuhl Publishing , pp. 148-159.
Bulatov, AA, Dyer, ME, Goldberg, LA et al. (1 more author) (2012) Log-supermodular functions, functional clones and counting CSPs. In: Dürr, C and Wilke, T, (eds.) 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Symposium on Theoretical Aspects of Computer Science (STACS), 29 Feb - 03 Mar 2012, Paris, France. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 302 - 313. ISBN 978-3-939897-35-4