My main activities are in the part of theoretical computer science
known as computational complexity. Within that area, I have particular
interests in probabilistic computation, the complexity of combinatorial
enumeration, information- and complexity-theoretic aspects
of machine learning, and combinatorial optimisation.
I dabble a little in related areas of mathematics such as combinatorics
and the theory of stochastic processes. Very occasionally,
I might flirt with Eurotheory.
- Some publications are available
Or, for a more nearly complete listing of publications, click
(This listing is generated in real time by
- "Algorithmically feasible sampling:
what are the limits?", a presentation
to a London Mathematical Society meeting, UCL, 7th October, 2005.
- "Approximating the Tutte polynomial: a status report",
to an OWL meeting "Combinatorics, probability and statistical mechanics",
Oxford, 7 February 2006.
Some useful and not-so-useful links
Odds and ends
School of Informatics
University of Edinburgh
The King's Buildings
Edinburgh EH9 3JZ
E-mail: mrj AT inf.ed.ac.uk