A few papers that were easy to get online. Others exist, but would be more of
a hassle. Bit rot gets you in the end.

Enlarging
the REDUCE domain of computation
Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
(SYMSAC 86), July 1986, pp. 100106. (with A. Hearn and J.P.E. Schrufer)

Effective Tests for Cyclotomic Polynomials,
in Proceedings of ISSAC 1988, Springer LNCS no. 368, P. Gianni (Ed)
(with J.H. Davenport).

Some Results on the Defect, Proceedings of
ISSAC 1989, ACM Press.

Concurrent ObjectOriented Programming in Lisp,
The Computer Journal, vol. 34, no. 4, pp. 311319, August 1991
(with J. Padget and J. Fitch).

Algebraic
Simplification of MultipleValued Functions, in Proceedings of
DISCO 92, Springer LNCS 721, pp. 1321, 1993, John Fitch (Ed).

An
Implementation of Telos in Common Lisp,
Object
Oriented Systems, vol. 3, pp. 3149, 1996. ISSN 09699767.

Markov chain
Monte Carlo methods for family trees using a parallel processor,
Statistics and
Computing, vol.6, pp. 6775, 1996
(with Alun Thomas).

A picalculus model of the Spanish FishMarket
Proceedings of AMET98. vol. 1571, pp. 166188. (with Julian Padget)

A Library for Parallel Modular Arithmetic,
in P.Amestoy et al. (Eds.): Proceedings EuroPar'99, LNCS 1685, pp. 14761483,
1999.
(with David Power).

Applying Parallel Discrete Event Simulation to
Network Emulation,
14th Workshop on Parallel and Distributed Simulation (PADS 2000)
2831 May 2000, Bologna, Italy. pp. 1522.
(with Rob Simmonds and Brian Unger).

A Parallel Discrete Event IP Network Emulator,
Proceedings of Mascots 2000: The
IEEE/ACM International Symposium on Modeling, Analysis and Simulation of
Computer and Telecommunication Systems, August 2000, pp. 315322.
(with Rob Simmonds and Brian Unger).

Packet Reading for Network Emulation,
Proceedings MASCOTS 2001: The
IEEE/ACM International Symposium on Modeling, Analysis and Simulation of
Computer and Telecommunication Systems, August 2001, pp. 150157.
(with Rob Simmonds and Brian Unger)

Towards Better Simplification of Elementary
Functions Proceedings ISSAC 2002, pp. 1522. (with James H Davenport)

Better Simplification of Elementary Functions Through
Power Series Proceedings ISSAC 2003, pp. 3036. (with James Beaumont and
James H Davenport)

A PolyAlgorithmic Approach to Simplifying Elementary
Functions Proceedings ISSAC 2004, pp. 2734. (with James Beaumont and
James H Davenport and Nalina Phisanbut)

Authentication in Mobile Ad Hoc Networks
Proceedings of the 1st Thailand Computer Science Conference (ThCSC2004),
pp. 202207, December 2004. (wth Sirapat Boonkrong)

Practical Simplification of Elementary Functions using
CAD, Proceedings Algorithmic Algebra and Logic (A3L), April 2005,
pp. 3540. (with James Beaumont and Nalina Phisanbut)

Adherence is Better than Adjacency: Computing the
Riemann Index using CAD, Proceedings ISSAC 2005, pp. 3744.
(with James Beaumont, James H Davenport and Nalina Phisanbut)
RJB Home Page.