| 2021 | IWOCA | A Triangle Process on Regular Graphs. | Colin Cooper, Martin E. Dyer, Catherine S. Greenhill |
| 2020 | ICALP | A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights. | Artem Govorov, Jin-Yi Cai, Martin E. Dyer |
| 2019 | WG | Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. | Martin E. Dyer, Catherine S. Greenhill, Haiko Mller |
| 2018 | WG | Quasimonotone Graphs. | Martin E. Dyer, Haiko Mller |
| 2017 | ESORICS | Order-Preserving Encryption Using Approximate Integer Common Divisors. | James Dyer, Martin E. Dyer, Jie Xu |
| 2016 | ICALP | Discordant Voting Processes on Finite Graphs. | Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera |
| 2016 | SODA | On the switch Markov chain for perfect matchings. | Martin E. Dyer, Mark Jerrum, Haiko Mller |
| 2013 | STACS | The complexity of approximating conservative counting CSPs. | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby |
| 2012 | STACS | Log-supermodular functions, functional clones and counting CSPs. | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
| 2011 | ICALP | Pairwise-Interaction Games. | Martin E. Dyer, Velumailum Mohanaraj |
| 2011 | SODA | Networks of random cycles. | Colin Cooper, Martin E. Dyer, Andrew J. Handley |
| 2011 | STACS | The #CSP Dichotomy is Decidable. | Martin E. Dyer, David Richerby |
| 2010 | STOC | On the complexity of #CSP. | Martin E. Dyer, David Richerby |
| 2010 | STACS | The Complexity of Approximating Bounded-Degree Boolean #CSP. | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
| 2009 | PODC | The flip markov chain and a randomising P2P protocol. | Colin Cooper, Martin E. Dyer, Andrew J. Handley |
| 2006 | ICALP | Stopping Times, Metrics and Approximate Counting. | Magnus Bordewich, Martin E. Dyer, Marek Karpinski |
| 2006 | ICALP | On Counting Homomorphisms to Directed Acyclic Graphs. | Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson |
| 2005 | FCT | Path Coupling Using Stopping Times. | Magnus Bordewich, Martin E. Dyer, Marek Karpinski |
| 2005 | SODA | Sampling regular graphs and a peer-to-peer network. | Colin Cooper, Martin E. Dyer, Catherine S. Greenhill |
| 2005 | STOC | Approximately counting integral flows and cell-bounded contingency tables. | Mary Cryan, Martin E. Dyer, Dana Randall |
| 2004 | FOCS | Randomly Coloring Constant Degree Graphs. | Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda |
| 2003 | SODA | Random walks on the vertices of transportation polytopes with constant number of sources. | Mary Cryan, Martin E. Dyer, Haiko Mller, Leen Stougie |
| 2003 | STOC | Approximate counting by dynamic programming. | Martin E. Dyer |
| 2002 | FOCS | Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. | Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin |
| 2002 | STOC | A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. | Mary Cryan, Martin E. Dyer |
| 2001 | FOCS | Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. | Martin E. Dyer, Alan M. Frieze |
| 2000 | SODA | The complexity of counting graph homomorphisms (extended abstract). | Martin E. Dyer, Catherine S. Greenhill |
| 2000 | SODA | An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher |
| 1999 | FOCS | On Counting Independent Sets in Sparse Graphs. | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
| 1998 | ICALP | A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. | Martin E. Dyer, Catherine S. Greenhill |
| 1998 | SODA | Faster Random Generation of Linear Extensions. | Russ Bubley, Martin E. Dyer |
| 1998 | SODA | Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. | Russ Bubley, Martin E. Dyer, Catherine S. Greenhill |
| 1997 | FOCS | Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. | Russ Bubley, Martin E. Dyer |
| 1997 | SODA | Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. | Russ Bubley, Martin E. Dyer |
| 1996 | EuroPar | Implementation Issues Relating to the WPRAM Model for Scalable Computing. | Jonathan M. Nash, Peter M. Dew, John R. Davy, Martin E. Dyer |
| 1995 | SPAA | An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance. | Martin E. Dyer, Jonathan M. Nash, Peter M. Dew |
| 1994 | SODA | On the Greedy Heuristic for Matchings. | Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen |
| 1994 | SODA | Approximately Counting Hamilton Cycles in Dense Graphs. | Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
| 1992 | IPCO | Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. | Martin E. Dyer, Alan M. Frieze |
| 1990 | IPCO | Probabilistic Analysis of the Generalised Assignment Problem. | Martin E. Dyer, Alan M. Frieze |
| 1989 | STOC | A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies | Martin E. Dyer, Alan M. Frieze, Ravi Kannan |
| 1986 | FOCS | Fast Solution of Some Random NP-Hard Problems | Martin E. Dyer, Alan M. Frieze |