1. Babai, L., 1991. Local expansion of vertex-transitive graphs and random generation in finite groups. Proceedings of the ACM Symposium on Theory of Computing. pp. 164–174
2. Brooksbank, P., 2001a. A constructive recognition algorithm for the matrix group Ω(d,q). In: Kantor, W.M., Seress, Á. (Eds.), Groups and Computation III, vol. 8. Ohio State University Math. Res. Inst. Publ., Walter de Gruyter, Berlin, New York
3. Brooksbank, P., 2001b. Constructive recognition of the finite simple classical groups. Ph. D. Thesis, U. Oregon
4. Celler, F., 1997. Matrixgruppenalgorithmen in GAP. Ph. D. Thesis, RWTH Aachen
5. Celler, F., Leedham-Green, C.R., 1998. A constructive recognition algorithm for the special linear group. The Atlas of Finite Groups: Ten Years On (Birmingham 1995), London Mathematic Society Lecture Note Series, vol. 249