Publications

# Publications :: Search

## Show author

 Select a publication Show Title Venue Rating Date Conference paper Heng Guo 0001, Mark Jerrum. Random cluster dynamics for the Ising model is rapidly mixing. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017 Book chapter Mark Jerrum. Counting Constraint Satisfaction Problems. The Constraint Satisfaction Problem: Complexity and Approximability 2017, Volume 7 (0) 2017 Conference paper Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum. A Complexity Trichotomy for Approximately Counting List TOCT 2016, Volume 9 (0) 2017 Conference paper Martin E. Dyer, Mark Jerrum, Haiko Müller. On the Switch Markov Chain for Perfect Matchings. J. ACM 2017, Volume 64 (0) 2017 Journal article Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivny. Functional clones and expressibility of partition functions. Theor. Comput. Sci. 2017, Volume 687 (0) 2017 Conference paper Heng Guo 0001, Mark Jerrum, Jingcheng Liu 0001. Uniform sampling through the Lovasz local lemma. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017 Conference paper Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda. Random Walks on Small World Networks. CoRR 2017, Volume 0 (0) 2017 Journal article Heng Guo 0001, Mark Jerrum. A simple FPRAS for bi-directed reachability. CoRR 2017, Volume 0 (0) 2017 Conference paper Martin E. Dyer, Mark Jerrum, Haiko Müller. On the switch Markov chain for perfect matchings. Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016 Journal article Leslie Ann Goldberg, Mark Jerrum. A complexity trichotomy for approximately counting list H-colourings. CoRR 2016, Volume 0 (0) 2016 Journal article Leslie Ann Goldberg, Mark Jerrum. The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theor. Comput. Sci. 2016, Volume 634 (0) 2016 Conference paper Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Mark Jerrum, Daniel Stefankovic, Eric Vigoda. #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 2016, Volume 82 (0) 2016 Conference paper Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum. Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. 2016, Volume 45 (0) 2016 Conference paper Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum. A Complexity Trichotomy for Approximately Counting List H-Colourings. 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016 Conference paper Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivny. Functional Clones and Expressibility of Partition Functions. CoRR 2016, Volume 0 (0) 2016 Conference paper Heng Guo 0001, Mark Jerrum, Jingcheng Liu 0001. Uniform Sampling through the Lovász Local Lemma. CoRR 2016, Volume 0 (0) 2016 Conference paper Heng Guo 0001, Mark Jerrum. Random cluster dynamics for the Ising model is rapidly mixing. CoRR 2016, Volume 0 (0) 2016 Journal article Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan. Approximating the partition function of planar two-state spin systems. J. Comput. Syst. Sci. 2015, Volume 81 (0) 2015 Journal article Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby. The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 2015, Volume 81 (0) 2015 Journal article Martin E. Dyer, Mark Jerrum, Haiko Müller. On the switch Markov chain for perfect matchings. CoRR 2015, Volume 0 (0) 2015 Conference paper Mark Jerrum, Kitty Meeks. The parameterised complexity of counting connected subgraphs and graph motifs. J. Comput. Syst. Sci. 2015, Volume 81 (0) 2015 Journal article Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum. Approximately Counting H-Colourings is #BIS-Hard. CoRR 2015, Volume 0 (0) 2015 Journal article John Faben, Mark Jerrum. The Complexity of Parity Graph Homomorphism: An Initial Investigation. Theory of Computing 2015, Volume 11 (0) 2015 Conference paper Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum. Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015 Conference paper Mark Jerrum, Kitty Meeks. Some Hard Families of Parameterized Counting Problems. TOCT 2014, Volume 7 (0) 2015