フォロー
Martin Dyer
Martin Dyer
確認したメール アドレス: leeds.ac.uk
タイトル
引用先
引用先
A random polynomial-time algorithm for approximating the volume of convex bodies
M Dyer, A Frieze, R Kannan
Journal of the ACM (JACM) 38 (1), 1-17, 1991
8491991
Path coupling: A technique for proving rapid mixing in Markov chains
R Bubley, M Dyer
Proceedings 38th Annual Symposium on Foundations of Computer Science, 223-231, 1997
4371997
On the complexity of computing the volume of a polyhedron
ME Dyer, AM Frieze
SIAM Journal on Computing 17 (5), 967-974, 1988
3871988
Locating the phase transition in binary constraint satisfaction problems
BM Smith, ME Dyer
Artificial Intelligence 81 (1-2), 155-181, 1996
3341996
Formulating the single machine sequencing problem with release dates as a mixed integer program
ME Dyer, LA Wolsey
Discrete Applied Mathematics 26 (2-3), 255-270, 1990
3251990
The complexity of counting graph homomorphisms
M Dyer, C Greenhill
Random Structures & Algorithms 17 (3‐4), 260-289, 2000
2862000
Computational complexity of stochastic programming problems
M Dyer, L Stougie
mathematical programming 106 (3), 423-432, 2006
2782006
Linear time algorithms for two-and three-variable linear programs
ME Dyer
SIAM Journal on Computing 13 (1), 31-45, 1984
2711984
A simple heuristic for the p-centre problem
ME Dyer, AM Frieze
Operations Research Letters 3 (6), 285-288, 1985
2281985
The complexity of vertex enumeration methods
ME Dyer
Mathematics of Operations Research 8 (3), 381-402, 1983
2251983
The solution of some random NP-hard problems in polynomial expected time
ME Dyer, AM Frieze
Journal of Algorithms 10 (4), 451-489, 1989
2231989
Faster random generation of linear extensions
R Bubley, M Dyer
Discrete mathematics 201 (1-3), 81-88, 1999
2181999
On counting independent sets in sparse graphs
M Dyer, A Frieze, M Jerrum
SIAM Journal on Computing 31 (5), 1527-1541, 2002
1992002
On a multidimensional search technique and its application to the euclidean one-centre problem
ME Dyer
SIAM Journal on Computing 15 (3), 725-738, 1986
1971986
On the complexity of partitioning graphs into connected subgraphs
ME Dyer, AM Frieze
Discrete Applied Mathematics 10 (2), 139-153, 1985
1891985
Computing the volume of convex bodies: a case where randomness provably helps
M Dyer, A Frieze
Probabilistic combinatorics and its applications 44 (123-170), 0754-68052, 1991
1851991
The relative complexity of approximate counting problems
M Dyer, LA Goldberg, C Greenhill, M Jerrum
Algorithmica 38 (3), 471-500, 2004
1842004
Planar 3DM is NP-complete
ME Dyer, AM Frieze
Journal of Algorithms 7 (2), 174-184, 1986
1831986
Sampling regular graphs and a peer-to-peer network
C Cooper, M Dyer, C Greenhill
Combinatorics, Probability and Computing 16 (4), 557-593, 2007
1752007
On Markov chains for independent sets
M Dyer, C Greenhill
Journal of Algorithms 35 (1), 17-49, 2000
1662000
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20