1. Jianbei An, John J. Cannon, E. A. O'Brien, and W. R. Unger, The Alperin weight conjecture and Dade's conjecture for the simple group Fi24', LMS J. Comput. Math. 11 (2008), 100–145.[MR]
  2. Wieb Bosma and John Cannon (eds.), Discovering Mathematics with Magma, Algorithms and Computation in Mathematics, vol. 19, Springer-Verlag, Berlin, 2006, pp. xxiv+374.[MR]
  3. Wieb Bosma, John Cannon, and Catherine Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), no. 3-4, 235–265.[MR]
  4. Wieb Bosma, John Cannon, and Allan Steel, Lattices of compatibly embedded finite fields, J. Symbolic Comput. 24 (1997), no. 3-4, 351–369.[MR]
  5. Gregory Butler and John J. Cannon, Cayley, Version 4: The user language, in ISSAC '88: Proceedings of the 1988 International Symposium on Symbolic and Algebraic Computation, vol. 358, Springer-Verlag, Berlin, 1988, pp. 456-466.
  6. John J. Cannon, Bruce C. Cox, and Derek F. Holt, Computing Sylow subgroups in permutation groups, J. Symbolic Comput. 24 (1997), no. 3-4, 303–316.[MR]
  7. John J. Cannon, Bruce C. Cox, and Derek F. Holt, Computing the subgroups of a permutation group, J. Symbolic Comput. 31 (2001), no. 1-2, 149–161.[MR]
  8. John J. Cannon, Bettina Eick, and Charles R. Leedham-Green, Special polycyclic generating sequences for finite soluble groups, J. Symbolic Comput. 38 (2004), no. 5, 1445–1460.[MR]
  9. John Cannon and George Havas, Algorithms for groups, Australian Computer Journal 24 (1992), 51–60.
  10. John J. Cannon and Derek F. Holt, Computing chief series, composition series and socles in large permutation groups, J. Symbolic Comput. 24 (1997), no. 3-4, 285–301.[MR]
  11. John J. Cannon and Derek F. Holt, Automorphism group computation and isomorphism testing in finite groups, J. Symbolic Comput. 35 (2003), no. 3, 241–267.[MR]
  12. John Cannon and Derek F. Holt, Computing maximal subgroups of finite groups, J. Symbolic Comput. 37 (2004), no. 5, 589–609.[MR]
  13. John J. Cannon and Derek F. Holt, Computing conjugacy class representatives in permutation groups, J. Algebra 300 (2006), no. 1, 213–222.[MR]
  14. John J. Cannon and Derek F. Holt, The transitive permutation groups of degree 32, Experiment. Math. 17 (2008), no. 3, 307–314.[MR]
  15. John J. Cannon, Derek F. Holt, Michael Slattery, and Allan K. Steel, Computing subgroups of bounded index in a finite group, J. Symbol. Comput. 40 (2005), no. 2, 1013–1022.[MR]
  16. John J. Cannon, John McKay, and Kiang Chuen Young, The nonabelian simple groups G, | G | < 105 — presentations, Comm. Algebra 7 (1979), no. 13, 1397–1406.[MR]
  17. John Cannon and Catherine Playoust, Magma: A new computer algebra system, Euromath Bull. 2 (1996), no. 1, 113–144.[MR]
  18. John Cannon and Catherine Playoust, Using the Magma computer algebra system in abstract algebra courses, J. Symbolic Comput. 23 (1997), no. 5-6, 459-484.
  19. John Cannon and Bernd Souvignier, On the computation of conjugacy classes in permutation groups, in Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI), ACM, New York, 1997, pp. 392–399 (electronic).[MR]