1. Karim. Belabas, Mark van Hoeij, J. Klüners, and Allan Steel, Factoring polynomials over global fields, Journal de Théorie des Nombres de Bordeaux (2009), no. 21, 15–39.
  2. Wieb Bosma, John Cannon, and Allan Steel, Lattices of compatibly embedded finite fields, J. Symbolic Comput. 24 (1997), no. 3-4, 351–369.[MR]
  3. 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]
  4. Gregor Kemper and Allan Steel, Some algorithms in invariant theory of finite groups, Computational Methods for Representations of Groups and Algebras (Essen, 1997), Progr. Math., vol. 173, Birkhäuser, Basel, 1999, pp. 267–285.[MR]
  5. Gabriele Nebe and Allan Steel, Recognition of division algebras, J. Algebra 322 (2009), no. 3, 903–909.[doi]
  6. Allan Steel, A new algorithm for the computation of canonical forms of matrices over fields, J. Symbolic Comput. 24 (1997), no. 3-4, 409–432.[MR]
  7. Allan Steel, A new scheme for computing with algebraically closed fields, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 491–505.[MR]
  8. Allan Steel, Conquering inseparability: Primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, J. Symbolic Comput. 40 (2005), no. 3, 1053–1075.[MR]
  9. Allan K. Steel, Computing with algebraically closed fields, J. Symbolic Comput. 45 (2010), no. 3, 342–372.