Average case complete problems
SIAM Journal on Computing
Combinatorica
SIAM Journal on Computing
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Polynomial-time approximation algorithms for the Ising model
SIAM Journal on Computing
Randomized algorithms
A very simple algorithm for estimating the number of k-colorings of a low-degree graph
Random Structures & Algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Faster random generation of linear extensions
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
`Go with the winners' Generators with Applications to Molecular Modeling
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Markov chain algorithms for planar lattice structures
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Path coupling: A technique for proving rapid mixing in Markov chains
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Factoring graphs to bound mixing rates
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithms for Almost-uniform Generation with an Unbiased Binary Source
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |