×
Author ID: dyer.martin-e Recent zbMATH articles by "Dyer, Martin E."
Published as: Dyer, Martin; Dyer, M. E.; Dyer, Martin E.
External Links: MGP · ORCID · Wikidata · dblp · GND

Publications by Year

Citations contained in zbMATH Open

138 Publications have been cited 2,165 times in 1,527 Documents Cited by Year
A random polynomial-time algorithm for approximating the volume of convex bodies. Zbl 0799.68107
Dyer, Martin; Frieze, Alan; Kannan, Ravi
132
1991
On the complexity of computing the volume of a polyhedron. Zbl 0668.68049
Dyer, M. E.; Frieze, A. M.
85
1988
The complexity of counting graph homomorphisms. Zbl 0965.68073
Dyer, Martin; Greenhill, Catherine
72
2000
The relative complexity of approximate counting problems. Zbl 1138.68424
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark
68
2004
Formulating the single machine sequencing problem with release dates as a mixed integer program. Zbl 0694.90060
Dyer, Martin E.; Wolsey, Laurence A.
68
1990
Linear time algorithms for two- and three-variable linear programs. Zbl 0532.90063
Dyer, M. E.
60
1984
On the complexity of partitioning graphs into connected subgraphs. Zbl 0562.68030
Dyer, M. E.; Frieze, A. M.
60
1985
Planar 3DM is NP-complete. Zbl 0606.68065
Dyer, M. E.; Frieze, A. M.
60
1986
On a multidimensional search technique and its application to the Euclidean one-centre problem. Zbl 0613.68044
Dyer, M. E.
52
1986
Computational complexity of stochastic programming problems. Zbl 1134.90027
Dyer, Martin; Stougie, Leen
49
2006
The complexity of vertex enumeration methods. Zbl 0531.90064
Dyer, M. E.
44
1983
On counting independent sets in sparse graphs. Zbl 1041.68045
Dyer, Martin; Frieze, Alan; Jerrum, Mark
44
2002
Randomly coloring sparse random graphs with fewer colors than the maximum degree. Zbl 1115.05030
Dyer, Martin; Flaxman, Abraham D.; Frieze, Alan M.; Vigoda, Eric
43
2006
The complexity of weighted Boolean #CSP. Zbl 1191.68351
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
39
2009
A simple heuristic for the p-centre problem. Zbl 0556.90019
Dyer, M. E.; Frieze, A. M.
38
1985
Calculating surrogate constraints. Zbl 0464.90067
Dyer, M. E.
37
1980
The solution of some random NP-hard problems in polynomial expected time. Zbl 0689.68049
Dyer, M. E.; Frieze, A. M.
36
1989
Mixing in time and space for lattice spin systems: a combinatorial view. Zbl 1126.82021
Dyer, Martin; Sinclair, Alistair; Vigoda, Eric; Weitz, Dror
36
2004
An algorithm for determining all extreme points of a convex polytope. Zbl 0378.90059
Dyer, M. E.; Proll, L. G.
36
1977
Sampling regular graphs and a peer-to-peer network. Zbl 1137.05065
Cooper, Colin; Dyer, Martin; Greenhill, Catherine
36
2007
An O(n) algorithm for the multiple-choice knapsack linear program. Zbl 0532.90068
Dyer, M. E.
35
1984
Computing the volume of convex bodies: A case where randomness provably helps. Zbl 0754.68052
Dyer, Martin; Frieze, Alan
35
1991
On Markov chains for independent sets. Zbl 0961.05063
Dyer, Martin; Greenhill, Catherine
33
2000
An effective dichotomy for the counting constraint satisfaction problem. Zbl 1275.68077
Dyer, Martin; Richerby, David
32
2013
On the complexity of computing mixed volumes. Zbl 0909.68193
Dyer, Martin; Gritzmann, Peter; Hufnagel, Alexander
30
1998
An approximation trichotomy for Boolean #CSP. Zbl 1201.68154
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
28
2010
On counting homomorphisms to directed acyclic graphs. Zbl 1312.68098
Dyer, Martin E.; Goldberg, Leslie Ann; Paterson, Mike
27
2007
Markov chain comparison. Zbl 1189.60135
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Martin, Russell
27
2006
Sampling contingency tables. Zbl 0884.62065
Dyer, Martin; Kannan, Ravi; Mount, John
26
1997
On the chromatic number of a random hypergraph. Zbl 1315.05051
Dyer, Martin; Frieze, Alan; Greenhill, Catherine
26
2015
Graph orientations with no sink and an approximation for a hard case of #SAT. Zbl 1321.68378
Bubley, Russ; Dyer, Martin
26
1997
Faster random generation of linear extensions. Zbl 0934.65005
Bubley, Russ; Dyer, Martin
24
1999
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Zbl 0820.90066
Dyer, Martin; Frieze, Alan
24
1994
Approximate counting by dynamic programming. Zbl 1192.90242
Dyer, Martin
24
2003
Randomly coloring constant degree graphs. Zbl 1272.05045
Dyer, Martin; Frieze, Alan; Hayes, Thomas P.; Vigoda, Eric
21
2013
Locating the phase transition in binary constraint satisfaction problems. Zbl 1508.68348
Smith, Barbara M.; Dyer, Martin E.
20
1996
Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows. Zbl 1117.62062
Cryan, Mary; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Martin, Russell
19
2006
Volumes spanned by random points in the hypercube. Zbl 0755.60013
Dyer, M. E.; Füredi, Z.; McDiarmid, C.
19
1992
A more rapidly mixing Markov chain for graph colorings. Zbl 0961.60075
Dyer, Martin; Greenhill, Catherine
18
1998
The expressibility of functions on the Boolean domain, with applications to counting CSPs. Zbl 1281.68131
Bulatov, Andrei A.; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Mcquillan, Colin
17
2013
On key storage in secure networks. Zbl 0840.94015
Dyer, Martin; Fenner, Trevor; Frieze, Alan; Thomason, Andrew
15
1995
On the complexity of #CSP. Zbl 1293.68165
Dyer, Martin E.; Richerby, David M.
15
2010
A randomized algorithm for fixed-dimensional linear programming. Zbl 0681.90054
Dyer, M. E.; Frieze, A. M.
14
1989
Random walks on combinatorial objects. Zbl 0946.60066
Dyer, Martin; Greenhill, Catherine
14
1999
Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids. Zbl 1019.82011
Cooper, Colin; Dyer, Martin E.; Frieze, Alan M.; Rue, Rachel
14
2000
The complexity of weighted Boolean #CSP with mixed signs. Zbl 1171.68013
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
14
2009
On linear programs with random costs. Zbl 0593.90061
Dyer, M. E.; Frieze, A. M.; McDiarmid, C. J. H.
14
1986
Probabilistic analysis of the multidimensional knapsack problem. Zbl 0676.90046
Dyer, M. E.; Frieze, A. M.
13
1989
Randomly coloring graphs with lower bounds on girth and maximum degree. Zbl 1028.05030
Dyer, Martin; Frieze, Alan
13
2003
The complexity of weighted and unweighted \(\#\)CSP. Zbl 1282.68110
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Jerrum, Mark; Richerby, David
13
2012
On the switch Markov chain for perfect matchings. Zbl 1426.60097
Dyer, Martin; Jerrum, Mark; Müller, Haiko
13
2017
Systematic scan for sampling colorings. Zbl 1095.60024
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
13
2006
On Barvinok’s algorithm for counting lattice points in fixed dimension. Zbl 0882.68145
Dyer, Martin; Kannan, Ravi
13
1997
Randomized greedy matching. II. Zbl 0812.05046
Aronson, Jonathan; Dyer, Martin; Frieze, Alan; Suen, Stephen
12
1995
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. Zbl 1072.68127
Cryan, Mary; Dyer, Martin
11
2003
Sampling regular graphs and a peer-to-peer network. Zbl 1297.05214
Cooper, Colin; Dyer, Martin; Greenhill, Catherine
11
2005
On approximately counting colorings of small degree graphs. Zbl 0937.05041
Bubley, Russ; Dyer, Martin; Greenhill, Catherine; Jerrum, Mark
10
1998
On the validity of marginal analysis for allocating servers in M/M/c queues. Zbl 0368.60108
Dyer, M. E.; Proll, L. G.
10
1977
A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem. Zbl 0819.90094
Dyer, Martin; Frieze, Alan; Kannan, Ravi; Kapoor, Ajai; Perkovic, Ljubomir; Vazirani, Umesh
10
1993
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Zbl 1181.05061
Bordewich, Magnus; Dyer, Martin; Karpinski, Marek
9
2008
An improved vertex enumeration algorithm. Zbl 0477.90035
Dyer, M. E.; Proll, L. G.
9
1982
A branch and bound algorithm for solving the multiple-choice knapsack problem. Zbl 0555.65039
Dyer, M. E.; Kayal, N.; Walker, J.
8
1984
Approximately counting Hamilton paths and cycles in dense graphs. Zbl 0907.68111
Dyer, Martin; Frieze, Alan; Jerrum, Mark
8
1998
On Markov chains for randomly \(H\)-coloring a graph. Zbl 0974.68149
Cooper, Colin; Dyer, Martin; Frieze, Alan
8
2001
Dobrushin conditions and systematic scan. Zbl 1168.60035
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
8
2008
Matrix norms and rapid mixing for spin systems. Zbl 1166.15015
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
8
2009
Randomized greedy matching. Zbl 0763.05080
Dyer, Martin; Frieze, Alan
8
1991
Probabilistic analysis of the generalised assignment problem. Zbl 0767.90052
Dyer, Martin; Frieze, Alan
8
1992
The complexity of approximating conservative counting CSPs. Zbl 1354.68114
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; McQuillan, Colin; Richerby, David
8
2015
Corrigendum: The complexity of counting graph homomorphisms. Zbl 1089.68076
Dyer, Martin; Greenhill, Catherine
7
2004
Random volumes in the \(n\)-cube. Zbl 0736.52002
Dyer, M. E.; Füredi, Z.; McDiarmid, C.
7
1990
The average performance of the greedy matching algorithm. Zbl 0779.60009
Dyer, Martin; Frieze, Alan; Pittel, Boris
7
1993
Convergence of the iterated prisoner’s dilemma game. Zbl 1006.60009
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Istrate, Gabriel; Jerrum, Mark
7
2002
A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem. Zbl 0828.65070
Dyer, M. E.; Riha, W. O.; Walker, J.
6
1995
The complexity of approximating bounded-degree Boolean #CSP. Zbl 1230.68105
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
6
2010
Path coupling without contraction. Zbl 1137.60046
Bordewich, Magnus; Dyer, Martin
6
2007
Faster random generation of linear extensions. Zbl 1067.68791
Bubley, Russ; Dyer, Martin
6
1998
Beating the \(2\Delta\) bound for approximately counting colourings: A computer-assisted proof of rapid mixing. Zbl 0938.68751
Bubley, Russ; Dyer, Martin; Greenhill, Catherine
6
1998
On the sampling problem for \(H\)-colorings on the hypercube lattice. Zbl 1074.05032
Borgs, Christian; Chayes, Jennifer T.; Dyer, Martin; Tetali, Prasad
6
2004
The worst-case running time of the random simplex algorithm is exponential in the height. Zbl 0875.90325
Broder, Andrei Z.; Dyer, Martin E.; Frieze, Alan M.; Raghavan, Prabhakar; Upfal, Eli
6
1995
Counting and sampling \(H\)-colourings. Zbl 1082.68079
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
6
2004
Structure and eigenvalues of heat-bath Markov chains. Zbl 1291.15082
Dyer, Martin; Greenhill, Catherine; Ullrich, Mario
6
2014
A partitioning algorithm for minimum weighted Euclidean matching. Zbl 0539.68063
Dyer, M. E.; Frieze, A. M.
5
1984
Partitioning heuristics for two geometric maximization problems. Zbl 0551.90065
Dyer, M. E.; Frieze, A. M.; McDiarmid, C. J. H.
5
1984
Approximately counting integral flows and cell-bounded contingency tables. Zbl 1217.68245
Cryan, Mary; Dyer, Martin; Randall, Dana
5
2010
The complexity of counting graph homomorphisms (Extended abstract). Zbl 0956.68103
Dyer, Martin; Greenhill, Catherine
5
2000
Analysis of heuristics for finding a maximum weight planar subgraph. Zbl 0573.90093
Dyer, M. E.; Foulds, L. R.; Frieze, A. M.
5
1985
On patching algorithms for random asymmetric travelling salesman problems. Zbl 0742.90064
Dyer, M. E.; Frieze, A. M.
5
1990
Approximately counting Hamilton cycles in dense graphs. Zbl 0867.05030
Dyer, Martin; Frieze, Alan; Jerrum, Mark
5
1994
A probabilistic analysis of randomly generated binary constraint satisfaction problems. Zbl 1055.68102
Dyer, Martin; Frieze, Alan; Molloy, Michael
5
2003
The complexity of approximating bounded-degree Boolean \(\#\)CSP. Zbl 1282.68136
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
5
2012
Dobrushin conditions and systematic scan. Zbl 1155.60331
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
4
2006
Solving the subproblem in the Lagrangian dual of separable discrete programs with linear constraints. Zbl 0489.90069
Dyer, M. E.; Walker, J.
4
1982
Pairwise-interaction games. Zbl 1332.68071
Dyer, Martin; Mohanaraj, Velumailum
4
2011
Dominance in multi-dimensional multiple-choice knapsack problems. Zbl 0917.90249
Dyer, Martin E.; Walker, John
4
1998
On counting lattice points in polyhedra. Zbl 0733.52005
Dyer, Martin
4
1991
The flip Markov chain and a randomising P2P protocol. Zbl 1291.68042
Cooper, Colin; Dyer, Martin; Handley, Andrew J.
4
2009
The complexity of approximating conservative counting CSPs. Zbl 1354.68115
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; Mcquillan, Colin; Richerby, David
4
2013
Approximately counting integral flows and cell-bounded contingency tables. Zbl 1192.68887
Cryan, Mary; Dyer, Martin; Randall, Dana
4
2005
An algorithm for a separable integer programming problem with cumulatively bounded variables. Zbl 0624.90071
Dyer, Martin E.; Walker, John
3
1987
Counting weighted independent sets beyond the permanent. Zbl 1467.05124
Dyer, Martin; Jerrum, Mark; Müller, Haiko; Vušković, Kristina
1
2021
Sampling hypergraphs with given degrees. Zbl 1472.05117
Dyer, Martin; Greenhill, Catherine; Kleer, Pieter; Ross, James; Stougie, Leen
1
2021
Random walks on small world networks. Zbl 1484.05195
Dyer, Martin E.; Galanis, Andreas; Goldberg, Leslie Ann; Jerrum, Mark; Vigoda, Eric
2
2020
The flip Markov chain for connected regular graphs. Zbl 1404.05102
Cooper, Colin; Dyer, Martin; Greenhill, Catherine; Handley, Andrew
3
2019
Counting independent sets in cocomparability graphs. Zbl 1405.05082
Dyer, Martin; Müller, Haiko
3
2019
Counting independent sets in graphs with bounded bipartite pathwidth. Zbl 07173308
Dyer, Martin; Greenhill, Catherine; Müller, Haiko
3
2019
Counting perfect matchings and the switch chain. Zbl 1432.05053
Dyer, Martin; Muller, Haiko
3
2019
Quasimonotone graphs. Zbl 1428.05255
Dyer, Martin; Müller, Haiko
1
2019
Discordant voting processes on finite graphs. Zbl 1400.68153
Cooper, Colin; Dyer, Martin; Frieze, Alan; Rivera, Nicolás
1
2018
Quasimonotone graphs. Zbl 1519.05201
Dyer, Martin; Müller, Haiko
1
2018
On the switch Markov chain for perfect matchings. Zbl 1426.60097
Dyer, Martin; Jerrum, Mark; Müller, Haiko
13
2017
Practical homomorphic encryption over the integers for secure computation in the cloud. Zbl 1397.94060
Dyer, James; Dyer, Martin; Xu, Jie
1
2017
Discordant voting processes on finite graphs. Zbl 1388.68219
Cooper, Colin; Dyer, Martin; Frieze, Alan; Rivera, Nicolás
2
2016
On the switch Markov chain for perfect matchings. Zbl 1412.60105
Dyer, Martin; Jerrum, Mark; Müller, Haiko
1
2016
On the chromatic number of a random hypergraph. Zbl 1315.05051
Dyer, Martin; Frieze, Alan; Greenhill, Catherine
26
2015
The complexity of approximating conservative counting CSPs. Zbl 1354.68114
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; McQuillan, Colin; Richerby, David
8
2015
Erratum to: “Computational complexity of stochastic programming problems”. Zbl 1331.90044
Dyer, Martin; Stougie, Leen
2
2015
Graph classes and the switch Markov chain for matchings. Zbl 1337.60171
Dyer, Martin; Müller, Haiko
1
2015
Structure and eigenvalues of heat-bath Markov chains. Zbl 1291.15082
Dyer, Martin; Greenhill, Catherine; Ullrich, Mario
6
2014
An effective dichotomy for the counting constraint satisfaction problem. Zbl 1275.68077
Dyer, Martin; Richerby, David
32
2013
Randomly coloring constant degree graphs. Zbl 1272.05045
Dyer, Martin; Frieze, Alan; Hayes, Thomas P.; Vigoda, Eric
21
2013
The expressibility of functions on the Boolean domain, with applications to counting CSPs. Zbl 1281.68131
Bulatov, Andrei A.; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Mcquillan, Colin
17
2013
The complexity of approximating conservative counting CSPs. Zbl 1354.68115
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; Mcquillan, Colin; Richerby, David
4
2013
The complexity of weighted and unweighted \(\#\)CSP. Zbl 1282.68110
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Jerrum, Mark; Richerby, David
13
2012
The complexity of approximating bounded-degree Boolean \(\#\)CSP. Zbl 1282.68136
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
5
2012
Log-supermodular functions, functional clones and counting CSPs. Zbl 1245.68100
Bulatov, Andrei A.; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
2
2012
Pairwise-interaction games. Zbl 1332.68071
Dyer, Martin; Mohanaraj, Velumailum
4
2011
The #CSP dichotomy is decidable. Zbl 1230.68078
Dyer, Martin; Richerby, David
3
2011
An approximation trichotomy for Boolean #CSP. Zbl 1201.68154
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
28
2010
On the complexity of #CSP. Zbl 1293.68165
Dyer, Martin E.; Richerby, David M.
15
2010
The complexity of approximating bounded-degree Boolean #CSP. Zbl 1230.68105
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
6
2010
Approximately counting integral flows and cell-bounded contingency tables. Zbl 1217.68245
Cryan, Mary; Dyer, Martin; Randall, Dana
5
2010
Randomly coloring random graphs. Zbl 1209.05079
Dyer, Martin; Frieze, Alan
3
2010
A complexity dichotomy for hypergraph partition functions. Zbl 1217.68105
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
1
2010
The complexity of weighted Boolean #CSP. Zbl 1191.68351
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
39
2009
The complexity of weighted Boolean #CSP with mixed signs. Zbl 1171.68013
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
14
2009
Matrix norms and rapid mixing for spin systems. Zbl 1166.15015
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
8
2009
The flip Markov chain and a randomising P2P protocol. Zbl 1291.68042
Cooper, Colin; Dyer, Martin; Handley, Andrew J.
4
2009
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Zbl 1181.05061
Bordewich, Magnus; Dyer, Martin; Karpinski, Marek
9
2008
Dobrushin conditions and systematic scan. Zbl 1168.60035
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
8
2008
Sampling regular graphs and a peer-to-peer network. Zbl 1137.05065
Cooper, Colin; Dyer, Martin; Greenhill, Catherine
36
2007
On counting homomorphisms to directed acyclic graphs. Zbl 1312.68098
Dyer, Martin E.; Goldberg, Leslie Ann; Paterson, Mike
27
2007
Path coupling without contraction. Zbl 1137.60046
Bordewich, Magnus; Dyer, Martin
6
2007
Computational complexity of stochastic programming problems. Zbl 1134.90027
Dyer, Martin; Stougie, Leen
49
2006
Randomly coloring sparse random graphs with fewer colors than the maximum degree. Zbl 1115.05030
Dyer, Martin; Flaxman, Abraham D.; Frieze, Alan M.; Vigoda, Eric
43
2006
Markov chain comparison. Zbl 1189.60135
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Martin, Russell
27
2006
Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows. Zbl 1117.62062
Cryan, Mary; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Martin, Russell
19
2006
Systematic scan for sampling colorings. Zbl 1095.60024
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
13
2006
Dobrushin conditions and systematic scan. Zbl 1155.60331
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
4
2006
Stopping times, metrics and approximate counting. Zbl 1223.68075
Bordewich, Magnus; Dyer, Martin; Karpinski, Marek
3
2006
On counting homomorphisms to directed acyclic graphs. Zbl 1223.68055
Dyer, Martin; Goldberg, Leslie Ann; Paterson, Mike
2
2006
Sampling regular graphs and a peer-to-peer network. Zbl 1297.05214
Cooper, Colin; Dyer, Martin; Greenhill, Catherine
11
2005
Approximately counting integral flows and cell-bounded contingency tables. Zbl 1192.68887
Cryan, Mary; Dyer, Martin; Randall, Dana
4
2005
The relative complexity of approximate counting problems. Zbl 1138.68424
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark
68
2004
Mixing in time and space for lattice spin systems: a combinatorial view. Zbl 1126.82021
Dyer, Martin; Sinclair, Alistair; Vigoda, Eric; Weitz, Dror
36
2004
Corrigendum: The complexity of counting graph homomorphisms. Zbl 1089.68076
Dyer, Martin; Greenhill, Catherine
7
2004
On the sampling problem for \(H\)-colorings on the hypercube lattice. Zbl 1074.05032
Borgs, Christian; Chayes, Jennifer T.; Dyer, Martin; Tetali, Prasad
6
2004
Counting and sampling \(H\)-colourings. Zbl 1082.68079
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark
6
2004
Rapidly mixing Markov chains for dismantleable constraint graphs. Zbl 1061.05031
Dyer, Martin; Jerrum, Mark; Vigoda, Eric
2
2004
Approximate counting by dynamic programming. Zbl 1192.90242
Dyer, Martin
24
2003
Randomly coloring graphs with lower bounds on girth and maximum degree. Zbl 1028.05030
Dyer, Martin; Frieze, Alan
13
2003
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. Zbl 1072.68127
Cryan, Mary; Dyer, Martin
11
2003
A probabilistic analysis of randomly generated binary constraint satisfaction problems. Zbl 1055.68102
Dyer, Martin; Frieze, Alan; Molloy, Michael
5
2003
Random walks on the vertices of transportation polytopes with constant number of sources. Zbl 1094.90509
Cryan, Mary; Dyer, Martin; Müller, Haiko; Stougie, Leen
3
2003
Listing vertices of simple polyhedra associated with dual LI(2) systems. Zbl 1038.68575
Abdullahi, Sammani D.; Dyer, Martin E.; Proll, Les G.
1
2003
On counting independent sets in sparse graphs. Zbl 1041.68045
Dyer, Martin; Frieze, Alan; Jerrum, Mark
44
2002
Convergence of the iterated prisoner’s dilemma game. Zbl 1006.60009
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Istrate, Gabriel; Jerrum, Mark
7
2002
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs. Zbl 1002.05023
Dyer, Martin; Greenhill, Catherine; Molloy, Mike
3
2002
Counting and sampling \(H\)-colourings. Zbl 1028.68098
Dyer, Martin; Goldberg, Leslie A.; Jerrum, Mark
2
2002
Rapidly mixing Markov chains for dismantleable constraint graphs. Zbl 1028.68099
Dyer, Martin; Jerrum, Mark; Vigoda, Eric
2
2002
Mixing in time and space for lattice spin systems: A combinatorial view. Zbl 1028.68562
Dyer, Martin; Sinclair, Alistair; Vigoda, Eric; Weitz, Dror
2
2002
On Markov chains for randomly \(H\)-coloring a graph. Zbl 0974.68149
Cooper, Colin; Dyer, Martin; Frieze, Alan
8
2001
An extension of path coupling and its application to the Glauber dynamics for graph colorings. Zbl 0999.05035
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark; Mitzenmacher, Michael
3
2001
The complexity of counting graph homomorphisms. Zbl 0965.68073
Dyer, Martin; Greenhill, Catherine
72
2000
On Markov chains for independent sets. Zbl 0961.05063
Dyer, Martin; Greenhill, Catherine
33
2000
Mixing properties of the Swendsen-Wang process on the complete graph and narrow grids. Zbl 1019.82011
Cooper, Colin; Dyer, Martin E.; Frieze, Alan M.; Rue, Rachel
14
2000
The complexity of counting graph homomorphisms (Extended abstract). Zbl 0956.68103
Dyer, Martin; Greenhill, Catherine
5
2000
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). Zbl 0981.05046
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark; Mitzenmacher, Michael
2
2000
On the relative complexity of approximate counting problems. Zbl 0976.68192
Dyer, Martin; Goldberg, Leslie Ann; Greenhill, Catherine; Jerrum, Mark
1
2000
Faster random generation of linear extensions. Zbl 0934.65005
Bubley, Russ; Dyer, Martin
24
1999
Random walks on combinatorial objects. Zbl 0946.60066
Dyer, Martin; Greenhill, Catherine
14
1999
On the complexity of computing mixed volumes. Zbl 0909.68193
Dyer, Martin; Gritzmann, Peter; Hufnagel, Alexander
30
1998
A more rapidly mixing Markov chain for graph colorings. Zbl 0961.60075
Dyer, Martin; Greenhill, Catherine
18
1998
On approximately counting colorings of small degree graphs. Zbl 0937.05041
Bubley, Russ; Dyer, Martin; Greenhill, Catherine; Jerrum, Mark
10
1998
Approximately counting Hamilton paths and cycles in dense graphs. Zbl 0907.68111
Dyer, Martin; Frieze, Alan; Jerrum, Mark
8
1998
Faster random generation of linear extensions. Zbl 1067.68791
Bubley, Russ; Dyer, Martin
6
1998
Beating the \(2\Delta\) bound for approximately counting colourings: A computer-assisted proof of rapid mixing. Zbl 0938.68751
Bubley, Russ; Dyer, Martin; Greenhill, Catherine
6
1998
Dominance in multi-dimensional multiple-choice knapsack problems. Zbl 0917.90249
Dyer, Martin E.; Walker, John
4
1998
An elementary analysis of a procedure for sampling points in a convex body. Zbl 0972.60037
Bubley, Russ; Dyer, Martin; Jerrum, Mark
3
1998
A genuinely polynomial-time algorithm for sampling two-rowed contingency tables. Zbl 0918.62053
Dyer, Martin; Greenhill, Catherine
1
1998
Sampling contingency tables. Zbl 0884.62065
Dyer, Martin; Kannan, Ravi; Mount, John
26
1997
Graph orientations with no sink and an approximation for a hard case of #SAT. Zbl 1321.68378
Bubley, Russ; Dyer, Martin
26
1997
On Barvinok’s algorithm for counting lattice points in fixed dimension. Zbl 0882.68145
Dyer, Martin; Kannan, Ravi
13
1997
Linear programming in low dimensions. Zbl 0904.90115
Dyer, Martin; Megiddo, Nimrod
1
1997
Locating the phase transition in binary constraint satisfaction problems. Zbl 1508.68348
Smith, Barbara M.; Dyer, Martin E.
20
1996
On key storage in secure networks. Zbl 0840.94015
Dyer, Martin; Fenner, Trevor; Frieze, Alan; Thomason, Andrew
15
1995
Randomized greedy matching. II. Zbl 0812.05046
Aronson, Jonathan; Dyer, Martin; Frieze, Alan; Suen, Stephen
12
1995
A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem. Zbl 0828.65070
Dyer, M. E.; Riha, W. O.; Walker, J.
6
1995
The worst-case running time of the random simplex algorithm is exponential in the height. Zbl 0875.90325
Broder, Andrei Z.; Dyer, Martin E.; Frieze, Alan M.; Raghavan, Prabhakar; Upfal, Eli
6
1995
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Zbl 0820.90066
Dyer, Martin; Frieze, Alan
24
1994
...and 38 more Documents
all top 5

Cited by 2,233 Authors

44 Dyer, Martin E.
43 Goldberg, Leslie Ann
30 Cai, Jin-Yi
25 Vigoda, Eric
24 Jerrum, Mark R.
23 Frieze, Alan Michael
18 Galanis, Andreas
17 Lu, Pinyan
16 Shabanov, Dmitry A.
16 Štefankovič, Daniel
15 Greenhill, Catherine S.
13 Bulatov, Andrei A.
12 Guo, Heng
12 Perkins, Will
11 Sly, Allan
10 Huber, Mark L.
10 Richerby, David M.
9 Bezáková, Ivona
9 Bousquet, Nicolas
9 Coja-Oghlan, Amin
9 De Loera, Jesús A.
9 Diaconis, Persi Warren
9 Efthymiou, Charilaos
9 Kuhn, Daniel
9 Randall, Dana J.
9 Sinclair, Alistair
9 Vempala, Santosh S.
8 Blanca, Antonio
8 Göbel, Andreas-Nikolas
8 Hayes, Thomas P.
8 Mossel, Elchanan
7 Chen, Danny Ziyi
7 Chen, Zongchen
7 Dadush, Daniel
7 Eisenbrand, Friedrich
7 Fréville, Arnaud
7 Fu, Zhiguo
7 Gao, Pu
7 Gritzmann, Peter
7 Jalsenius, Markus
7 Müller, Haiko
7 Pak, Igor
7 Wang, Haitao
7 Yin, Yitong
6 Barvinok, Alexander I.
6 Erdős, Péter L.
6 Kowalczyk, Michael
6 Lapinskas, John
6 Miklós, István
6 Montanari, Andrea
6 Narayanan, Hariharan
6 Patel, Viresh
6 Regts, Guus
6 Srivastava, Piyush
6 Tetali, Prasad
6 Weismantel, Robert
6 Woeginger, Gerhard
6 Xia, Mingji
5 Bülbül, Kerem
5 Dalmau, Víctor
5 Das, Sandip
5 Díaz, Josep
5 Emiris, Ioannis Z.
5 Friedrich, Tobias
5 Heinrich, Marc
5 Helmuth, Tyler
5 Ito, Takehiro
5 Kaiser, Mark J.
5 Kijima, Shuji
5 Klee, Victor LaRue
5 Miracle, Sarah
5 Perarnau, Guillem
5 Peres, Yuval
5 Romeijn, H. Edwin
5 Saloff-Coste, Laurent
5 Serna Iglesias, Maria José
5 Spieksma, Frits C. R.
5 Wiesemann, Wolfram
5 Wormald, Nicholas Charles
5 Yamakami, Tomoyuki
5 Yang, Linji
5 Živný, Stanislav
4 Abbe, Emmanuel
4 Anastos, Michael
4 Avis, David M.
4 Bang-Jensen, Jørgen
4 Bensmail, Julien
4 Bertsimas, Dimitris John
4 Bhatnagar, Nayantara
4 Bordewich, Magnus
4 Boros, Endre
4 Caputo, Pietro
4 Chalkis, Apostolos
4 Clementi, Andrea E. F.
4 Curticapean, Radu
4 Dell, Holger
4 Dempe, Stephan
4 Elbassioni, Khaled M.
4 Fan, Austen Z.
4 Fisikopoulos, Vissarion
...and 2,133 more Authors
all top 5

Cited in 265 Serials

93 Theoretical Computer Science
93 European Journal of Operational Research
68 Discrete Applied Mathematics
57 Random Structures & Algorithms
41 Mathematical Programming. Series A. Series B
38 Discrete & Computational Geometry
33 Journal of Computer and System Sciences
32 Operations Research Letters
31 The Annals of Applied Probability
30 SIAM Journal on Computing
30 Algorithmica
28 Computers & Operations Research
25 Information Processing Letters
25 SIAM Journal on Discrete Mathematics
22 Annals of Operations Research
21 Discrete Mathematics
19 Computational Geometry
19 Combinatorics, Probability and Computing
18 Information and Computation
17 Artificial Intelligence
17 Probability Theory and Related Fields
15 Journal of Combinatorial Optimization
15 Discrete Optimization
14 The Electronic Journal of Combinatorics
12 Optimization
12 Theory of Computing Systems
11 Computational Complexity
11 Journal of Scheduling
10 Journal of Statistical Physics
10 The Annals of Probability
9 European Journal of Combinatorics
8 Operations Research
8 SIAM Journal on Optimization
7 Communications in Mathematical Physics
7 Advances in Mathematics
7 Advances in Applied Mathematics
7 Combinatorica
7 Journal of Symbolic Computation
7 Journal of Machine Learning Research (JMLR)
6 Applied Mathematics and Computation
6 Journal of Combinatorial Theory. Series B
6 Journal of Graph Theory
6 Journal of Optimization Theory and Applications
6 Stochastic Processes and their Applications
6 INFORMS Journal on Computing
5 Mathematics of Computation
5 The Annals of Statistics
5 Information Sciences
5 Journal of Combinatorial Theory. Series A
5 Journal of Computational and Applied Mathematics
5 Mathematical Programming
5 Linear Algebra and its Applications
5 Annales de l’Institut Henri Poincaré. Probabilités et Statistiques
5 Distributed Computing
5 Computational Optimization and Applications
5 Journal of Discrete Algorithms
4 Automatica
4 Journal of Applied Probability
4 Networks
4 Statistics & Probability Letters
4 International Journal of Approximate Reasoning
4 Queueing Systems
4 International Journal of Computational Geometry & Applications
4 Computational and Applied Mathematics
4 Top
4 Bernoulli
4 Doklady Mathematics
4 Journal of Statistical Mechanics: Theory and Experiment
4 Discrete Mathematics, Algorithms and Applications
4 Algorithms
3 Computers & Mathematics with Applications
3 International Journal of Mathematical Education in Science and Technology
3 Israel Journal of Mathematics
3 Fuzzy Sets and Systems
3 Mathematics of Operations Research
3 OR Spektrum
3 Physica D
3 Graphs and Combinatorics
3 Statistical Science
3 Journal of Global Optimization
3 Proceedings of the National Academy of Sciences of the United States of America
3 Constraints
3 Séminaire Lotharingien de Combinatoire
3 Journal of Applied Statistics
3 CEJOR. Central European Journal of Operations Research
3 Methodology and Computing in Applied Probability
3 Foundations of Computational Mathematics
3 Journal of Physics A: Mathematical and Theoretical
3 Logical Methods in Computer Science
3 Mathematical Programming Computation
2 American Mathematical Monthly
2 Journal of Mathematical Analysis and Applications
2 Journal of Mathematical Biology
2 Physica A
2 Archiv der Mathematik
2 BIT
2 Computing
2 Journal of Statistical Planning and Inference
2 Mathematische Annalen
2 Mathematica Slovaca
...and 165 more Serials
all top 5

Cited in 44 Fields

642 Computer science (68-XX)
543 Operations research, mathematical programming (90-XX)
461 Combinatorics (05-XX)
257 Probability theory and stochastic processes (60-XX)
164 Convex and discrete geometry (52-XX)
140 Numerical analysis (65-XX)
109 Statistical mechanics, structure of matter (82-XX)
84 Statistics (62-XX)
55 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
30 Information and communication theory, circuits (94-XX)
22 Order, lattices, ordered algebraic structures (06-XX)
21 Calculus of variations and optimal control; optimization (49-XX)
19 Number theory (11-XX)
17 Algebraic geometry (14-XX)
15 Linear and multilinear algebra; matrix theory (15-XX)
14 Quantum theory (81-XX)
14 Biology and other natural sciences (92-XX)
12 Mathematical logic and foundations (03-XX)
11 General algebraic systems (08-XX)
10 Dynamical systems and ergodic theory (37-XX)
9 Systems theory; control (93-XX)
6 Commutative algebra (13-XX)
6 Measure and integration (28-XX)
6 Approximations and expansions (41-XX)
5 Field theory and polynomials (12-XX)
5 Group theory and generalizations (20-XX)
5 Geometry (51-XX)
4 Manifolds and cell complexes (57-XX)
3 Real functions (26-XX)
3 Partial differential equations (35-XX)
3 Functional analysis (46-XX)
2 General and overarching topics; collections (00-XX)
2 Associative rings and algebras (16-XX)
2 Functions of a complex variable (30-XX)
2 Ordinary differential equations (34-XX)
2 Harmonic analysis on Euclidean spaces (42-XX)
1 Nonassociative rings and algebras (17-XX)
1 Difference and functional equations (39-XX)
1 Integral equations (45-XX)
1 Operator theory (47-XX)
1 Differential geometry (53-XX)
1 Global analysis, analysis on manifolds (58-XX)
1 Geophysics (86-XX)
1 Mathematics education (97-XX)

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.