Russ Bubley

According to our database, Russ Bubley authored at least 7 papers between 1997 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

Randomized algorithms - approximation, generation and counting.

Russ Bubley

Distinguished dissertations, Springer, ISBN: 978-1-85233-325-6, 2001

1999

On Approximately Counting Colorings of Small Degree Graphs.

Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum

SIAM J. Comput., 1999

Faster random generation of linear extensions.

Russ Bubley, Martin E. Dyer

Discret. Math., 1999

1998

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

Russ Bubley, Martin E. Dyer, Mark Jerrum

Random Struct. Algorithms, 1998

Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing.

Russ Bubley, Martin E. Dyer, Catherine S. Greenhill

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT.

Russ Bubley, Martin E. Dyer

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains.

Russ Bubley, Martin E. Dyer

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997