1. William M. Kantor and Ákos Seress, Black box classical groups, Mem. Amer. Math. Soc. 149 (2001), no. 708, viii+168.[MR]
  2. 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]
  3. Kay Magaard, E. A. O'Brien, and Ákos Seress, Recognition of small dimensional representations of general linear groups, J. Aust. Math. Soc. 85 (2008), no. 2, 229–250.[MR]
  4. Max Neunhöffer and Ákos Seress, A data structure for a uniform approach to computations with finite groups, ISSAC'06: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2006, pp. 254–261.[MR/doi]
  5. Ákos Seress, An introduction to computational group theory, Notices Amer. Math. Soc. 44 (1997), no. 6, 671–679.[MR]
  6. Ákos Seress, Nearly linear time algorithms for permutation groups: an interplay between theory and practice, Acta Appl. Math. 52 (1998), no. 1-3, 183–207.[MR]
  7. Ákos Seress, Permutation Group Algorithms, Cambridge Tracts in Mathematics, vol. 152, Cambridge University Press, Cambridge, 2003, pp. x+264.[MR]
  8. Ákos Seress, A unified approach to computations with permutation and matrix groups, International Congress of Mathematicians. Vol. II, Eur. Math. Soc., Zürich, 2006, pp. 245–258.[MR]