1. Björn Assmann and Stephen Linton, Using the Malcev correspondence for collection in polycyclic groups, J. Algebra 316 (2007), no. 2, 828–848.[MR]
  2. David C. Banks and Stephen Linton, Counting cases in marching cubes: toward a generic algorithm for producing substitopes, in VIS '03: Proceedings of the 14th IEEE Visualization 2003 (VIS'03), IEEE Computer Society, Washington, DC, USA, 2003, pp. 8.[doi]
  3. Colin Campbell, George Havas, Stephen Linton, and Edmund Robertson, Symmetric presentations and orthogonal groups, The Atlas of Finite Groups: Ten Years On (Birmingham, 1995), London Math. Soc. Lecture Note Ser., vol. 249, Cambridge Univ. Press, Cambridge, 1998, pp. 1–10.[MR]
  4. Ian P. Gent, Warwick Harvey, Tom Kelsey, and Steve Linton, Generic SBDD using computational group theory, Principles and Practice of Constraint Programming, CP 2003: 9th International Conference, CP 2003, Kinsale, Ireland, September 29-October 3,2003,Proceedings, Lecture Notes in Comput. Sci., vol. 2833, Springer, Berlin, 2003, pp. 333-347.
  5. P. E. Holmes, S. A. Linton, E. A. O'Brien, A. J. E. Ryba, and R. A. Wilson, Constructive membership in black-box groups, J. Group Theory 11 (2008), no. 6, 747–763.[MR]