## Surveys in Combinatorics, 1989: On the method of bounded differences

- C. McDiarmid
- Mathematics
- 1 August 1989

## Concentration

- C. McDiarmid
- Mathematics, Computer ScienceThe Dental register
- 1 June 1862

## Colouring random graphs

- C. McDiarmid
- Mathematics, Computer ScienceMathematical Proceedings of the Cambridgeâ€¦
- 1 March 1975

## SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing

- C. McDiarmid
- Computer Science
- 1 November 1991

## Channel assignment and weighted coloring

- C. McDiarmid, B. Reed
- MathematicsNetworks
- 1 September 2000

## Acyclic Coloring of Graphs

- N. Alon, C. McDiarmid, B. Reed
- MathematicsRandom Struct. Algorithms
- 1 September 1991

## Concentration for Independent Permutations

- C. McDiarmid
- MathematicsCombinatorics, probability & computing
- 1 March 2002

We give a concentration inequality involving a family of independent random permutations, which is useful for analysing certain randomized methods for graph colouring.

## Small transversals in hypergraphs

- V. ChvÃ¡tal, C. McDiarmid
- MathematicsComb.
- 1 March 1992

## On integer points in polyhedra

- W. Cook, M. Hartmann, R. Kannan, C. McDiarmid
- MathematicsComb.
- 1 March 1992

## Volumes Spanned by Random Points in the Hypercube

- M. Dyer, Z. FÃ¼redi, C. McDiarmid
- MathematicsRandom Struct. Algorithms
- 1992

...

1

2

3

4

5

...