Martin E. Dyer

200 papers A* 26A 4B 6C 2Journal 141Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Thick Forests. Discret. Appl. Math. Martin E. Dyer, Haiko Müller
2025	J	`jnl`	Triangle Processes on Graphs With Given Degree Sequence. Random Struct. Algorithms Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2023	J	`jnl`	A dichotomy for bounded degree graph homomorphisms with nonnegative weights. J. Comput. Syst. Sci. Artem Govorov, Jin-Yi Cai, Martin E. Dyer
2023	J	`jnl`	A triangle process on graphs with given degree sequence. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2023	J	`jnl`	Thick Forests. CoRR Martin E. Dyer, Haiko Müller
2021	C	`conf`	A Triangle Process on Regular Graphs. IWOCA Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2021	J	`jnl`	Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
2021	J	`jnl`	Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2021	J	`jnl`	Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Comb. Probab. Comput. Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
2021	J	`jnl`	Sampling hypergraphs with given degrees. Discret. Math. Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
2020	A*	`conf`	A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights. ICALP Artem Govorov, Jin-Yi Cai, Martin E. Dyer
2020	J	`jnl`	A dichotomy for bounded degree graph homomorphisms with nonnegative weights. CoRR Artem Govorov, Jin-Yi Cai, Martin E. Dyer
2020	J	`jnl`	A triangle process on regular graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2020	J	`jnl`	Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
2020	J	`jnl`	Random Walks on Small World Networks. ACM Trans. Algorithms Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
2020	J	`jnl`	Sampling hypergraphs with given degrees. CoRR Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie
2019	B	`conf`	Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2019	J	`jnl`	Counting Perfect Matchings and the Switch Chain. SIAM J. Discret. Math. Martin E. Dyer, Haiko Müller
2019	J	`jnl`	Counting independent sets in cocomparability graphs. Inf. Process. Lett. Martin E. Dyer, Haiko Müller
2019	J	`jnl`	Counting weighted independent sets beyond the permanent. CoRR Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
2019	J	`jnl`	Order-preserving encryption using approximate common divisors. J. Inf. Secur. Appl. James Dyer, Martin E. Dyer, Karim Djemame
2019	J	`jnl`	Practical homomorphic encryption over the integers for secure computation in the cloud. Int. J. Inf. Sec. James Dyer, Martin E. Dyer, Jie Xu
2019	J	`jnl`	Quasimonotone graphs. Discret. Appl. Math. Martin E. Dyer, Haiko Müller
2019	J	`jnl`	The flip Markov chain for connected regular graphs. Discret. Appl. Math. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
2019	J	`jnl`	Triangle-creation processes on cubic graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2018	J	`jnl`	Counting Independent Sets in Cocomparability Graphs. CoRR Martin E. Dyer, Haiko Müller
2018	J	`jnl`	Counting independent sets in graphs with bounded bipartite pathwidth. CoRR Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2018	J	`jnl`	Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera
2018	B	`conf`	Quasimonotone Graphs. WG Martin E. Dyer, Haiko Müller
2018	J	`jnl`	Quasimonotone graphs. CoRR Martin E. Dyer, Haiko Müller
2017	J	`jnl`	Counting perfect matchings and the switch chain. CoRR Martin E. Dyer, Haiko Müller
2017	J	`jnl`	On the Switch Markov Chain for Perfect Matchings. J. ACM Martin E. Dyer, Mark Jerrum, Haiko Müller
2017	—	`conf`	Order-Preserving Encryption Using Approximate Integer Common Divisors. DPM/CBT@ESORICS James Dyer, Martin E. Dyer, Jie Xu
2017	J	`jnl`	Order-Preserving Encryption Using Approximate Integer Common Divisors. CoRR James Dyer, Martin E. Dyer, Jie Xu
2017	C	`conf`	Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud. IMACC James Dyer, Martin E. Dyer, Jie Xu
2017	J	`jnl`	Practical Homomorphic Encryption Over the Integers. CoRR James Dyer, Martin E. Dyer, Jie Xu
2017	J	`jnl`	Random Walks on Small World Networks. CoRR Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda
2017	J	`jnl`	The flip Markov chain for connected regular graphs. CoRR Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley
2016	J	`jnl`	Counting 4×4 matrix partitions of graphs. Discret. Appl. Math. Martin E. Dyer, Leslie Ann Goldberg, David Richerby
2016	A*	`conf`	Discordant Voting Processes on Finite Graphs. ICALP Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
2016	J	`jnl`	Discordant voting processes on finite graphs. CoRR Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera
2016	A*	`conf`	On the switch Markov chain for perfect matchings. SODA Martin E. Dyer, Mark Jerrum, Haiko Müller
2015	J	`jnl`	Erratum to: Computational complexity of stochastic programming problems. Math. Program. Martin E. Dyer, Leen Stougie
2015	J	`jnl`	On the chromatic number of a random hypergraph. J. Comb. Theory B Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
2015	J	`jnl`	On the switch Markov chain for perfect matchings. CoRR Martin E. Dyer, Mark Jerrum, Haiko Müller
2015	J	`jnl`	The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2014	J	`jnl`	A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming. Math. Program. Martin E. Dyer, Ravi Kannan, Leen Stougie
2014	J	`jnl`	Counting 4×4 Matrix Partitions of Graphs. CoRR Martin E. Dyer, Leslie Ann Goldberg, David Richerby
2013	J	`jnl`	An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM J. Comput. Martin E. Dyer, David Richerby
2013	J	`jnl`	Randomly coloring constant degree graphs. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
2013	A	`conf`	The complexity of approximating conservative counting CSPs. STACS Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2013	J	`jnl`	The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan
2012	A	`conf`	Log-supermodular functions, functional clones and counting CSPs. STACS Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2012	J	`jnl`	On the chromatic number of a random hypergraph CoRR Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill
2012	J	`jnl`	The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2012	J	`jnl`	The complexity of approximating conservative counting CSPs CoRR Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
2012	J	`jnl`	The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2011	J	`jnl`	Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). Dagstuhl Reports Martin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski
2011	J	`jnl`	Log-supermodular functions, functional clones and counting CSPs CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2011	A*	`conf`	Networks of random cycles. SODA Colin Cooper, Martin E. Dyer, Andrew J. Handley
2011	J	`jnl`	On the Imitation Strategy for Games on Graphs CoRR Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj
2011	—	`conf`	Pairwise-Interaction Games. ICALP (1) Martin E. Dyer, Velumailum Mohanaraj
2011	A	`conf`	The #CSP Dichotomy is Decidable. STACS Martin E. Dyer, David Richerby
2011	J	`jnl`	The Iterated Prisoner's Dilemma on a Cycle CoRR Martin E. Dyer, Velumailum Mohanaraj
2010	J	`jnl`	A Complexity Dichotomy For Hypergraph Partition Functions. Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2010	J	`jnl`	Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. SIAM J. Comput. Mary Cryan, Martin E. Dyer, Dana Randall
2010	A*	`conf`	On the complexity of #CSP. STOC Martin E. Dyer, David Richerby
2010	J	`jnl`	Randomly coloring random graphs. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
2010	J	`jnl`	The Complexity of #CSP CoRR Martin E. Dyer, David Richerby
2010	J	`jnl`	The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) CoRR Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2010	A	`conf`	The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2010	J	`jnl`	The complexity of weighted and unweighted #CSP CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2009	J	`jnl`	The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2009	J	`jnl`	The Complexity of Weighted Boolean #CSP. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2009	J	`jnl`	The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2009	A*	`conf`	The flip markov chain and a randomising P2P protocol. PODC Colin Cooper, Martin E. Dyer, Andrew J. Handley
2008	—	`conf`	08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2008	J	`jnl`	A complexity dichotomy for hypergraph partition functions CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2008	—	`ed.`	Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008 Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2008	J	`jnl`	Dobrushin Conditions and Systematic Scan. Comb. Probab. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2008	J	`jnl`	Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Random Struct. Algorithms Magnus Bordewich, Martin E. Dyer, Marek Karpinski
2008	J	`jnl`	Random walks on the vertices of transportation polytopes with constant number of sources. Random Struct. Algorithms Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
2008	J	`jnl`	The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2007	J	`jnl`	An approximation trichotomy for Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	Matrix norms and rapid mixing for spin systems CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2007	J	`jnl`	On counting homomorphisms to directed acyclic graphs. J. ACM Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
2007	J	`jnl`	Path coupling without contraction. J. Discrete Algorithms Magnus Bordewich, Martin E. Dyer
2007	J	`jnl`	Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2007	J	`jnl`	The Complexity of Weighted Boolean #CSP CoRR Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2006	J	`jnl`	Computational complexity of stochastic programming problems. Math. Program. Martin E. Dyer, Leen Stougie
2006	—	`conf`	Dobrushin Conditions and Systematic Scan. APPROX-RANDOM Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2006	—	`conf`	On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
2006	J	`jnl`	Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda
2006	J	`jnl`	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. SIAM J. Comput. Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
2006	—	`conf`	Stopping Times, Metrics and Approximate Counting. ICALP (1) Magnus Bordewich, Martin E. Dyer, Marek Karpinski
2005	—	`conf`	05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2005	A*	`conf`	Approximately counting integral flows and cell-bounded contingency tables. STOC Mary Cryan, Martin E. Dyer, Dana Randall
2005	—	`ed.`	Design and Analysis of Randomized and Approximation Algorithms, 15.05. - 20.05.2005 Design and Analysis of Randomized and Approximation Algorithms Martin E. Dyer, Mark Jerrum, Marek Karpinski
2005	J	`jnl`	Dobrushin conditions and Systematic Scan Electron. Colloquium Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2005	J	`jnl`	Metric Construction, Stopping Times and Path Coupling. Electron. Colloquium Comput. Complex. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
2005	J	`jnl`	On counting homomorphisms to directed acyclic graphs Electron. Colloquium Comput. Complex. Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
2005	J	`jnl`	Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs Electron. Colloquium Comput. Complex. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
2005	B	`conf`	Path Coupling Using Stopping Times. FCT Magnus Bordewich, Martin E. Dyer, Marek Karpinski
2005	A*	`conf`	Sampling regular graphs and a peer-to-peer network. SODA Colin Cooper, Martin E. Dyer, Catherine S. Greenhill
2004	J	`jnl`	Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill
2004	J	`jnl`	Counting and sampling H-colourings? Inf. Comput. Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2004	—	`ch.`	Linear programming. Handbook of Discrete and Computational Geometry, 2nd Ed. Martin E. Dyer, Nimrod Megiddo, Emo Welzl
2004	J	`jnl`	Mixing in time and space for lattice spin systems: A combinatorial view. Random Struct. Algorithms Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
2004	A*	`conf`	Randomly Coloring Constant Degree Graphs. FOCS Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
2004	J	`jnl`	Randomly coloring constant degree graphs Electron. Colloquium Comput. Complex. Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
2004	J	`jnl`	The Relative Complexity of Approximate Counting Problems. Algorithmica Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
2003	J	`jnl`	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. J. Comput. Syst. Sci. Mary Cryan, Martin E. Dyer
2003	J	`jnl`	A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theor. Comput. Sci. Martin E. Dyer, Alan M. Frieze, Michael Molloy
2003	A*	`conf`	Approximate counting by dynamic programming. STOC Martin E. Dyer
2003	—	`conf`	Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. DMTCS Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll
2003	A*	`conf`	Random walks on the vertices of transportation polytopes with constant number of sources. SODA Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
2003	J	`jnl`	Randomly coloring graphs with lower bounds on girth and maximum degree. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
2002	A*	`conf`	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. STOC Mary Cryan, Martin E. Dyer
2002	J	`jnl`	Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
2002	—	`conf`	Counting and Sampling H-Colourings. RANDOM Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
2002	—	`conf`	Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. RANDOM Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
2002	J	`jnl`	On Counting Independent Sets in Sparse Graphs. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
2002	—	`conf`	Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. RANDOM Martin E. Dyer, Mark Jerrum, Eric Vigoda
2002	A*	`conf`	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. FOCS Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
2002	J	`jnl`	Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill, Michael Molloy
2001	J	`jnl`	On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms Colin Cooper, Martin E. Dyer, Alan M. Frieze
2001	—	`conf`	On the Sampling Problem for H-Colorings on the Hypercubic Lattice. Graphs, Morphisms and Statistical Physics Christian Borgs, Jennifer T. Chayes, Martin E. Dyer, Prasad Tetali
2001	A*	`conf`	Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. FOCS Martin E. Dyer, Alan M. Frieze
2001	—	`conf`	Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. Graphs, Morphisms and Statistical Physics Martin E. Dyer, Mark Jerrum, Eric Vigoda
2000	J	`jnl`	An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. SIAM J. Comput. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	A*	`conf`	An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). SODA Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher
2000	J	`jnl`	Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems. SIAM J. Comput. Martin E. Dyer, Sandeep Sen
2000	J	`jnl`	On Markov Chains for Independent Sets. J. Algorithms Martin E. Dyer, Catherine S. Greenhill
2000	—	`conf`	On the relative complexity of approximate counting problems. APPROX Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
2000	J	`jnl`	Polynomial-time counting and sampling of two-rowed contingency tables. Theor. Comput. Sci. Martin E. Dyer, Catherine S. Greenhill
2000	A*	`conf`	The complexity of counting graph homomorphisms (extended abstract). SODA Martin E. Dyer, Catherine S. Greenhill
2000	J	`jnl`	The complexity of counting graph homomorphisms. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill
1999	J	`jnl`	Faster random generation of linear extensions. Discret. Math. Russ Bubley, Martin E. Dyer
1999	J	`jnl`	On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum
1999	A*	`conf`	On Counting Independent Sets in Sparse Graphs. FOCS Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1998	A*	`conf`	A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. ICALP Martin E. Dyer, Catherine S. Greenhill
1998	J	`jnl`	A more rapidly mixing Markov chain for graph colorings. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill
1998	J	`jnl`	An elementary analysis of a procedure for sampling points in a convex body. Random Struct. Algorithms Russ Bubley, Martin E. Dyer, Mark Jerrum
1998	J	`jnl`	Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1998	A*	`conf`	Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. SODA Russ Bubley, Martin E. Dyer, Catherine S. Greenhill
1998	A*	`conf`	Faster Random Generation of Linear Extensions. SODA Russ Bubley, Martin E. Dyer
1998	J	`jnl`	On the Complexity of Computing Mixed Volumes. SIAM J. Comput. Martin E. Dyer, Peter Gritzmann, Alexander Hufnagel
1997	A*	`conf`	Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. SODA Russ Bubley, Martin E. Dyer
1997	J	`jnl`	On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension. Math. Oper. Res. Martin E. Dyer, Ravi Kannan
1997	A*	`conf`	Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. FOCS Russ Bubley, Martin E. Dyer
1997	J	`jnl`	Sampling contingency tables. Random Struct. Algorithms Martin E. Dyer, Ravi Kannan, John Mount
1996	J	`jnl`	A Scalable Shared Queue on a Distributed Memory Machine. Comput. J. Jonathan M. Nash, Peter M. Dew, Martin E. Dyer
1996	—	`conf`	Implementation Issues Relating to the WPRAM Model for Scalable Computing. Euro-Par, Vol. II Jonathan M. Nash, Peter M. Dew, John R. Davy, Martin E. Dyer
1996	J	`jnl`	Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artif. Intell. Barbara M. Smith, Martin E. Dyer
1995	—	`conf`	A Parallel Algorithm for Linear Programming in Fixed Dimension. SCG Martin E. Dyer
1995	B	`conf`	An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance. SPAA Martin E. Dyer, Jonathan M. Nash, Peter M. Dew
1995	J	`jnl`	On Key Storage in Secure Networks. J. Cryptol. Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason
1995	J	`jnl`	Ordering Clone Libraries in Computational Biology. J. Comput. Biol. Martin E. Dyer, Alan M. Frieze, Stephen Suen
1995	J	`jnl`	Randomized Greedy Matching II. Random Struct. Algorithms Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
1995	J	`jnl`	The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Inf. Process. Lett. Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal
1994	A*	`conf`	Approximately Counting Hamilton Cycles in Dense Graphs. SODA Martin E. Dyer, Alan M. Frieze, Mark Jerrum
1994	J	`jnl`	On a Universal Chain Problem. Discret. Appl. Math. Martin E. Dyer
1994	A*	`conf`	On the Greedy Heuristic for Matchings. SODA Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen
1994	J	`jnl`	Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. Martin E. Dyer, Alan M. Frieze
1994	J	`jnl`	The Probability of Unique Solutions of Sequencing by Hybridization. J. Comput. Biol. Martin E. Dyer, Alan M. Frieze, Stephen Suen
1993	J	`jnl`	A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
1992	—	`conf`	A Class of Convex Programs with Applications to Computational Geometry. SCG Martin E. Dyer
1992	J	`jnl`	Probabilistic analysis of the generalised assignment problem. Math. Program. Martin E. Dyer, Alan M. Frieze
1992	B	`conf`	Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. IPCO Martin E. Dyer, Alan M. Frieze
1992	J	`jnl`	Volumes Spanned by Random Points in the Hypercube. Random Struct. Algorithms Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
1991	J	`jnl`	A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM Martin E. Dyer, Alan M. Frieze, Ravi Kannan
1991	J	`jnl`	On Counting Lattice Points in Polyhedra. SIAM J. Comput. Martin E. Dyer
1991	J	`jnl`	Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
1991	J	`jnl`	Randomized Greedy Matching. Random Struct. Algorithms Martin E. Dyer, Alan M. Frieze
1990	J	`jnl`	Formulating the single machine sequencing problem with release dates as a mixed integer program. Discret. Appl. Math. Martin E. Dyer, Laurence A. Wolsey
1990	J	`jnl`	On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. Math. Program. Martin E. Dyer, Alan M. Frieze
1990	J	`jnl`	On an optimization problem with nested constraints. Discret. Appl. Math. Martin E. Dyer, Alan M. Frieze
1990	B	`conf`	Probabilistic Analysis of the Generalised Assignment Problem. IPCO Martin E. Dyer, Alan M. Frieze
1990	—	`conf`	Random Volumes in the n-Cube. Polyhedral Combinatorics Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
1989	A*	`conf`	A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies STOC Martin E. Dyer, Alan M. Frieze, Ravi Kannan
1989	J	`jnl`	A randomized algorithm for fixed-dimensional linear programming. Math. Program. Martin E. Dyer, Alan M. Frieze
1989	J	`jnl`	Probabilistic Analysis of the Multidimensional Knapsack Problem. Math. Oper. Res. Martin E. Dyer, Alan M. Frieze
1989	J	`jnl`	The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. J. Algorithms Martin E. Dyer, Alan M. Frieze
1988	J	`jnl`	On the Complexity of Computing the Volume of a Polyhedron. SIAM J. Comput. Martin E. Dyer, Alan M. Frieze
1987	J	`jnl`	An algorithm for a separable integer programming problem with cumulatively bounded variables. Discret. Appl. Math. Martin E. Dyer, John Walker
1986	A*	`conf`	Fast Solution of Some Random NP-Hard Problems FOCS Martin E. Dyer, Alan M. Frieze
1986	J	`jnl`	On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem. SIAM J. Comput. Martin E. Dyer
1986	J	`jnl`	On linear programs with random costs. Math. Program. Martin E. Dyer, Alan M. Frieze, Colin J. H. McDiarmid
1986	J	`jnl`	Planar 3DM is NP-Complete. J. Algorithms Martin E. Dyer, Alan M. Frieze
1985	J	`jnl`	On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. Martin E. Dyer, Alan M. Frieze
1984	J	`jnl`	A Partitioning Algorithm for Minimum Weighted Euclidean Matching. Inf. Process. Lett. Martin E. Dyer, Alan M. Frieze
1984	J	`jnl`	An O( Math. Program. Martin E. Dyer
1984	J	`jnl`	Linear Time Algorithms for Two- and Three-Variable Linear Programs. SIAM J. Comput. Martin E. Dyer
1983	J	`jnl`	A note on bicriterion programming. Math. Program. Martin E. Dyer, John Walker
1983	J	`jnl`	The Complexity of Vertex Enumeration Methods. Math. Oper. Res. Martin E. Dyer
1982	J	`jnl`	Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints. Math. Program. Martin E. Dyer, John Walker
1980	J	`jnl`	Calculating surrogate constraints. Math. Program. Martin E. Dyer
1980	J	`jnl`	Eliminating extraneous edges in Greenberg's algorithm. Math. Program. Martin E. Dyer, Les G. Proll
1977	J	`jnl`	An algorithm for determining all extreme points of a convex polytope. Math. Program. Martin E. Dyer, Les G. Proll