Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
SIAM Journal on Computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Parallel 'Go with the Winners' Algorithms in the LogP Model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Parallel 'go with the winners' algorithms in distributed memory models
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
| Hi-index | 0.00 |