Bibliography

BE99a

Hans Ulrich Besche and Bettina Eick.
Construction of finite groups.
J. Symbolic Comput., 27(4):387--404, 1999.

BE99b

Hans Ulrich Besche and Bettina Eick.
The groups of order at most 1000 except 512 and 768.
J. Symbolic Comput., 27(4):405--413, 1999.

BE01

Hans Ulrich Besche and Bettina Eick.
The groups of order q sp n.p.
Comm. Algebra, 29(4):1759--1772, 2001.

BEO01

Hans Ulrich Besche, Bettina Eick, and E. A. O'Brien.
The groups of order at most 2000.
Electron. Res. Announc. Amer. Math. Soc., 7:1--4 (electronic), 2001.

BP00

Sergey Bratus and Igor Pak.
Fast constructive recognition of a black box group isomorphic to S_n or A_n using Goldbach's conjecture.
J. Symbolic Comp., 29:33--57, 2000.

Hul

Alexander Hulpke.
Constructing transitive permutation groups.
in preparation.

Neb96

G. Nebe.
Finite subgroups of ( GL)_n(( Q)) for 25 <= n <= 31.
Comm. Algebra, 24(7):2341--2397, 1996.

Neb98

G. Nebe.
Finite quaternionic matrix groups.
Represent. Theory, 2:106--223, 1998.

NP95

G. Nebe and W. Plesken.
Finite rational matrix groups.
Mem. Amer. Math. Soc., 116(556), 1995.

O'B90

E.A. O'Brien.
The p-group generation algorithm.
J. Symbolic Comput., 9:677--698, 1990.

O'B91

E.A. O'Brien.
The Groups of Order 256.
J. Algebra, 143:219--235, 1991.

Sim70

C.C. Sims.
Computational methods in the study of permutation groups.
In J. Leech, editor, Computational problems in abstract algebra, pages 169--183. Oxford - Pergamon, 1970.