1. On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
2. and , Samping and integration of near log-concave functions. Proceedings of the 23rd ACM Symposium on Theory of Computing (1991) 156–163.
3. How hard is it to marry at random? (On the approximation of the permanent). Proceedings of the 18th ACM Symposium on Theory of Computing (1986) 50–58.
4. Generating random spanning trees. Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (1989) 442–447.
5. and , Software for simulating and analyzing Markov chains. Technical Report TM-ARH-020–376, Bellcore (1991).