Polynomial-time approximation algorithms for the Ising model
SIAM Journal on Computing
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
Randomized algorithms
A very simple algorithm for estimating the number of k-colorings of a low-degree graph
Random Structures & Algorithms
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
Sampling spin configurations of an Ising system
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing in Science and Engineering
The "Burnside Process" Converges Slowly
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The ‘Burnside Process’ Converges Slowly
Combinatorics, Probability and Computing
The phase transition in the cluster-scaled model of a random graph
Random Structures & Algorithms
The Complexity of Ferromagnetic Ising with Local Fields
Combinatorics, Probability and Computing
| Hi-index | 0.00 |