| Publication | Date of Publication | Type |
|---|
| Fundamentals of partial rejection sampling | 2024-09-10 | Paper |
| A simple polynomial-time approximation algorithm for the total variation distance between two product distributions | 2024-07-03 | Paper |
| A simple polynomial-time approximation algorithm for the total variation distance between two product distributions | 2024-05-14 | Paper |
| Counting vertices of integral polytopes defined by facets | 2023-10-12 | Paper |
| Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs | 2023-03-30 | Paper |
| Perfect Sampling of $q$-Spin Systems on $\mathbb Z^2$ via Weak Spatial Mixing | 2023-02-15 | Paper |
| Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing | 2022-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002746 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002747 | 2021-07-28 | Paper |
| Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing | 2021-06-30 | Paper |
| Counting Weighted Independent Sets beyond the Permanent | 2021-06-28 | Paper |
| Approximately counting bases of bicircular matroids | 2021-06-15 | Paper |
| Counting Constraint Satisfaction Problems. | 2021-06-15 | Paper |
| Fundamentals of Partial Rejection Sampling | 2021-06-14 | Paper |
| Perfect simulation of the hard disks model by partial rejection sampling | 2021-06-09 | Paper |
| Random Walks on Small World Networks | 2021-05-03 | Paper |
| The size of the giant joint component in a binomial random double graph | 2021-02-16 | Paper |
| The Complexity of Computing the Sign of the Tutte Polynomial | 2020-05-31 | Paper |
| Approximating Pairwise Correlations in the Ising Model | 2019-12-16 | Paper |
| A Complexity Trichotomy for Approximately Counting List H -Colorings | 2019-12-06 | Paper |
| Uniform Sampling Through the Lovász Local Lemma | 2019-11-21 | Paper |
| A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability | 2019-09-02 | Paper |
| The parameterised complexity of counting even and odd induced subgraphs | 2019-02-01 | Paper |
| On the switch Markov chain for perfect matchings | 2018-07-16 | Paper |
| Random cluster dynamics for the Ising model is rapidly mixing | 2018-07-16 | Paper |
| Random cluster dynamics for the Ising model is rapidly mixing | 2018-06-29 | Paper |
| On the Switch Markov Chain for Perfect Matchings | 2018-05-17 | Paper |
| A complexity trichotomy for approximately counting list H-colourings | 2017-12-19 | Paper |
| Uniform sampling through the Lovasz local lemma | 2017-08-17 | Paper |
| Functional clones and expressibility of partition functions | 2017-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969647 | 2017-03-22 | Paper |
| A complexity classification of spin systems with an external field | 2017-02-16 | Paper |
| The complexity of approximating conservative counting CSPs. | 2017-01-30 | Paper |
| Some Hard Families of Parameterized Counting Problems | 2016-11-10 | Paper |
| Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard | 2016-06-01 | Paper |
| The complexity of counting locally maximal satisfying assignments of Boolean CSPs | 2016-05-18 | Paper |
| \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region | 2016-04-18 | Paper |
| Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard | 2015-10-27 | Paper |
| The Complexity of Approximately Counting Tree Homomorphisms | 2015-09-03 | Paper |
| The complexity of parity graph homomorphism: an initial investigation | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501795 | 2015-08-14 | Paper |
| A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries | 2015-02-27 | Paper |
| The parameterised complexity of counting connected subgraphs and graph motifs | 2015-02-20 | Paper |
| The complexity of approximating conservative counting CSPs | 2014-09-22 | Paper |
| Approximating the partition function of planar two-state spin systems | 2014-09-22 | Paper |
| The expressibility of functions on the boolean domain, with applications to counting CSPs | 2014-02-17 | Paper |
| Approximating the Partition Function of the Ferromagnetic Potts Model | 2014-02-17 | Paper |
| A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid | 2013-09-25 | Paper |
| The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) | 2013-08-12 | Paper |
| Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials | 2013-02-21 | Paper |
| Inapproximability of the Tutte polynomial of a planar graph | 2012-12-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904771 | 2012-08-23 | Paper |
| A counterexample to rapid mixing of the Ge-Stefankovic process | 2012-06-22 | Paper |
| The complexity of weighted and unweighted \(\#\)CSP | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390002 | 2012-04-24 | Paper |
| A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid | 2011-07-06 | Paper |
| A Complexity Dichotomy for Partition Functions with Mixed Signs | 2011-04-04 | Paper |
| A complexity dichotomy for hypergraph partition functions | 2011-02-18 | Paper |
| A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries | 2011-02-01 | Paper |
| The mixing time of Glauber dynamics for coloring regular trees | 2010-11-24 | Paper |
| Approximating the Partition Function of the Ferromagnetic Potts Model | 2010-09-07 | Paper |
| Markov chain comparison | 2010-06-29 | Paper |
| An approximation trichotomy for Boolean \#CSP | 2010-05-25 | Paper |
| The Complexity of Weighted Boolean #CSP | 2009-11-06 | Paper |
| Matrix norms and rapid mixing for spin systems | 2009-04-02 | Paper |
| Dobrushin Conditions and Systematic Scan | 2009-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549645 | 2009-01-05 | Paper |
| Inapproximability of the Tutte polynomial | 2008-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3499508 | 2008-06-02 | Paper |
| Dobrushin Conditions and Systematic Scan | 2007-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447284 | 2007-06-28 | Paper |
| Two remarks concerning balanced matroids | 2007-05-08 | Paper |
| Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows | 2007-03-27 | Paper |
| The Complexity of Ferromagnetic Ising with Local Fields | 2007-03-20 | Paper |
| Systematic scan for sampling colorings | 2006-06-29 | Paper |
| On the approximation of one Markov chain by another | 2006-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660721 | 2005-04-04 | Paper |
| Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains | 2005-03-21 | Paper |
| A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols | 2005-02-21 | Paper |
| Counting and sampling \(H\)-colourings | 2004-11-23 | Paper |
| The relative complexity of approximate counting problems | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440427 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440428 | 2003-12-17 | Paper |
| The computational complexity of two‐state spin systems | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4798347 | 2003-03-19 | Paper |
| Convergence of the Iterated Prisoner's Dilemma Game | 2003-03-17 | Paper |
| On Counting Independent Sets in Sparse Graphs | 2002-09-29 | Paper |
| The ‘Burnside Process’ Converges Slowly | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753731 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4240600 | 2001-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754189 | 2001-11-11 | Paper |
| An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527035 | 2001-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952676 | 2000-10-23 | Paper |
| Counting Unlabelled Subtrees of a Tree is #P-complete | 2000-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247204 | 2000-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938637 | 2000-07-10 | Paper |
| Randomly Sampling Molecules | 2000-03-19 | Paper |
| The Swendsen-Wang process does not always mix rapidly | 2000-03-16 | Paper |
| The Metropolis algorithm for graph bisection | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234141 | 1999-11-03 | Paper |
| On Approximately Counting Colorings of Small Degree Graphs | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230355 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226451 | 1999-01-27 | Paper |
| An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks | 1998-09-20 | Paper |
| Approximately Counting Hamilton Paths and Cycles in Dense Graphs | 1998-09-20 | Paper |
| A quasi-polynomial-time algorithm for sampling words from a context-free language | 1997-12-17 | Paper |
| Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION | 1997-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128893 | 1997-04-23 | Paper |
| A polynomial algorithm for deciding bisimilarity of normed context-free processes | 1997-02-27 | Paper |
| A mildly exponential approximation algorithm for the permanent | 1997-02-18 | Paper |
| Generating and Counting Hamilton Cycles in Random Regular Graphs | 1996-12-16 | Paper |
| A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes | 1996-11-18 | Paper |
| A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph | 1996-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4841308 | 1996-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866091 | 1996-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856750 | 1996-01-16 | Paper |
| Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers | 1995-10-29 | Paper |
| Simple translation-invariant concepts are hard to learn | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697457 | 1995-08-27 | Paper |
| An analysis of Monte Carlo algorithm for estimating the permanent | 1995-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273622 | 1995-06-12 | Paper |
| Counting trees in a graph is \(\# \text{P}\)-complete | 1994-10-13 | Paper |
| Three-dimensional Statistical Data Security Problems | 1994-03-27 | Paper |
| Polynomial-Time Approximation Algorithms for the Ising Model | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038711 | 1993-05-18 | Paper |
| Large Cliques Elude the Metropolis Process | 1993-01-16 | Paper |
| Fast uniform generation of regular graphs | 1990-01-01 | Paper |
| Approximate counting, uniform generation and rapidly mixing Markov chains | 1989-01-01 | Paper |
| Approximating the Permanent | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197826 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813339 | 1988-01-01 | Paper |
| Random generation of combinatorial structures from a uniform distribution | 1986-01-01 | Paper |
| A compact representation for permutation groups | 1986-01-01 | Paper |
| The complexity of finding minimum-length generator sequences | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742718 | 1985-01-01 | Paper |
| Families of Fixed Degree Graphs for Processor Interconnection | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678670 | 1984-01-01 | Paper |
| Some Exact Complexity Results for Straight-Line Computations over Semirings | 1982-01-01 | Paper |
| Glauber dynamics for the hard-core model on bounded-degree $H$-free graphs | N/A | Paper |
