1. D. Aldous, “Random walks on finite groups and rapidly mixing Markov chains,”Séminaire de Probabilités XVIII, 1981–82, Springer Lecture Note in Mathematics No. 986 (Springer, Berlin, 1982) pp. 243–297.
2. D. Aldous, “The random walk construction of uniform spanning trees and uniform labelled trees,”SIAM Journal on Discrete Mathematics 3 (1990) 450–465.
3. D. Applegate and R. Kannan, “Sampling and integration of near logconcave functions,”Proceedings of the 23rd ACM Symposium on Theory of Computing (1991) pp. 156–163.
4. J.W. Archbold,Algebra (Pitman, London, 1958).
5. A.Z. Broder, “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) pp. 50–58.