#### Filter Results:

- Full text PDF available (52)

#### Publication Year

1981

2019

- This year (7)
- Last 5 years (34)
- Last 10 years (64)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mark Jerrum, Alistair Sinclair
- SIAM J. Comput.
- 1989

A randomised approximation scheme for the permanent of a 0–1s presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter… (More)

- Alan M. Frieze, Mark Jerrum
- IPCO
- 1995

Polynomial-time approximation algorithms with non-trivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise… (More)

- Alistair Sinclair, Mark Jerrum
- Inf. Comput.
- 1989

Abstract The paper studies effective approximate solutions to combinatorial counting and unform generation problems. Using a technique based on the simulation of ergodic Markov chains, it is shown… (More)

- Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani
- Theor. Comput. Sci.
- 1986

Abstract The class of problems involving the random generation of combinatorial structures from a uniform distribution is considered. Uniform generation problems are, in computational difficulty,… (More)

- Mark Jerrum, Alistair Sinclair
- SIAM J. Comput.
- 1993

The paper presents a randomised algorithm which evaluates the partition function of an arbitrary ferromagnetic Ising system to any specified degree of accuracy. The running time of the algorithm… (More)

- Mark Jerrum
- Random Struct. Algorithms
- 1995

A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) k‐colorings of a graph of maximum degree Δ, when k ≥ 2Δ + 1. © 1995 John Wiley & Sons, Inc.

- Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
- Algorithmica
- 2003

AbstractTwo natural classes of counting problems that are interreducible
under approximation-preserving reductions are: (i) those that
admit a particular kind of efficient approximation algorithm… (More)

- Mark Jerrum, Alistair Sinclair, Eric Vigoda
- J. ACM
- 2004

We present a polynomial-time randomized algorithm for estimating the permanent of an arbitrary n × n matrix with nonnegative entries. This algorithm---technically a "fully-polynomial randomized… (More)

- Mark Jerrum, Alistair Sinclair
- STOC
- 1988

The <italic>permanent</italic> of an <italic>n</italic> x <italic>n</italic> matrix <italic>A</italic> with 0-1 entries <italic>a<subscrpt>ij</subscrpt></italic> is defined by per… (More)