| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Log-supermodular functions, functional clones and counting CSPs. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Log-supermodular functions, functional clones and counting CSPs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Velumailum Mohanaraj |
The Iterated Prisoner's Dilemma on a Cycle |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj |
On the Imitation Strategy for Games on Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Martin E. Dyer, Andrew J. Handley |
Networks of random cycles. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Velumailum Mohanaraj |
Pairwise-Interaction Games. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
The #CSP Dichotomy is Decidable. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze |
Randomly coloring random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
A Complexity Dichotomy For Hypergraph Partition Functions. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
The Complexity of #CSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
An approximation trichotomy for Boolean #CSP. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer, Dana Randall |
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
On the complexity of #CSP. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
complexity dichotomy, constraint satisfaction problem, counting problems |
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The complexity of weighted Boolean #CSP with mixed signs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
The Complexity of Weighted Boolean CSP. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Martin E. Dyer, Andrew J. Handley |
The flip markov chain and a randomising P2P protocol. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
canonical paths, randomisation, peer-to-peer, network, protocol, distributed, P2P, asynchronous, mixing time |
| 1 | Magnus Bordewich, Martin E. Dyer, Marek Karpinski |
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie |
Random walks on the vertices of transportation polytopes with constant number of sources. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Dobrushin Conditions and Systematic Scan. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Weighted Boolean #CSP with Mixed Signs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
A complexity dichotomy for hypergraph partition functions |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Colin Cooper, Martin E. Dyer, Catherine S. Greenhill |
Sampling Regular Graphs and a Peer-to-Peer Network. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On counting homomorphisms to directed acyclic graphs. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
directed acyclic graphs, homomorphisms, Counting |
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
The Complexity of Weighted Boolean #CSP |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Matrix norms and rapid mixing for spin systems |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
An approximation trichotomy for Boolean #CSP |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Magnus Bordewich, Martin E. Dyer |
Path coupling without contraction. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda |
Randomly coloring sparse random graphs with fewer colors than the maximum degree. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leen Stougie |
Computational complexity of stochastic programming problems. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin |
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On Counting Homomorphisms to Directed Acyclic Graphs. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Bordewich, Martin E. Dyer, Marek Karpinski |
Stopping Times, Metrics and Approximate Counting. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Dobrushin Conditions and Systematic Scan. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Dobrushin conditions and Systematic Scan |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
On counting homomorphisms to directed acyclic graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Magnus Bordewich, Martin E. Dyer, Marek Karpinski |
Metric Construction, Stopping Times and Path Coupling. |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Magnus Bordewich, Martin E. Dyer, Marek Karpinski |
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Colin Cooper, Martin E. Dyer, Catherine S. Greenhill |
Sampling regular graphs and a peer-to-peer network. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Bordewich, Martin E. Dyer, Marek Karpinski |
Path Coupling Using Stopping Times. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer, Dana Randall |
Approximately counting integral flows and cell-bounded contingency tables. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
integral flows, contingency tables, approximate counting |
| 1 | Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda |
Randomly coloring constant degree graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Counting and sampling H-colourings? |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill |
Corrigendum: The complexity of counting graph homomorphisms. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz |
Mixing in time and space for lattice spin systems: A combinatorial view. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda |
Randomly Coloring Constant Degree Graphs. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze, Michael Molloy |
A probabilistic analysis of randomly generated binary constraint satisfaction problems. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum |
The Relative Complexity of Approximate Counting Problems. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Computational complexity, Approximate counting |
| 1 | Martin E. Dyer, Alan M. Frieze |
Randomly coloring graphs with lower bounds on girth and maximum degree. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer |
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie |
Random walks on the vertices of transportation polytopes with constant number of sources. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll |
Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. |
DMTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer |
Approximate counting by dynamic programming. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill, Michael Molloy |
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum |
Convergence Of The Iterated Prisoner's Dilemma Game. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
On Counting Independent Sets in Sparse Graphs. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Mark Jerrum, Eric Vigoda |
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
Counting and Sampling H-Colourings. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz |
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. |
RANDOM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin |
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin E. Dyer |
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Martin E. Dyer, Alan M. Frieze |
On Markov Chains for Randomly H-Coloring a Graph. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze |
Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill |
Polynomial-time counting and sampling of two-rowed contingency tables. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill |
The complexity of counting graph homomorphisms. |
Random Struct. Algorithms |
2000 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill |
On Markov Chains for Independent Sets. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher |
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Sandeep Sen |
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher |
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill |
The complexity of counting graph homomorphisms (extended abstract). |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum |
On the relative complexity of approximate counting problems. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Russ Bubley, Martin E. Dyer |
Faster random generation of linear extensions. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum |
On Approximately Counting Colorings of Small Degree Graphs. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
On Counting Independent Sets in Sparse Graphs. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill |
A more rapidly mixing Markov chain for graph colorings. |
Random Struct. Algorithms |
1998 |
DBLP BibTeX RDF |
|
| 1 | Russ Bubley, Martin E. Dyer, Mark Jerrum |
An elementary analysis of a procedure for sampling points in a convex body. |
Random Struct. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
Approximately Counting Hamilton Paths and Cycles in Dense Graphs. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Peter Gritzmann, Alexander Hufnagel |
On the Complexity of Computing Mixed Volumes. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Russ Bubley, Martin E. Dyer |
Faster Random Generation of Linear Extensions. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Catherine S. Greenhill |
A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Ravi Kannan, John Mount |
Sampling contingency tables. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Russ Bubley, Martin E. Dyer |
Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Russ Bubley, Martin E. Dyer |
Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
P-hard counting, path coupling, combinatorial difficulty, hard combinatorial problems, TWICE-SAT, complexity, Markov chains, theorem proving, graph colouring, algorithm design, Markov chain Monte Carlo method, rapid mixing |
| 1 | Jonathan M. Nash, Peter M. Dew, Martin E. Dyer |
A Scalable Shared Queue on a Distributed Memory Machine. |
Comput. J. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Barbara M. Smith, Martin E. Dyer |
Locating the Phase Transition in Binary Constraint Satisfaction Problems. |
Artif. Intell. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan M. Nash, Peter M. Dew, John R. Davy, Martin E. Dyer |
Implementation Issues Relating to the WPRAM Model for Scalable Computing. |
Euro-Par, Vol. II |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal |
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze, Stephen Suen |
Ordering Clone Libraries in Computational Biology. |
Journal of Computational Biology |
1995 |
DBLP BibTeX RDF |
|
| 1 | Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen |
Randomized Greedy Matching II. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason |
On Key Storage in Secure Networks. |
J. Cryptology |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer |
A Parallel Algorithm for Linear Programming in Fixed Dimension. |
Symposium on Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Jonathan M. Nash, Peter M. Dew |
An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance. |
SPAA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer |
On a Universal Chain Problem. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze |
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. |
Math. Program. |
1994 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")