1. Peter A. Brooksbank and William M. Kantor, Fast constructive recognition of black box orthogonal groups, J. Algebra 300 (2006), no. 1, 256–288.[MR]
  2. Peter J. Cameron, Michael Giudici, Gareth A. Jones, William M. Kantor, Mikhail H. Klin, Dragan Marušič, and Lewis A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), no. 2, 325–333.[MR]
  3. R. M. Guralnick, W. M. Kantor, M. Kassabov, and A. Lubotzky, Presentations of finite simple groups: A quantitative approach, J. Amer. Math. Soc. 21 (2008), no. 3, 711–774.[MR/arXiv]
  4. R. M. Guralnick, W. M. Kantor, M. Kassabov, and A. Lubotzky, Remarks on proficient groups, J. Algebra 326 (2011), no. 1, 169–184.
  5. William M. Kantor, Sylow's theorem in polynomial time, J. Comput. System Sci. 30 (1985), no. 3, 359–394.[MR]
  6. William M. Kantor, Simple groups in computational group theory, in Proceedings of the International Congress of Mathematicians, Vol. II (Berlin, 1998), 1998, pp. 77–86 (electronic).[MR]
  7. William M. Kantor and Tim Penttila, Reconstructing simple group actions, Geometric Group Theory Down Under (Canberra, 1996), de Gruyter, Berlin, 1999, pp. 147–180.[MR]
  8. William M. Kantor and Ákos Seress, Black box classical groups, Mem. Amer. Math. Soc. 149 (2001), no. 708, viii+168.[MR]
  9. William M. Kantor and Ákos Seress, Computing with matrix groups, Groups, combinatorics &geometry (Durham, 2001), World Sci. Publishing, River Edge, NJ, 2003, pp. 123–137.[MR]