An interruptible algorithm for perfect sampling via Markov chains
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On perfect simulation for some mixtures of distributions
Statistics and Computing
Efficient use of exact samples
Statistics and Computing
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Speeding up the FMMR perfect sampling algorithm: a case study revisited
Random Structures & Algorithms
CONVERGENCE OF SIMULATION-BASED POLICY ITERATION
Probability in the Engineering and Informational Sciences
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Shuffling biological sequences with motif constraints
Journal of Discrete Algorithms
Perfect simulation with exponential tails on the running time
Random Structures & Algorithms
The Topological Fortress of Termites
Bio-Inspired Computing and Communication
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fast simulation of large-scale growth models
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Journal of Computer and System Sciences
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Random generation of combinatorial structures: Boltzmann samplers and beyond
Proceedings of the Winter Simulation Conference
International Journal of Operations Research and Information Systems
Hi-index | 0.04 |