Mark Jerrum - RankMe

191 papers A* 29A 3B 5Journal 132Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The antiferromagnetic Ising model beyond line graphs. CoRR Mark Jerrum
2025	J	`jnl`	Glauber dynamics for the hard-core model on bounded-degree $H$ -free graphs. Comb. Probab. Comput. Mark Jerrum
2025	A*	`conf`	Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees. SoCG Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
2024	J	`jnl`	Glauber dynamics for the hard-core model on bounded-degree CoRR Mark Jerrum
2024	J	`jnl`	Rapid mixing of the flip chain over non-crossing spanning trees. CoRR Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
2023	—	`conf`	A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. SOSA Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
2023	J	`jnl`	A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. TheoretiCS Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
2023	J	`jnl`	Counting Vertices of Integral Polytopes Defined by Facets. Discret. Comput. Geom. Heng Guo, Mark Jerrum
2023	J	`jnl`	Perfect Sampling of q-Spin Systems on ℤ CoRR Konrad Anand, Mark Jerrum
2022	J	`jnl`	A simple polynomial-time approximation algorithm for total variation distances between product distributions. CoRR Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang
2022	J	`jnl`	Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing. SIAM J. Comput. Konrad Anand, Mark Jerrum
2021	J	`jnl`	Approximately counting bases of bicircular matroids. Comb. Probab. Comput. Heng Guo, Mark Jerrum
2021	J	`jnl`	Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
2021	J	`jnl`	Counting vertices of integer polytopes defined by facets. CoRR Heng Guo, Mark Jerrum
2021	J	`jnl`	Fundamentals of Partial Rejection Sampling. CoRR Mark Jerrum
2021	J	`jnl`	Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing. CoRR Konrad Anand, Mark Jerrum
2021	J	`jnl`	Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Comb. Probab. Comput. Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
2021	J	`jnl`	The Size of the Giant Joint Component in a Binomial Random Double Graph. Electron. J. Comb. Mark Jerrum, Tamás Makai
2020	J	`jnl`	Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
2020	J	`jnl`	Random Walks on Small World Networks. ACM Trans. Algorithms Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
2019	J	`jnl`	A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. SIAM J. Comput. Heng Guo, Mark Jerrum
2019	J	`jnl`	Approximating Pairwise Correlations in the Ising Model. ACM Trans. Comput. Theory Leslie Ann Goldberg, Mark Jerrum
2019	J	`jnl`	Counting weighted independent sets beyond the permanent. CoRR Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
2019	J	`jnl`	Uniform Sampling Through the Lovász Local Lemma. J. ACM Heng Guo, Mark Jerrum, Jingcheng Liu
2018	A*	`conf`	A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. ICALP Heng Guo, Mark Jerrum
2018	J	`jnl`	Approximately counting bases of bicircular matroids. CoRR Heng Guo, Mark Jerrum
2018	J	`jnl`	Approximating Pairwise Correlations in the Ising Model. CoRR Leslie Ann Goldberg, Mark Jerrum
2018	A*	`conf`	Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. ICALP Heng Guo, Mark Jerrum
2018	J	`jnl`	Perfect simulation of the Hard Disks Model by Partial Rejection Sampling. CoRR Heng Guo, Mark Jerrum
2017	J	`jnl`	A Complexity Trichotomy for Approximately Counting List ACM Trans. Comput. Theory Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2017	J	`jnl`	A simple FPRAS for bi-directed reachability. CoRR Heng Guo, Mark Jerrum
2017	J	`jnl`	Computational Counting (Dagstuhl Seminar 18341). Dagstuhl Reports Ivona Bezáková, Leslie Ann Goldberg, Mark Jerrum
2017	—	`ch.`	Counting Constraint Satisfaction Problems. The Constraint Satisfaction Problem Mark Jerrum
2017	J	`jnl`	Functional clones and expressibility of partition functions. Theor. Comput. Sci. Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2017	J	`jnl`	On the Switch Markov Chain for Perfect Matchings. J. ACM Martin E. Dyer, Mark Jerrum, Haiko Müller
2017	J	`jnl`	Random Walks on Small World Networks. CoRR Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
2017	A*	`conf`	Random cluster dynamics for the Ising model is rapidly mixing. SODA Heng Guo, Mark Jerrum
2017	J	`jnl`	The parameterised complexity of counting even and odd induced subgraphs. Comb. Mark Jerrum, Kitty Meeks
2017	A*	`conf`	Uniform sampling through the Lovasz local lemma. STOC Heng Guo, Mark Jerrum, Jingcheng Liu
2016	J	`jnl`	#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
2016	A*	`conf`	A Complexity Trichotomy for Approximately Counting List H-Colourings. ICALP Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2016	J	`jnl`	A complexity trichotomy for approximately counting list H-colourings. CoRR Leslie Ann Goldberg, Mark Jerrum
2016	J	`jnl`	Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2016	J	`jnl`	Functional Clones and Expressibility of Partition Functions. CoRR Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný
2016	A*	`conf`	On the switch Markov chain for perfect matchings. SODA Martin E. Dyer, Mark Jerrum, Haiko Müller
2016	J	`jnl`	Random cluster dynamics for the Ising model is rapidly mixing. CoRR Heng Guo, Mark Jerrum
2016	J	`jnl`	The complexity of counting locally maximal satisfying assignments of Boolean CSPs. Theor. Comput. Sci. Leslie Ann Goldberg, Mark Jerrum
2016	J	`jnl`	Uniform Sampling through the Lovász Local Lemma. CoRR Heng Guo, Mark Jerrum, Jingcheng Liu
2015	J	`jnl`	A complexity classification of spin systems with an external field. Proc. Natl. Acad. Sci. USA Leslie Ann Goldberg, Mark Jerrum
2015	J	`jnl`	Approximately Counting H-Colourings is #BIS-Hard. CoRR Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2015	—	`conf`	Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. ICALP (1) Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum
2015	J	`jnl`	Approximating the partition function of planar two-state spin systems. J. Comput. Syst. Sci. Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
2015	J	`jnl`	On the switch Markov chain for perfect matchings. CoRR Martin E. Dyer, Mark Jerrum, Haiko Müller
2015	J	`jnl`	Some Hard Families of Parameterized Counting Problems. ACM Trans. Comput. Theory Mark Jerrum, Kitty Meeks
2015	J	`jnl`	The Complexity of Parity Graph Homomorphism: An Initial Investigation. Theory Comput. John D. Faben, Mark Jerrum
2015	J	`jnl`	The complexity of Boolean #MaximalCSP. CoRR Leslie Ann Goldberg, Mark Jerrum
2015	J	`jnl`	The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2015	J	`jnl`	The parameterised complexity of counting connected subgraphs and graph motifs. J. Comput. Syst. Sci. Mark Jerrum, Kitty Meeks
2014	—	`conf`	#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
2014	J	`jnl`	The Complexity of Approximately Counting Tree Homomorphisms. ACM Trans. Comput. Theory Leslie Ann Goldberg, Mark Jerrum
2014	J	`jnl`	The Complexity of Computing the Sign of the Tutte Polynomial. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum
2014	J	`jnl`	The parameterised complexity of counting even and odd induced subgraphs. CoRR Mark Jerrum, Kitty Meeks
2013	J	`jnl`	A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum
2013	J	`jnl`	Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. CoRR Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum
2013	J	`jnl`	Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. J. Comput. Syst. Sci. Leslie Ann Goldberg, Mark Jerrum
2013	J	`jnl`	Computational Counting (Dagstuhl Seminar 13031). Dagstuhl Reports Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran
2013	J	`jnl`	Some hard classes of parameterised counting problems. CoRR Mark Jerrum, Kitty Meeks
2013	J	`jnl`	The Complexity of Approximately Counting Tree Homomorphisms CoRR Leslie Ann Goldberg, Mark Jerrum
2013	J	`jnl`	The Parameterised Complexity of Counting Connected Subgraphs. CoRR Mark Jerrum, Kitty Meeks
2013	A	`conf`	The complexity of approximating conservative counting CSPs. STACS Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2013	J	`jnl`	The complexity of parity graph homomorphism: an initial investigation. CoRR John D. Faben, Mark Jerrum
2013	J	`jnl`	The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
2012	J	`jnl`	Approximating the partition function of planar two-state spin systems CoRR Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
2012	J	`jnl`	Approximating the partition function of the ferromagnetic potts model. J. ACM Leslie Ann Goldberg, Mark Jerrum
2012	J	`jnl`	Inapproximability of the Tutte polynomial of a planar graph. Comput. Complex. Leslie Ann Goldberg, Mark Jerrum
2012	A	`conf`	Log-supermodular functions, functional clones and counting CSPs. STACS Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2012	—	`conf`	The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). ICALP (1) Leslie Ann Goldberg, Mark Jerrum
2012	J	`jnl`	The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation) CoRR Leslie Ann Goldberg, Mark Jerrum
2012	J	`jnl`	The complexity of approximating conservative counting CSPs CoRR Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2012	J	`jnl`	The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2011	J	`jnl`	A Counterexample to rapid mixing of the Ge-Stefankovic Process CoRR Leslie Ann Goldberg, Mark Jerrum
2011	—	`conf`	A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid. ICALP (1) Leslie Ann Goldberg, Mark Jerrum
2011	J	`jnl`	Log-supermodular functions, functional clones and counting CSPs CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	10481 Abstracts Collection - Computational Counting. Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	10481 Executive Summary - Computational Counting. Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	A Complexity Dichotomy For Hypergraph Partition Functions. Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2010	J	`jnl`	A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid CoRR Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2010	—	`conf`	Approximating the Partition Function of the Ferromagnetic Potts Model. ICALP (1) Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials CoRR Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	Approximating the partition function of the ferromagnetic Potts model CoRR Leslie Ann Goldberg, Mark Jerrum
2010	—	`ed.`	Computational Counting, 28.11. - 03.12.2010 Computational Counting Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	Constraint satisfaction problems and computational complexity: technical persepctive. Commun. ACM Mark Jerrum
2010	J	`jnl`	The complexity of weighted and unweighted #CSP CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2010	J	`jnl`	The mixing time of Glauber dynamics for coloring regular trees. Random Struct. Algorithms Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski
2009	A	`conf`	A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2009	J	`jnl`	Inapproximability of the Tutte polynomial of a planar graph CoRR Leslie Ann Goldberg, Mark Jerrum
2009	J	`jnl`	The Complexity of Weighted Boolean #CSP. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2008	—	`conf`	08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2008	J	`jnl`	A complexity dichotomy for hypergraph partition functions CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2008	J	`jnl`	A complexity dichotomy for partition functions with mixed signs CoRR Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2008	—	`ed.`	Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008 Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2008	J	`jnl`	Dobrushin Conditions and Systematic Scan. Comb. Probab. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2008	J	`jnl`	Inapproximability of the Tutte polynomial. Inf. Comput. Leslie Ann Goldberg, Mark Jerrum
2008	J	`jnl`	The Mixing Time of Glauber Dynamics for Colouring Regular Trees CoRR Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski
2007	J	`jnl`	An approximation trichotomy for Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2007	A*	`conf`	Inapproximability of the Tutte polynomial. STOC Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	Matrix norms and rapid mixing for spin systems CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	The Complexity of Ferromagnetic Ising with Local Fields. Comb. Probab. Comput. Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	The Complexity of Weighted Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2006	—	`conf`	Dobrushin Conditions and Systematic Scan. APPROX-RANDOM Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2006	J	`jnl`	Inapproximability of the Tutte polynomial CoRR Leslie Ann Goldberg, Mark Jerrum
2006	J	`jnl`	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
2006	J	`jnl`	Two Remarks Concerning Balanced Matroids. Comb. Mark Jerrum
2005	—	`conf`	05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2005	—	`ed.`	Design and Analysis of Randomized and Approximation Algorithms, 15.05. - 20.05.2005 Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2005	J	`jnl`	Dobrushin conditions and Systematic Scan Electron. Colloquium Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2004	J	`jnl`	A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
2004	J	`jnl`	A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM Mark Jerrum, Alistair Sinclair, Eric Vigoda
2004	J	`jnl`	Counting and sampling H-colourings? Inf. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2004	J	`jnl`	The Relative Complexity of Approximate Counting Problems. Algorithmica Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
2003	J	`jnl`	The computational complexity of two-state spin systems. Random Struct. Algorithms Leslie Ann Goldberg, Mark Jerrum, Mike Paterson
2002	J	`jnl`	Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
2002	—	`conf`	Counting and Sampling H-Colourings. RANDOM Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2002	J	`jnl`	On Counting Independent Sets in Sparse Graphs. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
2002	—	`conf`	Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. RANDOM Martin E. Dyer, Mark Jerrum, Eric Vigoda
2002	A*	`conf`	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. FOCS Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
2002	A*	`conf`	Spectral Gap and log-Sobolev Constant for Balanced Matroids. FOCS Mark Jerrum, Jung-Bae Son
2002	J	`jnl`	The "Burnside Process" Converges Slowly. Comb. Probab. Comput. Leslie Ann Goldberg, Mark Jerrum
2001	A*	`conf`	A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. STOC Mark Jerrum, Alistair Sinclair, Eric Vigoda
2001	—	`conf`	Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. Graphs, Morphisms and Statistical Physics Martin E. Dyer, Mark Jerrum, Eric Vigoda
2000	A*	`conf`	A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
2000	J	`jnl`	A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries Electron. Colloquium Comput. Complex. Mark Jerrum, Eric Vigoda
2000	J	`jnl`	An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	A*	`conf`	An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	J	`jnl`	Counting Unlabelled Subtrees of a Tree is #P-complete. LMS J. Comput. Math. Leslie Ann Goldberg, Mark Jerrum
2000	—	`conf`	On the relative complexity of approximate counting problems. APPROX Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
1999	A*	`conf`	Bisimulation Equivanlence Is Decidable for Normed Process Algebra. ICALP Yoram Hirshfeld, Mark Jerrum
1999	J	`jnl`	On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
1999	A*	`conf`	On Counting Independent Sets in Sparse Graphs. FOCS Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1999	J	`jnl`	Randomly Sampling Molecules. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum
1998	J	`jnl`	An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
1998	J	`jnl`	An elementary analysis of a procedure for sampling points in a convex body. Random Struct. Algorithms Russ Bubley, Martin E. Dyer, Mark Jerrum
1998	J	`jnl`	Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1998	—	`conf`	The "Burnside Process" Converges Slowly. RANDOM Leslie Ann Goldberg, Mark Jerrum
1998	J	`jnl`	The Metropolis Algorithm for Graph Bisection. Discret. Appl. Math. Mark Jerrum, Gregory B. Sorkin
1997	J	`jnl`	A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. Inf. Comput. Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney
1997	J	`jnl`	Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1997	J	`jnl`	Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica Alan M. Frieze, Mark Jerrum
1997	A*	`conf`	Randomly Sampling Molecules. SODA Leslie Ann Goldberg, Mark Jerrum
1997	A*	`conf`	The Swendsen-Wang Process Does Not Always Mix Rapidly. STOC Vivek Gore, Mark Jerrum
1996	J	`jnl`	A Mildly Exponential Approximation Algorithm for the Permanent. Algorithmica Mark Jerrum, Umesh V. Vazirani
1996	J	`jnl`	A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci. Yoram Hirshfeld, Mark Jerrum, Faron Moller
1996	J	`jnl`	A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes. Math. Struct. Comput. Sci. Yoram Hirshfeld, Mark Jerrum, Faron Moller
1996	J	`jnl`	Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
1996	A*	`conf`	Learning Linear Transformations. FOCS Alan M. Frieze, Mark Jerrum, Ravi Kannan
1995	J	`jnl`	A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph. Random Struct. Algorithms Mark Jerrum
1995	J	`jnl`	An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. Comb. Alan M. Frieze, Mark Jerrum
1995	J	`jnl`	Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. Mach. Learn. Paul W. Goldberg, Mark Jerrum
1995	B	`conf`	Improved Approximation Algorithms for MAX IPCO Alan M. Frieze, Mark Jerrum
1994	A*	`conf`	A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes FOCS Yoram Hirshfeld, Mark Jerrum, Faron Moller
1994	B	`conf`	An W(log log n) Lower Bound for Routing in Optical Networks. SPAA Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
1994	A*	`conf`	Approximately Counting Hamilton Cycles in Dense Graphs. SODA Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1994	J	`jnl`	Counting Trees in a Graph is #P-Complete. Inf. Process. Lett. Mark Jerrum
1994	J	`jnl`	Simple Translation-Invariant Concepts Are Hard to Learn Inf. Comput. Mark Jerrum
1994	J	`jnl`	Three-Dimensional Statistical Data Security Problems. SIAM J. Comput. Robert W. Irving, Mark Jerrum
1993	B	`conf`	A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. SPAA Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1993	B	`conf`	An analysis of a Monte Carlo algorithm for estimating the permanent. IPCO Mark Jerrum
1993	A*	`conf`	Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers. COLT Paul Goldberg, Mark Jerrum
1993	J	`jnl`	Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput. Mark Jerrum, Alistair Sinclair
1993	A*	`conf`	Simulated Annealing for Graph Bisection FOCS Mark Jerrum, Gregory B. Sorkin
1992	A*	`conf`	A Mildly Exponential Approximation Algorithm for the Permanent FOCS Mark Jerrum, Umesh V. Vazirani
1992	J	`jnl`	Large Cliques Elude the Metropolis Process. Random Struct. Algorithms Mark Jerrum
1992	—	`conf`	Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation. Expanding Graphs Mark Jerrum
1990	J	`jnl`	Fast Uniform Generation of Regular Graphs. Theor. Comput. Sci. Mark Jerrum, Alistair Sinclair
1990	A*	`conf`	Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). ICALP Mark Jerrum, Alistair Sinclair
1989	J	`jnl`	Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains Inf. Comput. Alistair Sinclair, Mark Jerrum
1989	J	`jnl`	Approximating the Permanent. SIAM J. Comput. Mark Jerrum, Alistair Sinclair
1988	A*	`conf`	Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) STOC Mark Jerrum, Alistair Sinclair
1988	A*	`conf`	On Continuous Homotopic One Layer Routing. Workshop on Computational Geometry Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum
1988	—	`conf`	On Continuous Homotopic One Layer Routing. SCG Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling
1987	B	`conf`	Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. WG Alistair Sinclair, Mark Jerrum
1986	J	`jnl`	A Compact Representation for Permutation Groups. J. Algorithms Mark Jerrum
1986	J	`jnl`	Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani
1985	A*	`conf`	Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract). ICALP Mark Jerrum
1985	J	`jnl`	The Complexity of Finding Minimum-Length Generator Sequences. Theor. Comput. Sci. Mark Jerrum
1984	J	`jnl`	Families of Fixed Degree Graphs for Processor Interconnection. IEEE Trans. Computers Mark Jerrum, Sven Skyum
1984	A*	`conf`	The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract). ICALP Mark Jerrum
1982	A*	`conf`	A Compact Representation for Permutation Groups FOCS Mark Jerrum
1982	J	`jnl`	Some Exact Complexity Results for Straight-Line Computations over Semirings. J. ACM Mark Jerrum, Marc Snir