Travelled to:1 × Canada
1 × Denmark
1 × Italy
1 × Switzerland
4 × USA
Collaborated with:M.Cryan V.Mohanaraj D.Richerby ∅ C.S.Greenhill M.Bordewich M.Karpinski L.A.Goldberg M.Paterson D.Randall A.M.Frieze R.Kannan
Talks about:approxim (5) count (5) time (4) algorithm (3) polynomi (3) conting (3) tabl (3) row (2) homomorph (1) interact (1)
Person: Martin E. Dyer
DBLP: Dyer:Martin_E=
Contributed to:
2011
2010200620052003200219981989Wrote 9 papers:
- ICALP-v1-2011-DyerM #game studies
- Pairwise-Interaction Games (MED, VM), pp. 159–170.
- STOC-2010-DyerR #complexity #csp #on the
- On the complexity of #CSP (MED, DR), pp. 725–734.
- ICALP-v1-2006-BordewichDK #approximate #metric
- Stopping Times, Metrics and Approximate Counting (MB, MED, MK), pp. 108–119.
- ICALP-v1-2006-DyerGP #graph #morphism #on the
- On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.
- STOC-2005-CryanDR #approximate #bound
- Approximately counting integral flows and cell-bounded contingency tables (MC, MED, DR), pp. 413–422.
- STOC-2003-Dyer #approximate #programming
- Approximate counting by dynamic programming (MED), pp. 693–699.
- STOC-2002-CryanD #algorithm #approximate #constant #polynomial
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (MC, MED), pp. 240–249.
- ICALP-1998-DyerG #algorithm #polynomial
- A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables (MED, CSG), pp. 339–350.
- STOC-1989-DyerFK #algorithm #approximate #polynomial #random
- A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (MED, AMF, RK), pp. 375–381.