One-off pieces of work
Haven't we all got stuff like this? It doesn't fit any category because
you did it for a particular reason or it didn't lead on.
- Mathematics in the service of computer programming, Math. Spectrum 10 (1977), 6-11.
- Regular fault-free rectangles, Math. Gazette 64 (1980), 99-104 (with W.F. Lunnon).
- The cyclic towers of Hanoi, Information Processing Letters 13 (1981), 118-119.
- How to compute the series expansions of sec x and tan x, Amer. Math. Monthly 93 (1986), 387-389.
- Maxmin heaps and generalised priority queues, Comm. of the ACM 29 (Oct, 1986), 996-1000 (with J.-R. Sack, N. Santoro and T. Strothotte).
- An optimal algorithm for geometrical congruence, J. Algorithms 8 (1987), 159-172.
- Industry-academic links and local development: the case of Ottawa, Industry and Higher Education 6 (1992), 151-160 (with R.H. Lawton Smith).
- The public and private interface in technology: the regulation of industry and academic links in Belgium, France and the UK, Industry and Higher Education 8 (1994), 160-173 (with R.H. Lawton Smith).
- Group theory on a micro-computer, in Proceedings of the International Conference on Computational Group Theory (Durham, August 1982), 275-280 (Academic Press, London 1984) (with R.A. Hassan and M.P. Thorne).
- Min-max heaps, order-statistics trees, and their application to
the Course-Marks problem, Nineteenth Conference on Information and System Sciences, (Baltimore, March 1985), 160-165 (with J.-R. Sack, N. Santoro, Th. Strothotte).
- Selecting subsets of the correct density, Seventeenth Southeastern Conference on Combinatorics, Graph Theory and Computing, (Boca Raton, February 1986), Congressus Numerantium 57, 15-22.
- The complexity of algorithms, in Computing Tomorrow; Editors R. Milner and
I. Wand, Cambridge, University Press Cambridge (1996), pp1-20.