Random generation of combinatorial structures from a uniform
Theoretical Computer Science
SIAM Journal on Computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Markov chains, computer proofs, and average-case analysis of best fit bin packing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Simulation and the Monte Carlo Method
Simulation and the Monte Carlo Method
Path coupling: A technique for proving rapid mixing in Markov chains
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Recovery time of dynamic allocation processes
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Delayed path coupling and generating random permutations via distributed stochastic processes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs
Random Structures & Algorithms
Algorithms for Almost-uniform Generation with an Unbiased Binary Source
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Improved Bounds for Sampling Coloring
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Torpid mixing of local Markov chains on 3-colorings of the discrete torus
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |