1. Lecture Notes;Aldous,1983
2. and Markovian coupling vs. conductance for the Jerrum-Sinclair chain, Proc 40th Annual IEEE Symp Foundations of Computer Science, 1999, pp. 241-251.
3. How hard is it to marry at random? (On the approximation of the permanent), Proc 18th ACM Symp Theory of Computating, 1986, pp. 50-58.
4. Erratum in Proc 20th ACM Symp Theory of Computing, 1988, p. 551.
5. and Path coupling: a technique for proving rapid mixing in Markov chains, Proc 38th Ann IEEE Symp Foundations of Computer Science, 1997, pp. 223-231.