• Enlarging the REDUCE domain of computation Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (SYMSAC 86), July 1986, pp. 100--106. (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 Object-Oriented Programming in Lisp, The Computer Journal, vol. 34, no. 4, pp. 311-319, August 1991 (with J. Padget and J. Fitch).
• Algebraic Simplification of Multiple-Valued Functions, in Proceedings of DISCO 92, Springer LNCS 721, pp. 13-21, 1993, John Fitch (Ed).
• An Implementation of Telos in Common Lisp, Object Oriented Systems, vol. 3, pp. 31-49, 1996. ISSN 0969-9767.
• Markov chain Monte Carlo methods for family trees using a parallel processor, Statistics and Computing, vol.6, pp. 67-75, 1996 (with Alun Thomas).
• A pi-calculus model of the Spanish FishMarket Proceedings of AMET98. vol. 1571, pp. 166--188. (with Julian Padget)
• A Library for Parallel Modular Arithmetic, in P.Amestoy et al. (Eds.): Proceedings EuroPar'99, LNCS 1685, pp. 1476-1483, 1999. (with David Power).
• Applying Parallel Discrete Event Simulation to Network Emulation, 14th Workshop on Parallel and Distributed Simulation (PADS 2000) 28-31 May 2000, Bologna, Italy. pp. 15-22. (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. 315-322. (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. 150-157. (with Rob Simmonds and Brian Unger)
• Towards Better Simplification of Elementary Functions Proceedings ISSAC 2002, pp. 15-22. (with James H Davenport)
• Better Simplification of Elementary Functions Through Power Series Proceedings ISSAC 2003, pp. 30-36. (with James Beaumont and James H Davenport)
• A Poly-Algorithmic Approach to Simplifying Elementary Functions Proceedings ISSAC 2004, pp. 27-34. (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. 202-207, December 2004. (wth Sirapat Boonkrong)
• Practical Simplification of Elementary Functions using CAD, Proceedings Algorithmic Algebra and Logic (A3L), April 2005, pp. 35-40. (with James Beaumont and Nalina Phisanbut)
• Adherence is Better than Adjacency: Computing the Riemann Index using CAD, Proceedings ISSAC 2005, pp. 37-44. (with James Beaumont, James H Davenport and Nalina Phisanbut)

RJB Home Page.