Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Hard enumeration problems in geometry and combinatorics
SIAM Journal on Algebraic and Discrete Methods
On generating all maximal independent sets
Information Processing Letters
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Approximating the permanent of graphs with large factors
Theoretical Computer Science
On the number of Eularian orientations of a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
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
Polynomial time randomized approximation schemes for Tutte-Gro¨thendieck invariants: the dense case
Random Structures & Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Markov chain algorithms for planar lattice structures
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
Artificial Intelligence
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
Combinatorics, Probability and Computing
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms
On symmetric signatures in holographic algorithms
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
| Hi-index | 0.00 |