`Travelled to:`

1 × Belgium

1 × Czech Republic

1 × France

1 × Japan

1 × United Kingdom

2 × Greece

2 × Switzerland

3 × USA

`Collaborated with:`

L.A.Goldberg A.Sinclair ∅ Y.Hirshfeld V.Gore A.Galanis E.Vigoda S.Kannan M.Paterson

`Talks about:`

approxim (6) polynomi (5) algorithm (3) model (3) time (3) ferromagnet (2) function (2) process (2) generat (2) complex (2)

## Person: Mark Jerrum

### DBLP: Jerrum:Mark

### Contributed to:

### Wrote 13 papers:

- ICALP-v1-2015-GalanisGJ #approximate
- Approximately Counting H-Colourings is BIS-Hard (AG, LAG, MJ), pp. 529–541.
- ICALP-v1-2012-GoldbergJ #approximate #complexity #polynomial
- The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (LAG, MJ), pp. 399–410.
- ICALP-v1-2011-GoldbergJ #algorithm #polynomial
- A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (LAG, MJ), pp. 521–532.
- ICALP-v1-2010-GoldbergJ #approximate
- Approximating the Partition Function of the Ferromagnetic Potts Model (LAG, MJ), pp. 396–407.
- STOC-2007-GoldbergJ #polynomial
- Inapproximability of the Tutte polynomial (LAG, MJ), pp. 459–468.
- STOC-2001-JerrumSV #algorithm #approximate #matrix #polynomial
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries (MJ, AS, EV), pp. 712–721.
- ICALP-2000-GoldbergJKP #bound #capacity #protocol
- A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols (LAG, MJ, SK, MP), pp. 705–716.
- ICALP-1999-HirshfeldJ #algebra #bisimulation #decidability #process
- Bisimulation Equivanlence Is Decidable for Normed Process Algebra (YH, MJ), pp. 412–421.
- STOC-1997-GoreJ #process
- The Swendsen-Wang Process Does Not Always Mix Rapidly (VG, MJ), pp. 674–681.
- ICALP-1990-JerrumS #algorithm #approximate #polynomial
- Polynomial-Time Approximation Algorithms for Ising Model (MJ, AS), pp. 462–475.
- STOC-1988-JerrumS #agile #approximate #markov
- Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (MJ, AS), pp. 235–244.
- ICALP-1985-Jerrum #combinator #generative #random
- Random Generation of Combinatorial Structures from a Uniform Distribution (MJ), pp. 290–299.
- ICALP-1984-Jerrum #complexity #generative #sequence
- The Complexity of Finding Minimum-Length Generator Sequences (MJ), pp. 270–280.