1. Peter A. Brooksbank and Eugene M. Luks, Testing isomorphism of modules, J. Algebra 320 (2008), no. 11, 4020–4029.[MR/doi]
  2. Eugene M. Luks and Pierre McKenzie, Parallel algorithms for solvable permutation groups, J. Comput. System Sci. 37 (1988), no. 1, 39–62.[MR]
  3. Eugene M. Luks and Takunari Miyazaki, Polynomial-time normalizers for permutation groups with restricted composition factors, in ISSAC '02: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2002, pp. 176–183 (electronic).[MR/link]
  4. Eugene M. Luks, Ferenc Rákóczi, and Charles R. B. Wright, Computing normalizers in permutation p-groups, in ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 1994, pp. 139–146.[doi]
  5. Eugene M. Luks, Ferenc Rákóczi, and Charles R. B. Wright, Some algorithms for nilpotent permutation groups, J. Symbolic Comput. 23 (1997), no. 4, 335–354.[MR]