| 1999 |
|---|
| 7 | EE | Russ Bubley,
Martin E. Dyer:
Faster random generation of linear extensions.
Discrete Mathematics 201(1-3): 81-88 (1999) |
| 6 | | Russ Bubley,
Martin E. Dyer,
Catherine S. Greenhill,
Mark Jerrum:
On Approximately Counting Colorings of Small Degree Graphs.
SIAM J. Comput. 29(2): 387-400 (1999) |
| 1998 |
|---|
| 5 | | Russ Bubley,
Martin E. Dyer:
Faster Random Generation of Linear Extensions.
SODA 1998: 350-354 |
| 4 | | Russ Bubley,
Martin E. Dyer,
Catherine S. Greenhill:
Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing.
SODA 1998: 355-363 |
| 3 | | Russ Bubley,
Martin E. Dyer,
Mark Jerrum:
An elementary analysis of a procedure for sampling points in a convex body.
Random Struct. Algorithms 12(3): 213-235 (1998) |
| 1997 |
|---|
| 2 | EE | Russ Bubley,
Martin E. Dyer:
Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains.
FOCS 1997: 223-231 |
| 1 | | Russ Bubley,
Martin E. Dyer:
Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT.
SODA 1997: 248-257 |
