Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Mark R. Jerrum - MaRDI portal

Mark R. Jerrum

From MaRDI portal
(Redirected from Person:269467)
Person:1058289

Available identifiers

zbMath Open jerrum.mark-rDBLPj/MarkJerrumWikidataQ92666 ScholiaQ92666MaRDI QIDQ1058289

List of research outcomes

PublicationDate of PublicationType
Counting vertices of integral polytopes defined by facets2023-10-12Paper
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs2023-03-30Paper
Perfect Sampling of $q$-Spin Systems on $\mathbb Z^2$ via Weak Spatial Mixing2023-02-15Paper
Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing2022-08-12Paper
https://portal.mardi4nfdi.de/entity/Q50027462021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50027472021-07-28Paper
Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing2021-06-30Paper
Counting Weighted Independent Sets beyond the Permanent2021-06-28Paper
Approximately counting bases of bicircular matroids2021-06-15Paper
Counting Constraint Satisfaction Problems.2021-06-15Paper
Fundamentals of Partial Rejection Sampling2021-06-14Paper
Perfect simulation of the hard disks model by partial rejection sampling2021-06-09Paper
Random Walks on Small World Networks2021-05-03Paper
The size of the giant joint component in a binomial random double graph2021-02-16Paper
The Complexity of Computing the Sign of the Tutte Polynomial2020-05-31Paper
Approximating Pairwise Correlations in the Ising Model2019-12-16Paper
A Complexity Trichotomy for Approximately Counting List H -Colorings2019-12-06Paper
Uniform Sampling Through the Lovász Local Lemma2019-11-21Paper
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability2019-09-02Paper
The parameterised complexity of counting even and odd induced subgraphs2019-02-01Paper
On the switch Markov chain for perfect matchings2018-07-16Paper
Random cluster dynamics for the Ising model is rapidly mixing2018-07-16Paper
Random cluster dynamics for the Ising model is rapidly mixing2018-06-29Paper
On the Switch Markov Chain for Perfect Matchings2018-05-17Paper
A complexity trichotomy for approximately counting list H-colourings2017-12-19Paper
Uniform sampling through the Lovasz local lemma2017-08-17Paper
Functional clones and expressibility of partition functions2017-06-13Paper
https://portal.mardi4nfdi.de/entity/Q29696472017-03-22Paper
A complexity classification of spin systems with an external field2017-02-16Paper
The complexity of approximating conservative counting CSPs.2017-01-30Paper
Some Hard Families of Parameterized Counting Problems2016-11-10Paper
Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard2016-06-01Paper
The complexity of counting locally maximal satisfying assignments of Boolean CSPs2016-05-18Paper
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region2016-04-18Paper
Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard2015-10-27Paper
The Complexity of Approximately Counting Tree Homomorphisms2015-09-03Paper
The complexity of parity graph homomorphism: an initial investigation2015-08-21Paper
https://portal.mardi4nfdi.de/entity/Q55017952015-08-14Paper
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries2015-02-27Paper
The parameterised complexity of counting connected subgraphs and graph motifs2015-02-20Paper
The complexity of approximating conservative counting CSPs2014-09-22Paper
Approximating the partition function of planar two-state spin systems2014-09-22Paper
The expressibility of functions on the boolean domain, with applications to counting CSPs2014-02-17Paper
Approximating the Partition Function of the Ferromagnetic Potts Model2014-02-17Paper
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid2013-09-25Paper
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)2013-08-12Paper
Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials2013-02-21Paper
Inapproximability of the Tutte polynomial of a planar graph2012-12-27Paper
https://portal.mardi4nfdi.de/entity/Q29047712012-08-23Paper
A counterexample to rapid mixing of the Ge-Stefankovic process2012-06-22Paper
The complexity of weighted and unweighted \(\#\)CSP2012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q53900022012-04-24Paper
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid2011-07-06Paper
A Complexity Dichotomy for Partition Functions with Mixed Signs2011-04-04Paper
A complexity dichotomy for hypergraph partition functions2011-02-18Paper
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries2011-02-01Paper
The mixing time of Glauber dynamics for coloring regular trees2010-11-24Paper
Approximating the Partition Function of the Ferromagnetic Potts Model2010-09-07Paper
Markov chain comparison2010-06-29Paper
An approximation trichotomy for Boolean \#CSP2010-05-25Paper
The Complexity of Weighted Boolean #CSP2009-11-06Paper
Matrix norms and rapid mixing for spin systems2009-04-02Paper
Dobrushin Conditions and Systematic Scan2009-03-04Paper
https://portal.mardi4nfdi.de/entity/Q35496452009-01-05Paper
Inapproximability of the Tutte polynomial2008-08-14Paper
https://portal.mardi4nfdi.de/entity/Q34995082008-06-02Paper
Dobrushin Conditions and Systematic Scan2007-08-28Paper
https://portal.mardi4nfdi.de/entity/Q34472842007-06-28Paper
Two remarks concerning balanced matroids2007-05-08Paper
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows2007-03-27Paper
The Complexity of Ferromagnetic Ising with Local Fields2007-03-20Paper
Systematic scan for sampling colorings2006-06-29Paper
On the approximation of one Markov chain by another2006-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46607212005-04-04Paper
Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains2005-03-21Paper
A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols2005-02-21Paper
Counting and sampling \(H\)-colourings2004-11-23Paper
The relative complexity of approximate counting problems2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44404272003-12-17Paper
https://portal.mardi4nfdi.de/entity/Q44404282003-12-17Paper
The computational complexity of two‐state spin systems2003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q47983472003-03-19Paper
Convergence of the Iterated Prisoner's Dilemma Game2003-03-17Paper
On Counting Independent Sets in Sparse Graphs2002-09-29Paper
The ‘Burnside Process’ Converges Slowly2002-05-14Paper
https://portal.mardi4nfdi.de/entity/Q27537312002-01-06Paper
https://portal.mardi4nfdi.de/entity/Q42406002001-11-13Paper
https://portal.mardi4nfdi.de/entity/Q27541892001-11-11Paper
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q45270352001-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49526762000-10-23Paper
Counting Unlabelled Subtrees of a Tree is #P-complete2000-09-25Paper
https://portal.mardi4nfdi.de/entity/Q42472042000-09-24Paper
https://portal.mardi4nfdi.de/entity/Q49386372000-07-10Paper
Randomly Sampling Molecules2000-03-19Paper
The Swendsen-Wang process does not always mix rapidly2000-03-16Paper
The Metropolis algorithm for graph bisection2000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42341411999-11-03Paper
On Approximately Counting Colorings of Small Degree Graphs1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42303551999-04-22Paper
https://portal.mardi4nfdi.de/entity/Q42264511999-01-27Paper
An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks1998-09-20Paper
Approximately Counting Hamilton Paths and Cycles in Dense Graphs1998-09-20Paper
A quasi-polynomial-time algorithm for sampling words from a context-free language1997-12-17Paper
Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION1997-10-09Paper
https://portal.mardi4nfdi.de/entity/Q31288931997-04-23Paper
A polynomial algorithm for deciding bisimilarity of normed context-free processes1997-02-27Paper
A mildly exponential approximation algorithm for the permanent1997-02-18Paper
Generating and Counting Hamilton Cycles in Random Regular Graphs1996-12-16Paper
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes1996-11-18Paper
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph1996-03-14Paper
https://portal.mardi4nfdi.de/entity/Q48413081996-03-13Paper
https://portal.mardi4nfdi.de/entity/Q48660911996-03-04Paper
https://portal.mardi4nfdi.de/entity/Q48567501996-01-16Paper
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers1995-10-29Paper
Simple translation-invariant concepts are hard to learn1995-10-09Paper
https://portal.mardi4nfdi.de/entity/Q46974571995-08-27Paper
An analysis of Monte Carlo algorithm for estimating the permanent1995-07-23Paper
https://portal.mardi4nfdi.de/entity/Q42736221995-06-12Paper
Counting trees in a graph is \(\# \text{P}\)-complete1994-10-13Paper
Three-dimensional Statistical Data Security Problems1994-03-27Paper
Polynomial-Time Approximation Algorithms for the Ising Model1993-12-20Paper
https://portal.mardi4nfdi.de/entity/Q40387111993-05-18Paper
Large Cliques Elude the Metropolis Process1993-01-16Paper
Fast uniform generation of regular graphs1990-01-01Paper
Approximate counting, uniform generation and rapidly mixing Markov chains1989-01-01Paper
Approximating the Permanent1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31978261988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38133391988-01-01Paper
Random generation of combinatorial structures from a uniform distribution1986-01-01Paper
A compact representation for permutation groups1986-01-01Paper
The complexity of finding minimum-length generator sequences1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427181985-01-01Paper
Families of Fixed Degree Graphs for Processor Interconnection1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36786701984-01-01Paper
Some Exact Complexity Results for Straight-Line Computations over Semirings1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mark R. Jerrum