Dyer, Martin - School of Computing, University of Leeds

Advanced Search

Dyer, Martin - School of Computing, University of Leeds

Random Walks on the Vertices of Transportation Polytopes with Constant Number of Sources
Randomly coloring constant degree graphs Martin Dyer
On Markov chains for independent sets Martin Dyer and Catherine Greenhill
Dobrushin conditions and Systematic Scan Martin Dyer
On counting homomorphisms to directed acyclic graphs
Randomly colouring random graphs Martin Dyer
Sampling regular graphs and a peer-to-peer network Colin Cooper
Convergence of the Iterated Prisoner's Dilemma game Martin Dyer
On the relative complexity of approximate counting problems
Very rapid mixing of the Glauber dynamics for proper colourings on bounded-degree graphs
Polynomial-time counting and sampling of two-rowed contingency tables
The flip Markov chain and a randomising P2P protocol Colin Cooper
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables
Refereed Publications [1] M. E. Cryan, M. E. Dyer and D. Randall, "Approximately counting integral
Mixing Properties of the Swendsen-Wang Process on the Complete Graph and Narrow Grids
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
Path coupling without contraction Magnus Bordewich a,, Martin Dyer b
Stopping Times, Metrics and Approximate Counting
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View
An extension of path coupling and its application to the Glauber dynamics for graph colourings
Fast and optimal parallel multidimensional search in PRAMs with applications to linear-programming and related problems
Computational complexity of stochastic programming problems Martin Dyer
Counting and sampling H-colourings Martin Dyer
Rapidly mixing Markov chains for dismantleable constraint graphs