Russ Bubley

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Path coupling: A technique for proving rapid mixing in Markov chains	2002	Russ Bubley Martin Dyer
+	Faster random generation of linear extensions	1999	Russ Bubley Martin Dyer
+	On Approximately Counting Colorings of Small Degree Graphs	1999	Russ Bubley Martin Dyer Catherine Greenhill Mark Jerrum
+	An elementary analysis of a procedure for sampling points in a convex body	1998	Russ Bubley Martin Dyer Mark Jerrum
+	An elementary analysis of a procedure for sampling points in a convex body	1998	Russ Bubley Martin Dyer Mark Jerrum
+	Beating the 2D bound for approximately counting colourings: a computer-assisted proof of rapid mixing	1998	Russ Bubley Martin Dyer Catherine Greenhill
+	Faster random generation of linear extensions	1998	Russ Bubley Martin Dyer
+	Graph orientations with no sink and an approximation for a hard case of #SAT	1997	Russ Bubley Martin Dyer

Common Coauthors

Coauthor	Papers Together
Martin Dyer	8
Mark Jerrum	3
Catherine Greenhill	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	The Markov chain Monte Carlo method: an approach to approximate counting and integration	1996	Mark Jerrum Alistair Sinclair	5
+ PDF Chat	Random walks on finite groups and rapidly mixing markov chains	1983	David Aldous	5
+ PDF Chat	A random polynomial-time algorithm for approximating the volume of convex bodies	1991	Martin Dyer Alan Frieze Ravi Kannan	5
+	A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph	1995	Mark Jerrum	4
+ PDF Chat	Path coupling: A technique for proving rapid mixing in Markov chains	2002	Russ Bubley Martin Dyer	4
+	Random generation of combinatorial structures from a uniform distribution	1986	Mark Jerrum Leslie G. Valiant Vijay V. Vazirani	3
+ PDF Chat	Approximate counting, uniform generation and rapidly mixing Markov chains	1989	Alistair Sinclair Mark Jerrum	3
+ PDF Chat	Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem	1997	Jesús Salas Alan D. Sokal	3
+ PDF Chat	Generating a Random Linear Extension of a Partial Order	1991	Peter Matthews	3
+	Computing the volume of convex bodies: a case where randomness provably helps	1991	Martin Dyer Alan Frieze	2
+	Spearman's Footrule as a Measure of Disarray	1977	Persi Diaconis Ron Graham	2
+	Counting linear extensions	1991	Graham Brightwell Peter Winkler	2
+	On Markov Chains for Independent Sets	2000	Martin Dyer Catherine Greenhill	2
+	On the conductance of order Markov chains	1991	Alexander V. Karzanov Leonid Khachiyan	2
+	Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case	1995	Noga Alon Alan Frieze Dominic Welsh	2
+	Markov chains for linear extensions, the two-dimensional case	1997	Stefan Felsner Lorenz Wernisch	2
+ PDF Chat	A modified heat bath method suitable for Monte Carlo simulations on vector and parallel processors	1987	Klaus Fredenhagen Marius Marcu	2
+	Exact sampling with coupled Markov chains and applications to statistical mechanics	1996	James Propp David Bruce Wilson	2
+ PDF Chat	Approximating the Permanent	1989	Mark Jerrum Alistair Sinclair	2
+	The Complexity of Enumeration and Reliability Problems	1979	Leslie G. Valiant	2
+	Monte-Carlo algorithms for enumeration and reliability problems	1983	Richard M. Karp Michael Luby	1
+	On the computational complexity of the Jones and Tutte polynomials	1990	François Jaeger Dirk Vertigan Dominic Welsh	1
+	Faster random generation of linear extensions	1998	Russ Bubley Martin Dyer	1
+	Graph orientations with no sink and an approximation for a hard case of #SAT	1997	Russ Bubley Martin Dyer	1
+	On the number of Eulerian orientations of a graph	1996	Milena Mihail P. Winkler	1
+	Acyclic orientations of graphs	1973	Richard P. Stanley	1
+	Colouring, Stable Sets and Perfect Graphs	1995	Bjarne Toft	1
+	Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract).	1995	Michael Luby Dana Randall Alistair Sinclair	1
+	Beating the 2D bound for approximately counting colourings: a computer-assisted proof of rapid mixing	1998	Russ Bubley Martin Dyer Catherine Greenhill	1
+	Approximately counting up to four (extended abstract)	1997	Michael Luby Eric Vigoda	1
+	A more rapidly mixing Markov chain for graph colorings	1998	Martin Dyer Catherine Greenhill	1
+	Approximating the permanent of graphs with large factors	1992	Paul Dagum Michael Luby	1