Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
SIAM Journal on Computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Generating random spanning trees more quickly than the cover time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An interruptible algorithm for perfect sampling via Markov chains
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Exact Sampling in Machine Scheduling Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Lazy inference on object identities in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Bowker's test for symmetry and modifications within the algebraic framework
Computational Statistics & Data Analysis
| Hi-index | 0.00 |