1. Random walks on finite groups and rapidly mixing Markov chains;Aldous,1983
2. Graph orientations with no sink and an approximation for a hard case of #SAT;Bubley,1996
3. Path coupling: A technique for proving rapid mixing in Markov chains;Bubley,1997
4. On approximately counting colourings of small degree graphs;Bubley;SIAM J. Comput.,1999
5. Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints;Caracciolo;J. Statist. Phys.,1990