1. G. D. Cooperman, W. Lempken, G. O. Michler, and M. Weller, A new existence proof of Janko's simple group J4, Computational methods for representations of groups and algebras (Essen, 1997), Progr. Math., vol. 173, Birkhäuser, Basel, 1999, pp. 161–175.[MR]
  2. Gene Cooperman, Parallel GAP: Mature interactive parallel computing, Groups and computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 123–138.[MR]
  3. Gene Cooperman, Larry Finkelstein, and Michael Tselman, Computing with matrix groups using permutation representations, in ISSAC '95: Proceedings of the 1995 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 1995, pp. 259–264.[doi]
  4. Gene Cooperman, Larry Finkelstein, Michael Tselman, and Bryant York, Constructing permutation representations for matrix groups, J. Symbolic Comput. 24 (1997), no. 3-4, 471–488.[MR]
  5. Gene Cooperman and Eric Robinson, Memory-based and disk-based algorithms for very high degree permutation groups, in ISSAC '03: Proceedings of the 2003 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2003, pp. 66–73.[doi]
  6. Eric Robinson and Gene Cooperman, A parallel architecture for disk-based computing over the baby monster and other large finite simple groups, in ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2006, pp. 298–305.[doi]
  7. Eric Robinson, Jürgen Müller, and Gene Cooperman, A disk-based parallel implementation for direct condensation of large permutation modules, ISSAC 2007, ACM, New York, 2007, pp. 315–322.[MR]