M. Aschbacher, On the maximal subgroups of the finite classical groups, Inventiones Mathematicae, vol.63, issue.3, pp.469-514, 1984.
DOI : 10.1007/BF01388470

L. Babai and R. Beals, A polynomial-time theory of black box groups I, Soc. Lecture Note Ser, vol.260, pp.30-64, 1997.
DOI : 10.1017/CBO9781107360228.004

L. Babai, R. Beals, and ´. A. , Seress, Polynomial-time theory of matrix groups, Proc. 41st ACM Symp. on Theory of Computing, pp.55-64, 2009.

L. Babai, P. P. Pálfy, and J. Saxl, Abstract, LMS Journal of Computation and Mathematics, vol.8, pp.82-119, 2009.
DOI : 10.1016/j.ejc.2005.10.011

R. Beals and L. Babai, Las Vegas algorithms for matrix groups, 34th Annual Symposium on, Foundations of Computer Science, pp.427-436, 1993.

R. Beals, C. Leedham-green, A. Niemeyer, C. Praeger, and ´. A. , Seress, A black-box group algorithm for recognizing finite symmetric and alternating groups, I, Trans. Amer, Transactions of the American Mathematical Society, vol.355, issue.05, pp.2097-2113, 2003.
DOI : 10.1090/S0002-9947-03-03040-X

W. Bosma and J. J. Cannon, Handbook of MAGMA functions, School of Mathematics and Statistics, 1995.

J. Bray, An improved method for generating the centralizer of an involution, Archiv der Mathematik, vol.74, issue.4, pp.241-245, 2000.
DOI : 10.1007/s000130050437

P. A. Brooksbank, Abstract, LMS Journal of Computation and Mathematics, vol.8, pp.162-197, 2003.
DOI : 10.2307/1998750

P. A. Brooksbank, Fast constructive recognition of black box symplectic groups, Journal of Algebra, vol.320, issue.2, pp.885-909, 2008.
DOI : 10.1016/j.jalgebra.2008.03.021

P. A. Brooksbank and W. M. Kantor, On constructive recognition of a black box PSL( d , q ), Math. Res. Inst. Publ, vol.8, pp.95-111, 1999.
DOI : 10.1515/9783110872743.95

P. A. Brooksbank and W. M. Kantor, Fast constructive recognition of black box orthogonal groups, Journal of Algebra, vol.300, issue.1, pp.256-288, 2006.
DOI : 10.1016/j.jalgebra.2006.02.024

J. Conway, R. Curtis, S. Norton, R. Parker, and R. Wilson, Atlas of Finite Groups, 1985.

G. The and . Group, GAP ? Groups, Algorithms and Programming, Version 4, 2004.

D. F. Holt, C. R. Leedham-green, E. A. O-'brien, and S. Rees, Computing Matrix Group Decompositions with Respect to a Normal Subgroup, Journal of Algebra, vol.184, issue.3, pp.818-838, 1996.
DOI : 10.1006/jabr.1996.0286

W. M. Kantor and K. Magaard, Black-box exceptional groups
DOI : 10.1090/s0002-9947-2013-05822-9
URL : http://arxiv.org/abs/1112.3000

P. B. Kleidman and M. W. Liebeck, The Subgroup Structure of the Finite Classical Groups, Soc. Lecture Note Series, vol.129, 1990.
DOI : 10.1017/CBO9780511629235

C. R. Leedham-green, The computational matrix group project, Math. Res. Inst. Publ, vol.8, pp.229-247, 1999.
DOI : 10.1515/9783110872743.229

E. M. Luks, Computing in solvable matrix groups, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.111-120, 1992.
DOI : 10.1109/SFCS.1992.267813

P. M. Neumann and C. E. Praeger, A Recognition Algorithm for Special Linear Groups, Proc. London Math. Soc, pp.555-603, 1992.
DOI : 10.1112/plms/s3-65.3.555

M. Neunhöffer, Constructive Recognition of Finite Groups, 2009.

M. Neunhöffer, Talk at the Univ. Birmingham, turnbull.mcs.st-and.ac.uk/?neunhoef/Publications, 2009.

M. Neunhöffer, ´. A. Seress, M. Neunhöffer, ´. A. Seress, M. Gap-package et al., A data structure for a uniform approach to computations with finite groups, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.254-261, 2006.
DOI : 10.1145/1145768.1145811

E. A. O-'brien, Algorithms for matrix groups, in: Groups St. Andrews, Soc. Lecture Note Ser, vol.260, pp.297-323, 2009.

A. J. Ryba, Personal communication at the Oberwolfach workshop on Computational Group Theory, 2011.

R. A. Wilson, A World-Wide-Web Atlas of finite group representations