The following papers can be downloaded:

Stationary distributions of the multitype ASEP.

Minimax functions on GaltonWatson trees,
with Roman Stasiński.

Stable matchings in high dimensions via the Poissonweighted infinite tree,
with Alexander Holroyd and Yuval Peres.

Percolation games, probabilistic cellular automata, and the hardcore
model,
with Alexander Holroyd and Irène Marcovici.
To appear in Probability Theory and Related Fields.

Critical random forests,
with Dominic Yeo.
ALEA, Latin American Journal of Probability and Mathematical Statistics,
vol. 15, pp. 913960 (2018).

Stability of service under timeofuse pricing,
with Shuchi Chawla, Nikhil Devanur, Alexander Holroyd, Anna Karlin and
Balasubramanian Sivan.
STOC 2017.

Rigid representations of the multiplicative coalescent with linear deletion,
with Balázs Ráth.
Electronic Journal of Probability vol. 22, no. 83 (2017)

Friendly frogs, stable marriage, and the magic of invariance,
with Maria Deijfen and Alexander Holroyd.
American Mathematical Monthly, vol. 124, no. 4, pp. 387402 (2017)

Trapping games on random boards,
with Riddhipratim Basu, Alexander Holroyd and Johan Wästlund.
Annals of Applied Probability
vol. 26, no. 6, pp. 37273753 (2016)

Poisson allocations with bounded connected cells,
with Alexander Holroyd.
Electronic Communications in Probability vol. 20, no. 69 (2015).

Longrange lastpassage percolation on the line,
with Sergey Foss and Philipp Schmidt.
Annals of Applied Probability vol. 24, no. 1, pp. 198234 (2014)

Stochastic domination and comb percolation,
with Alexander Holroyd.
Electronic Journal of Probability vol. 19, no. 5 (2014).

How to squeeze the toothpaste back into the tube,
with Pablo Ferrari.

Avoidance coupling,
with Omer Angel, Alexander Holroyd, David Wilson and Peter Winkler.
Electronic Communications in Probability vol. 18, no. 58 (2013).

Fixed points for multiclass queues,
with Balaji Prabhakar.

Multitype TASEP in discrete time,
with Philipp Schmidt.
ALEA, Latin American Journal of Probability and Mathematical Statistics,
vol. 8, pp. 303333 (2011).

Discrete lowdiscrepancy sequences,
with Omer Angel, Alexander Holroyd and James Propp.

Batch queues, reversibility and firstpassage percolation.
Queueing Systems, vol. 62, no. 4, pp. 411427 (2009).

Collision probabilities in the rarefaction fan of asymmetric exclusion
processes,
with Pablo Ferrari and Patricia Goncalves.
Annales de l'Institut Henri Poincaré 
Probabilités et Statistiques, vol. 45, no. 4, pp.
10481064 (2009).

A phase transition for competition interfaces,
with Pablo Ferrari and Leandro Pimentel.
Annals of Applied Probability, vol. 19, no. 1, pp. 281317 (2009).

Multiclass HammersleyAldousDiaconis processes and multiclass
queues,
with Pablo Ferrari.
Annales de l'Institut Henri Poincaré  Probabilités et
Statistiques,
vol. 45, no. 1, pp. 250265 (2009).

Fragmenting random permutations,
with Christina Goldschmidt and Dario Spano.
Electronic Communications in Probability, vol. 13, pp. 461474
(2008).

Heavy tails in lastpassage percolation,
with Ben Hambly.
Probability Theory and Related Fields, vol. 137, pp. 227275 (2007).

Stationary distributions of
multitype totally asymmetric exclusion processes,
with Pablo Ferrari.
Annals of Probability, vol. 35, no. 3, pp. 807832 (2007).

Multiclass processes, dual points and M/M/1 queues,
with Pablo Ferrari.
Markov Processes and Related Fields, vol. 12, pp. 175201 (2006).

Coagulationfragmentation duality, PoissonDirichlet distributions and
random recursive trees, with Rui Dong and Christina
Goldschmidt.
Annals of Applied Probability, vol. 16, no. 4, pp. 1733.1750 (2006).

Lastpassage percolation with general weight distribution
(survey paper).
Markov Processes and Related Fields, vol. 12, pp. 273299 (2006)
[ps,
ps.gz]

Roughening and inclination of competition interfaces,
with Pablo Ferrari and Leandro Pimentel.
Physical Review E, vol 73, 031602 (2006)
[journal
version,
arxiv]

The jammed phase of the BihamMiddletonLevine traffic model,
with Omer Angel and Alexander Holroyd.
Electronic Communications in Probability, vol. 10, pp. 167178 (2005)

Random recursive trees and the BolthausenSznitman coalescent,
with Christina Goldschmidt.
Electronic Journal of Probability, vol. 10, pp. 718745 (2005)

A universality property for lastpassage percolation
paths close to the axis,
with Thierry Bodineau.
Electronic Communications in Probability, vol. 10, pp. 105112 (2005)

Benefits of partial reconfigurability
in circuitswitched WDM networks.
Journal of HighSpeed Networks, vol. 14, no. 3, pp. 201213 (2005)
[ps,
ps.gz]

A threestate hardcore model on a Cayley tree,
with Utkir Rozikov and Yuri Suhov.
Journal of
Nonlinear Mathematical Physics, vol. 12, no. 3, pp. 432448 (2005)

Limiting shape for directed
percolation models.
Annals of Probability, vol. 32, no. 4, pp. 29082937 (2004)

Reconstruction thresholds on regular trees.
In
Discrete Random Walks, DRW'03,
ed.
C. Banderier and C. Krattenthaler,
Discrete Mathematics and
Theoretical Computer Science Proceedings AC, pp. 191204 (2003)

Concentration results for a Brownian
directed percolation problem,
with Ben Hambly and Neil O'Connell
Stochastic Processes and their Applications, vol. 102, pp. 207220 (2002)
[ps,
ps.gz]

Large tandem queueing networks with blocking.
Queueing Systems, Theory and Applications, vol. 41, pp. 4572 (2002)
[ps,
ps.gz]

Linear growth for greedy lattice animals.
Stochastic Processes and their Applications, vol. 98, no. 1, pp. 4366
(2002)
[ps,
ps.gz]

Stochastic bounds for fast Jackson networks.
In Analytic
Methods in Applied Probability: In Memory of Fridrikh Karpelevich,
ed. Yu. M. Suhov, pp. 133140. AMS (2002)
[ps,
ps.gz]

Pitman's 2MX theorem for skipfree random walks with Markovian
increments, with Ben Hambly and Neil O'Connell.
Electronic Communications in Probability, vol. 6, pp. 7377 (2001)

Point processes in fast Jackson networks.
Annals of Applied Probability, vol. 11, no. 3, pp. 650663
(2001)
[ps,
ps.gz]

Fast Jackson networks, with Yuri Suhov.
Annals of Applied Probability,
vol. 9, no. 3, pp. 854870 (1999)
[(ps,
ps.gz)]
 Analysis of some large Markovian queueing networks.
PhD thesis, University of Cambridge, 1999.
[ps,
ps.gz]
James Martin