martin-dyer documents

A more rapidly mixing Markov chain for graph colorings
Documents A more rapidly mixing Markov chain for graph colorings
Sampling contingency tables
Documents Sampling contingency tables
The complexity of counting graph homomorphisms
Documents The complexity of counting graph homomorphisms
On Markov Chains for Independent Sets
Documents On Markov Chains for Independent Sets
On a universal chain problem
Documents On a universal chain problem
Polynomial-time counting and sampling of two-rowed contingency tables
Documents Polynomial-time counting and sampling of two-rowed contingency tables
A probabilistic analysis of randomly generated binary constraint satisfaction problems
Documents A probabilistic analysis of randomly generated binary constraint satisfaction problems
Randomly coloring graphs with lower bounds on girth and maximum degree
Documents Randomly coloring graphs with lower bounds on girth and maximum degree
Preface
Documents Preface
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs
Documents Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs
Mixing in time and space for lattice spin systems: A combinatorial view
Documents Mixing in time and space for lattice spin systems: A combinatorial view
Corrigendum: The complexity of counting graph homomorphisms
Documents Corrigendum: The complexity of counting graph homomorphisms
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Documents Randomly coloring sparse random graphs with fewer colors than the maximum degree
Randomly coloring random graphs
Documents Randomly coloring random graphs
Randomized greedy matching
Documents Randomized greedy matching
Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph
Documents Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph
On key storage in secure networks
Documents On key storage in secure networks
The Relative Complexity of Approximate Counting Problems
Documents The Relative Complexity of Approximate Counting Problems
Computational complexity of stochastic programming problems
Documents Computational complexity of stochastic programming problems
Counting and sampling H-colourings
Documents Counting and sampling H-colourings
CV - S R E - Martin Dyer
Documents CV - S R E - Martin Dyer