The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The complexity of choosing an H-colouring (nearly) uniformly at random
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An O(n2) bound for the relaxation time of a Markov chain on cladograms
Random Structures & Algorithms
Decomposition Methods and Sampling Circuits in the Cartesian Lattice
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Note on Bounding the Mixing Time by Linear Programming
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Convergence of the Iterated Prisoner's Dilemma Game
Combinatorics, Probability and Computing
Combinatorial criteria for uniqueness of Gibbs measures
Random Structures & Algorithms
Counting independent sets up to the tree threshold
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Path coupling without contraction
Journal of Discrete Algorithms
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms
Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz
Combinatorics, Probability and Computing
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Stopping times, metrics and approximate counting
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Path coupling using stopping times
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Towards distributed MCMC inference in probabilistic knowledge bases
AKBC-WEKEX '12 Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Hi-index | 0.01 |