Russ Bubley

Graph orientations with no sink and an approximation for a hard case of #SAT

Martin E. Dyer, Russ Bubley, 1997, SODA '97.

On Approximately Counting Colorings of Small Degree Graphs

Martin E. Dyer, Mark Jerrum, Catherine S. Greenhill, 1999, SIAM J. Comput..

Beating the 2Δ bound for approximately counting colourings: a computer-assisted proof of rapid mixing

Martin E. Dyer, Catherine S. Greenhill, Russ Bubley, 1998, SODA '98.

Faster random generation of linear extensions

Martin E. Dyer, Russ Bubley, M. Dyer, 1999, SODA '98.

An elementary analysis of a procedure for sampling points in a convex body

Martin E. Dyer, Mark Jerrum, Russ Bubley, 1998, Random Struct. Algorithms.

Randomized algorithms - approximation, generation and counting

Russ Bubley, 2001, Distinguished dissertations.

Randomized algorithms

Russ Bubley, R. Motwani, Russ Bubley, 1995, CSUR.

Path coupling: A technique for proving rapid mixing in Markov chains

Martin E. Dyer, Russ Bubley, M. Dyer, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

An elementary analysis of a procedure for sampling points in a convex body

Mark Jerrum, Russ Bubley, Martin Dyer, 1998 .

A New Approach to Polynomial-Time Generation of Random Points in Convex Bodies

Martin Dyer, Mark Jerrum, Russ Bubley, 1996 .