default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin E. Dyer
Person information
- affiliation: University of Leeds, UK
- award (2021): Gödel Prize
- award (1991): Fulkerson Prize
Other persons with a similar name
SPARQL queries 
🛈 Please note that only 74% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j100]Artem Govorov, Jin-Yi Cai, Martin E. Dyer:
A dichotomy for bounded degree graph homomorphisms with nonnegative weights. J. Comput. Syst. Sci. 132: 1-15 (2023)- [i41]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A triangle process on graphs with given degree sequence. CoRR abs/2301.08499 (2023) - [i40]Martin E. Dyer, Haiko Müller:
Thick Forests. CoRR abs/2309.01482 (2023) - 2021
- [j99]Martin E. Dyer
, Marc Heinrich, Mark Jerrum, Haiko Müller:
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Comb. Probab. Comput. 30(6): 905-921 (2021) - [j98]Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie:
Sampling hypergraphs with given degrees. Discret. Math. 344(11): 112566 (2021) - [j97]Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59(2): 204-237 (2021) - [j96]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. 35(2): 1503-1524 (2021) - [c54]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A Triangle Process on Regular Graphs. IWOCA 2021: 310-323 - 2020
- [j95]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. ACM Trans. Algorithms 16(3): 37:1-37:33 (2020) - [c53]Artem Govorov, Jin-Yi Cai, Martin E. Dyer:
A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights. ICALP 2020: 66:1-66:18 - [i39]Artem Govorov, Jin-Yi Cai, Martin E. Dyer:
A dichotomy for bounded degree graph homomorphisms with nonnegative weights. CoRR abs/2002.02021 (2020) - [i38]Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller:
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR abs/2005.07944 (2020) - [i37]Martin E. Dyer, Catherine S. Greenhill, Pieter Kleer, James Ross, Leen Stougie:
Sampling hypergraphs with given degrees. CoRR abs/2006.12021 (2020) - [i36]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
A triangle process on regular graphs. CoRR abs/2012.12972 (2020)
2010 – 2019
- 2019
- [j94]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley:
The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254: 56-79 (2019) - [j93]Martin E. Dyer, Haiko Müller:
Quasimonotone graphs. Discret. Appl. Math. 271: 25-48 (2019) - [j92]James Dyer, Martin E. Dyer, Jie Xu:
Practical homomorphic encryption over the integers for secure computation in the cloud. Int. J. Inf. Sec. 18(5): 549-579 (2019) - [j91]Martin E. Dyer, Haiko Müller:
Counting independent sets in cocomparability graphs. Inf. Process. Lett. 144: 31-36 (2019) - [j90]James Dyer, Martin E. Dyer, Karim Djemame:
Order-preserving encryption using approximate common divisors. J. Inf. Secur. Appl. 49 (2019) - [j89]Martin E. Dyer, Haiko Müller:
Counting Perfect Matchings and the Switch Chain. SIAM J. Discret. Math. 33(3): 1146-1174 (2019) - [c52]Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG 2019: 298-310 - [i35]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Triangle-creation processes on cubic graphs. CoRR abs/1905.04490 (2019) - [i34]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting weighted independent sets beyond the permanent. CoRR abs/1909.03414 (2019) - 2018
- [j88]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera:
Discordant Voting Processes on Finite Graphs. SIAM J. Discret. Math. 32(4): 2398-2420 (2018) - [c51]Martin E. Dyer, Haiko Müller:
Quasimonotone Graphs. WG 2018: 190-202 - [i33]Martin E. Dyer, Haiko Müller:
Quasimonotone graphs. CoRR abs/1801.06494 (2018) - [i32]Martin E. Dyer, Haiko Müller:
Counting Independent Sets in Cocomparability Graphs. CoRR abs/1808.09853 (2018) - [i31]Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting independent sets in graphs with bounded bipartite pathwidth. CoRR abs/1812.03195 (2018) - 2017
- [j87]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the Switch Markov Chain for Perfect Matchings. J. ACM 64(2): 12:1-12:33 (2017) - [c50]James Dyer, Martin E. Dyer, Jie Xu:
Order-Preserving Encryption Using Approximate Integer Common Divisors. DPM/CBT@ESORICS 2017: 257-274 - [c49]James Dyer, Martin E. Dyer, Jie Xu:
Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud. IMACC 2017: 44-76 - [i30]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley:
The flip Markov chain for connected regular graphs. CoRR abs/1701.03856 (2017) - [i29]James Dyer, Martin E. Dyer, Jie Xu:
Practical Homomorphic Encryption Over the Integers. CoRR abs/1702.07588 (2017) - [i28]Martin E. Dyer, Haiko Müller:
Counting perfect matchings and the switch chain. CoRR abs/1705.05790 (2017) - [i27]James Dyer, Martin E. Dyer, Jie Xu:
Order-Preserving Encryption Using Approximate Integer Common Divisors. CoRR abs/1706.00324 (2017) - [i26]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. CoRR abs/1707.02467 (2017) - 2016
- [j86]Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 matrix partitions of graphs. Discret. Appl. Math. 213: 76-92 (2016) - [c48]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera:
Discordant Voting Processes on Finite Graphs. ICALP 2016: 145:1-145:13 - [c47]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the switch Markov chain for perfect matchings. SODA 2016: 1972-1983 - [i25]Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera:
Discordant voting processes on finite graphs. CoRR abs/1604.06884 (2016) - 2015
- [j85]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 81(1): 311-329 (2015) - [j84]Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill:
On the chromatic number of a random hypergraph. J. Comb. Theory B 113: 68-122 (2015) - [j83]Martin E. Dyer, Leen Stougie:
Erratum to: Computational complexity of stochastic programming problems. Math. Program. 153(2): 723-725 (2015) - [i24]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the switch Markov chain for perfect matchings. CoRR abs/1501.07725 (2015) - 2014
- [j82]Martin E. Dyer, Ravi Kannan, Leen Stougie:
A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming. Math. Program. 147(1-2): 207-229 (2014) - [i23]Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 Matrix Partitions of Graphs. CoRR abs/1407.7799 (2014) - 2013
- [j81]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan:
The expressibility of functions on the boolean domain, with applications to counting CSPs. J. ACM 60(5): 32:1-32:36 (2013) - [j80]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Random Struct. Algorithms 43(2): 181-200 (2013) - [j79]Martin E. Dyer, David Richerby:
An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM J. Comput. 42(3): 1245-1274 (2013) - [c46]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 - 2012
- [j78]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220: 1-14 (2012) - [j77]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. 78(2): 681-688 (2012) - [c45]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313 - [i22]Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill:
On the chromatic number of a random hypergraph. CoRR abs/1208.0812 (2012) - [i21]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) - 2011
- [c44]Martin E. Dyer, Velumailum Mohanaraj:
Pairwise-Interaction Games. ICALP (1) 2011: 159-170 - [c43]Colin Cooper, Martin E. Dyer, Andrew J. Handley:
Networks of random cycles. SODA 2011: 933-944 - [c42]Martin E. Dyer, David Richerby:
The #CSP Dichotomy is Decidable. STACS 2011: 261-272 - [i20]Martin E. Dyer, Velumailum Mohanaraj:
The Iterated Prisoner's Dilemma on a Cycle. CoRR abs/1102.3822 (2011) - [i19]Colin Cooper, Martin E. Dyer, Velumailum Mohanaraj:
On the Imitation Strategy for Games on Graphs. CoRR abs/1102.3879 (2011) - [i18]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Log-supermodular functions, functional clones and counting CSPs. CoRR abs/1108.5288 (2011) - [i17]Martin E. Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski:
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). Dagstuhl Reports 1(6): 24-53 (2011) - 2010
- [j76]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Dichotomy For Hypergraph Partition Functions. Comput. Complex. 19(4): 605-633 (2010) - [j75]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. J. Comput. Syst. Sci. 76(3-4): 267-277 (2010) - [j74]Martin E. Dyer, Alan M. Frieze:
Randomly coloring random graphs. Random Struct. Algorithms 36(3): 251-272 (2010) - [j73]Mary Cryan, Martin E. Dyer, Dana Randall:
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. SIAM J. Comput. 39(7): 2683-2703 (2010) - [c41]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334 - [c40]Martin E. Dyer, David Richerby:
On the complexity of #CSP. STOC 2010: 725-734 - [i16]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract). CoRR abs/1001.4987 (2010) - [i15]Martin E. Dyer, David Richerby:
The Complexity of #CSP. CoRR abs/1003.3879 (2010) - [i14]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. CoRR abs/1005.2678 (2010)
2000 – 2009
- 2009
- [j72]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Weighted Boolean #CSP. SIAM J. Comput. 38(5): 1970-1986 (2009) - [j71]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. 410(38-40): 3949-3961 (2009) - [c39]Colin Cooper, Martin E. Dyer, Andrew J. Handley:
The flip markov chain and a randomising P2P protocol. PODC 2009: 141-150 - [i13]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. CoRR abs/0907.2663 (2009) - 2008
- [j70]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. Comb. Probab. Comput. 17(6): 761-779 (2008) - [j69]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Random Struct. Algorithms 32(3): 375-399 (2008) - [j68]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 33(3): 333-355 (2008) - [e2]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008. Dagstuhl Seminar Proceedings 08201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i12]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms 2008 - [i11]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
A complexity dichotomy for hypergraph partition functions. CoRR abs/0811.0037 (2008) - [i10]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Weighted Boolean #CSP with Mixed Signs. CoRR abs/0812.4171 (2008) - 2007
- [j67]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Sampling Regular Graphs and a Peer-to-Peer Network. Comb. Probab. Comput. 16(4): 557-593 (2007) - [j66]Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson:
On counting homomorphisms to directed acyclic graphs. J. ACM 54(6): 27 (2007) - [j65]Magnus Bordewich, Martin E. Dyer:
Path coupling without contraction. J. Discrete Algorithms 5(2): 280-292 (2007) - [i9]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Weighted Boolean #CSP. CoRR abs/0704.3683 (2007) - [i8]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
An approximation trichotomy for Boolean #CSP. CoRR abs/0710.4272 (2007) - [i7]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Matrix norms and rapid mixing for spin systems. CoRR abs/math/0702744 (2007) - 2006
- [j64]Martin E. Dyer, Leen Stougie:
Computational complexity of stochastic programming problems. Math. Program. 106(3): 423-432 (2006) - [j63]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 29(4): 450-465 (2006) - [j62]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. 36(1): 247-278 (2006) - [c38]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. APPROX-RANDOM 2006: 327-338 - [c37]Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson:
On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) 2006: 38-49 - [c36]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Stopping Times, Metrics and Approximate Counting. ICALP (1) 2006: 108-119 - 2005
- [c35]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path Coupling Using Stopping Times. FCT 2005: 19-31 - [c34]Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Sampling regular graphs and a peer-to-peer network. SODA 2005: 980-988 - [c33]Mary Cryan, Martin E. Dyer, Dana Randall:
Approximately counting integral flows and cell-bounded contingency tables. STOC 2005: 413-422 - [e1]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
Design and Analysis of Randomized and Approximation Algorithms, 15.05. - 20.05.2005. Dagstuhl Seminar Proceedings 05201, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 [contents] - [i6]Martin E. Dyer, Mark Jerrum, Marek Karpinski:
05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. Design and Analysis of Randomized and Approximation Algorithms 2005 - [i5]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs. Electron. Colloquium Comput. Complex. TR05 (2005) - [i4]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin conditions and Systematic Scan. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson:
On counting homomorphisms to directed acyclic graphs. Electron. Colloquium Comput. Complex. TR05 (2005) - [i2]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Metric Construction, Stopping Times and Path Coupling. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j61]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2004) - [j60]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Counting and sampling H-colourings? Inf. Comput. 189(1): 1-16 (2004) - [j59]Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz:
Mixing in time and space for lattice spin systems: A combinatorial view. Random Struct. Algorithms 24(4): 461-479 (2004) - [j58]Martin E. Dyer, Catherine S. Greenhill:
Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms 25(3): 346-352 (2004) - [c32]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly Coloring Constant Degree Graphs. FOCS 2004: 582-589 - [r1]Martin E. Dyer, Nimrod Megiddo, Emo Welzl:
Linear programming. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 999-1014 - [i1]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j57]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. 67(2): 291-310 (2003) - [j56]Martin E. Dyer, Alan M. Frieze:
Randomly coloring graphs with lower bounds on girth and maximum degree. Random Struct. Algorithms 23(2): 167-179 (2003) - [j55]Martin E. Dyer, Alan M. Frieze, Michael Molloy:
A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theor. Comput. Sci. 290(3): 1815-1828 (2003) - [c31]Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll:
Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. DMTCS 2003: 89-96 - [c30]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: 330-339 - [c29]Martin E. Dyer:
Approximate counting by dynamic programming. STOC 2003: 693-699 - 2002
- [j54]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum:
Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. 11(2): 135-147 (2002) - [j53]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 20(1): 98-114 (2002) - [j52]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
On Counting Independent Sets in Sparse Graphs. SIAM J. Comput. 31(5): 1527-1541 (2002) - [c28]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: 711-720 - [c27]Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Counting and Sampling H-Colourings. RANDOM 2002: 51-67 - [c26]Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. RANDOM 2002: 68-77 - [c25]Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz:
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. RANDOM 2002: 149-163 - [c24]Mary Cryan, Martin E. Dyer:
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. STOC 2002: 240-249 - 2001
- [j51]Colin Cooper, Martin E. Dyer, Alan M. Frieze:
On Markov Chains for Randomly H-Coloring a Graph. J. Algorithms 39(1): 117-134 (2001) - [c23]Christian Borgs, Jennifer T. Chayes, Martin E. Dyer, Prasad Tetali:
On the Sampling Problem for H-Colorings on the Hypercubic Lattice. Graphs, Morphisms and Statistical Physics 2001: 13-28 - [c22]Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. Graphs, Morphisms and Statistical Physics 2001: 87-95 - [c21]Martin E. Dyer, Alan M. Frieze:
Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. FOCS 2001: 579-587 - 2000
- [j50]Martin E. Dyer, Catherine S. Greenhill:
On Markov Chains for Independent Sets. J. Algorithms 35(1): 17-49 (2000) - [j49]Martin E. Dyer, Catherine S. Greenhill:
The complexity of counting graph homomorphisms. Random Struct. Algorithms 17(3-4): 260-289 (2000) - [j48]Martin E. Dyer, Sandeep Sen:
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems. SIAM J. Comput. 30(5): 1443-1461 (2000) - [j47]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. 30(6): 1962-1975 (2000) - [j46]Martin E. Dyer, Catherine S. Greenhill:
Polynomial-time counting and sampling of two-rowed contingency tables. Theor. Comput. Sci. 246(1-2): 265-278 (2000) - [c20]Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
On the relative complexity of approximate counting problems. APPROX 2000: 108-119 - [c19]Martin E. Dyer, Catherine S. Greenhill:
The complexity of counting graph homomorphisms (extended abstract). SODA 2000: 246-255 - [c18]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: 616-624
1990 – 1999
- 1999
- [j45]Russ Bubley, Martin E. Dyer:
Faster random generation of linear extensions. Discret. Math. 201(1-3): 81-88 (1999) - [j44]Russ Bubley, Martin E. Dyer, Catherine S. Greenhill, Mark Jerrum:
On Approximately Counting Colorings of Small Degree Graphs. SIAM J. Comput. 29(2): 387-400 (1999) - [c17]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
On Counting Independent Sets in Sparse Graphs. FOCS 1999: 210-217 - 1998
- [j43]Russ Bubley, Martin E. Dyer, Mark Jerrum:
An elementary analysis of a procedure for sampling points in a convex body. Random Struct. Algorithms 12(3): 213-235 (1998) - [j42]Martin E. Dyer, Catherine S. Greenhill:
A more rapidly mixing Markov chain for graph colorings. Random Struct. Algorithms 13(3-4): 285-317 (1998) - [j41]Martin E. Dyer, Peter Gritzmann, Alexander Hufnagel:
On the Complexity of Computing Mixed Volumes. SIAM J. Comput. 27(2): 356-400 (1998) - [j40]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM J. Comput. 27(5): 1262-1272 (1998) - [c16]Martin E. Dyer, Catherine S. Greenhill:
A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables. ICALP 1998: 339-350 - [c15]Russ Bubley, Martin E. Dyer:
Faster Random Generation of Linear Extensions. SODA 1998: 350-354 - [c14]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: 355-363 - 1997
- [j39]Martin E. Dyer, Ravi Kannan:
On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension. Math. Oper. Res. 22(3): 545-549 (1997) - [j38]Martin E. Dyer, Ravi Kannan, John Mount:
Sampling contingency tables. Random Struct. Algorithms 10(4): 487-506 (1997) - [c13]Russ Bubley, Martin E. Dyer:
Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. FOCS 1997: 223-231 - [c12]Russ Bubley, Martin E. Dyer:
Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. SODA 1997: 248-257 - 1996
- [j37]Barbara M. Smith, Martin E. Dyer:
Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artif. Intell. 81(1-2): 155-181 (1996) - [j36]Jonathan M. Nash, Peter M. Dew, Martin E. Dyer:
A Scalable Shared Queue on a Distributed Memory Machine. Comput. J. 39(6): 483-495 (1996) - [c11]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: 319-326 - 1995
- [j35]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. 56(2): 79-81 (1995) - [j34]Martin E. Dyer, Alan M. Frieze, Stephen Suen:
Ordering Clone Libraries in Computational Biology. J. Comput. Biol. 2(2): 207-218 (1995) - [j33]Martin E. Dyer, Trevor I. Fenner, Alan M. Frieze, Andrew Thomason:
On Key Storage in Secure Networks. J. Cryptol. 8(4): 189-200 (1995) - [j32]Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen:
Randomized Greedy Matching II. Random Struct. Algorithms 6(1): 55-74 (1995) - [c10]Martin E. Dyer:
A Parallel Algorithm for Linear Programming in Fixed Dimension. SCG 1995: 345-349 - [c9]Martin E. Dyer, Jonathan M. Nash, Peter M. Dew:
An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance. SPAA 1995: 21-26 - 1994
- [j31]Martin E. Dyer:
On a Universal Chain Problem. Discret. Appl. Math. 48(3): 219-229 (1994) - [j30]Martin E. Dyer, Alan M. Frieze, Stephen Suen:
The Probability of Unique Solutions of Sequencing by Hybridization. J. Comput. Biol. 1(2): 105-110 (1994) - [j29]Martin E. Dyer, Alan M. Frieze:
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. 64: 1-16 (1994) - [c8]Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen:
On the Greedy Heuristic for Matchings. SODA 1994: 141-149 - [c7]Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
Approximately Counting Hamilton Cycles in Dense Graphs. SODA 1994: 336-343 - 1993
- [j28]Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani:
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. 2: 271-284 (1993) - 1992
- [j27]Martin E. Dyer, Alan M. Frieze:
Probabilistic analysis of the generalised assignment problem. Math. Program. 55: 169-181 (1992) - [j26]Martin E. Dyer, Zoltán Füredi, Colin McDiarmid:
Volumes Spanned by Random Points in the Hypercube. Random Struct. Algorithms 3(1): 91-106 (1992) - [c6]Martin E. Dyer:
A Class of Convex Programs with Applications to Computational Geometry. SCG 1992: 9-15 - [c5]Martin E. Dyer, Alan M. Frieze:
Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm. IPCO 1992: 72-84 - 1991
- [j25]Martin E. Dyer, Alan M. Frieze, Ravi Kannan:
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM 38(1): 1-17 (1991) - [j24]Martin E. Dyer, Alan M. Frieze:
Randomized Greedy Matching. Random Struct. Algorithms 2(1): 29-46 (1991) - [j23]Martin E. Dyer, Alan M. Frieze:
Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. Random Struct. Algorithms 2(2): 233-240 (1991) - [j22]Martin E. Dyer:
On Counting Lattice Points in Polyhedra. SIAM J. Comput. 20(4): 695-707 (1991) - 1990
- [j21]Martin E. Dyer, Alan M. Frieze:
On an optimization problem with nested constraints. Discret. Appl. Math. 26(2-3): 159-173 (1990) - [j20]Martin E. Dyer, Laurence A. Wolsey:
Formulating the single machine sequencing problem with release dates as a mixed integer program. Discret. Appl. Math. 26(2-3): 255-270 (1990) - [j19]Martin E. Dyer, Alan M. Frieze:
On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. Math. Program. 46: 361-378 (1990) - [c4]Martin E. Dyer, Zoltán Füredi, Colin McDiarmid:
Random Volumes in the n-Cube. Polyhedral Combinatorics 1990: 33-38 - [c3]Martin E. Dyer, Alan M. Frieze:
Probabilistic Analysis of the Generalised Assignment Problem. IPCO 1990: 189-200
1980 – 1989
- 1989
- [j18]Martin E. Dyer, Alan M. Frieze:
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. J. Algorithms 10(4): 451-489 (1989) - [j17]Martin E. Dyer, Alan M. Frieze:
Probabilistic Analysis of the Multidimensional Knapsack Problem. Math. Oper. Res. 14(1): 162-176 (1989) - [j16]Martin E. Dyer, Alan M. Frieze:
A randomized algorithm for fixed-dimensional linear programming. Math. Program. 44(1-3): 203-212 (1989) - [c2]Martin E. Dyer, Alan M. Frieze, Ravi Kannan:
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. STOC 1989: 375-381 - 1988
- [j15]Martin E. Dyer, Alan M. Frieze:
On the Complexity of Computing the Volume of a Polyhedron. SIAM J. Comput. 17(5): 967-974 (1988) - 1987
- [j14]Martin E. Dyer, John Walker:
An algorithm for a separable integer programming problem with cumulatively bounded variables. Discret. Appl. Math. 16(2): 135-149 (1987) - 1986
- [j13]Martin E. Dyer, Alan M. Frieze:
Planar 3DM is NP-Complete. J. Algorithms 7(2): 174-184 (1986) - [j12]Martin E. Dyer, Alan M. Frieze, Colin J. H. McDiarmid:
On linear programs with random costs. Math. Program. 35(1): 3-16 (1986) - [j11]Martin E. Dyer:
On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem. SIAM J. Comput. 15(3): 725-738 (1986) - [c1]Martin E. Dyer, Alan M. Frieze:
Fast Solution of Some Random NP-Hard Problems. FOCS 1986: 331-336 - 1985
- [j10]Martin E. Dyer, Alan M. Frieze:
On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. 10(2): 139-153 (1985) - 1984
- [j9]Martin E. Dyer, Alan M. Frieze:
A Partitioning Algorithm for Minimum Weighted Euclidean Matching. Inf. Process. Lett. 18(2): 59-62 (1984) - [j8]Martin E. Dyer:
An O(n) algorithm for the multiple-choice knapsack linear program. Math. Program. 29(1): 57-63 (1984) - [j7]Martin E. Dyer:
Linear Time Algorithms for Two- and Three-Variable Linear Programs. SIAM J. Comput. 13(1): 31-45 (1984) - 1983
- [j6]Martin E. Dyer:
The Complexity of Vertex Enumeration Methods. Math. Oper. Res. 8(3): 381-402 (1983) - [j5]Martin E. Dyer, John Walker:
A note on bicriterion programming. Math. Program. 27(3): 355-361 (1983) - 1982
- [j4]Martin E. Dyer, John Walker:
Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints. Math. Program. 24(1): 107-112 (1982) - 1980
- [j3]Martin E. Dyer, Les G. Proll:
Eliminating extraneous edges in Greenberg's algorithm. Math. Program. 19(1): 106-110 (1980) - [j2]Martin E. Dyer:
Calculating surrogate constraints. Math. Program. 19(1): 255-278 (1980)
1970 – 1979
- 1977
- [j1]Martin E. Dyer, Les G. Proll:
An algorithm for determining all extreme points of a convex polytope. Math. Program. 12(1): 81-96 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 01:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
