The following pages link to Martin Dyer (Q247119):
Displaying 44 items.
- Sampling contingency tables (Q4345364) (← links)
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension (Q4361783) (← links)
- On The Complexity of Computing Mixed Volumes (Q4388877) (← links)
- (Q4401028) (← links)
- Randomly coloring graphs with lower bounds on girth and maximum degree (Q4434470) (← links)
- (Q4440427) (← links)
- (Q4440428) (← links)
- (Q4440435) (← links)
- (Q4452091) (← links)
- (Q4471315) (← links)
- (Q4521549) (← links)
- Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs (Q4534221) (← links)
- On the switch Markov chain for perfect matchings (Q4575722) (← links)
- Discordant Voting Processes on Finite Graphs (Q4598288) (← links)
- On the Switch Markov Chain for Perfect Matchings (Q4640285) (← links)
- (Q4660717) (← links)
- (Q4660721) (← links)
- Discordant Voting Processes on Finite Graphs (Q4691143) (← links)
- A more rapidly mixing Markov chain for graph colorings (Q4705336) (← links)
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem (Q4720806) (← links)
- Mixing in time and space for lattice spin systems: A combinatorial view (Q4739582) (← links)
- (Q4952624) (← links)
- (Q4952676) (← links)
- On Markov Chains for Independent Sets (Q4953244) (← links)
- Random Walks on Small World Networks (Q4987458) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- The flip markov chain and a randomising P2P protocol (Q5170311) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
- (Q5365091) (← links)
- Approximately Counting Integral Flows and Cell-Bounded Contingency Tables (Q5390574) (← links)
- The expressibility of functions on the boolean domain, with applications to counting CSPs (Q5395728) (← links)
- Sampling Regular Graphs and a Peer-to-Peer Network (Q5437233) (← links)
- Fundamentals of Computation Theory (Q5492913) (← links)
- (Q5501802) (← links)
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (Q5886117) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5901055) (← links)
- Dobrushin Conditions and Systematic Scan (Q5901344) (← links)
- Dobrushin Conditions and Systematic Scan (Q5901449) (← links)
- Quasimonotone graphs (Q5915589) (← links)
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (Q5917580) (← links)
- Quasimonotone graphs (Q5918199) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
- Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
- Thick Forests (Q6512816) (← links)