1. Springer-Verl;Aldous,1983
2. Coupling vs. conductance for the Jerrum-Sinclair chain
3. and Path coupling: A technique for proving rapid mixing in Markov chains, Proc 38th Annual Symposium on Foundations of Computer Science, IEEE, Los Alimitos, 1997, pp. 223-231.
4. and Beating the 2? bound for approximately counting colorings: A computer-assisted proof of rapid mixing, Proc 9th Annual Symposium on Discrete Algorithms, ACM-SIAM, New York-Philadelphia, 1998, pp. 355-363.
5. and Delayed path coupling and generating random permutations via distributed stochastic processes, Proc 10th Annual Symposium on Discrete Algorithms, ACM-SIAM, New York-Philadelphia, 1999, pp. 271-280.