Bibliography

Atk75

M.D. Atkinson.
An algorithm for findingthe blocks of a permutation group.
Math. Comp., 29:911--913, 1975.

BC82

G. Butler and J.J. Cannon.
Computing with permutation and matrix groups I: Normal closure, commutator subgroups, series.
Math. Comp., 39:671--680, 1982.

Bea93

G. Beals.
Algorithms for finite groups.
PhD thesis, University of Chicago, 1993.

But85

Gregory Butler.
Effective computation with group homomorphisms.
J. Symbolic Comp., 1:143--157, 1985.

CB92

J.J. Cannon and W. Bosma.
Structural computation in finite permutation groups.
CWI Quarterly, 5(2):127--160, 1992.

CC91

P.J. Cameron and J.J. Cannon.
Recognizing doubly transitive groups.
J. Symb. Comp., 12(4/5):459--474, 1991.

CH

J.J. Cannon and D.F. Holt.
Automorphism group computation and isomorphism testing in finite groups.
submitted.

CH97

J.J. Cannon and D.F. Holt.
Computing chief series, composition series and socles in large permutation groups.
J. Symb. Comp., 24(3/4):285--301, 1997.

CLG91

C.E. Praeger & L.H. Soicher C.R. Leedham-Green.
Computing with group homomorphisms.
J. Symbolic Comp., 12(4/5):527--532, 1991.

CLGM+95

Frank Celler, Charles R. Leedham-Green, Scott H. Murray, Alice C. Niemeyer, and E. A. O'Brien.
Generating random elements of a finite group.
Comm. Algebra, 23(13):4931--4948, 1995.

CS

J.J. Cannon and B. Souvignier.
On the computation of normal subgroups in permutation groups.
to appear, International Journal of Algebra and Computation.

CS97

J.J. Cannon and B. Souvignier.
On the computation of conjugacy classes in permutation groups.
In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pages 392--399. Association for Computing Machinery, 1997.
Maui, July 21--23, 1997.

Hol84

D.F. Holt.
The calculation of the Schur multiplier of a permutation group.
In Computational group theory (Durham, 1982), pages 307--319. Academic Press, London, 1984.

Hol85a

D.F. Holt.
A computer program for the calculation of a covering group of a finite group.
J. Pure Appl. Algebra, 35(3):287--295, 1985.

Hol85b

D.F. Holt.
The mechanical computation of first and second cohomology groups.
J. Symbolic Comp., 1(4):351--361, 1985.

Hol91

D.F. Holt.
The computation of normalizers in permutation groups.
J. Symbolic Comp., 12(4/5):499--516, 1991.

JCH97

B. Cox J.J. Cannon and D.F. Holt.
Computing Sylow subgroups in permutation groups.
J. Symb. Comp., 24(3/4):303--316, 1997.

JCH01

B. Cox J.J. Cannon and D.F. Holt.
Computing the subgroups of a permutation group.
J. Symb. Comp., 31:149--161, 2001.

Kan91

William M. Kantor.
Finding composition factors of permutation groups of degree n <= 10sp 6.
J. Symbolic Comp., 12(4/5):517--526, 1991.

Leo97

Jeffrey S. Leon.
Partitions, refinements, and permutation group computation.
In Larry Finkelstein and William M. Kantor, editors, Groups and Computation II, volume 28 of Dimacs series in Discrete Mathematics and Computer Science, pages 123--158, Providence R.I., 1997. Amer. Math. Soc.

LS97

Eugene M. Luks and Akos Seress.
Computing the Fitting subgroup and solvable radical of small-base permutation groups in nearly linear time.
In Groups and computation II(New Brunswick, NJ, 1995), volume 28 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 169--181. Amer. Math. Soc., 1997.

Luk93

E.M. Luks.
Permutation groups and polynomial-time computation.
In Groups and computation (New Brunswick, NJ, 1991), volume 11 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 139--175. Amer. Math. Soc., 1993.

MN89

M. Mecky and J. Neubüser.
Some remarks on the computation of conjugacy classes of soluble groups.
Bull. Austral, Math. Soc., 40(2):281--292, 1989.

Neu86

P.M. Neumann.
Some algorithms for computing with finite permutation groups.
In C.M. Campbell E.F. Robertson, editor, Groups - St. Andrews 1985, number 121 in London Math. Soc. Lecture Notes Series, 1986.

Sim90

Charles C. Sims.
Computing the order of a solvable permutation group.
J. Symb. Comp., 9(5/6):699--705, 1990.

SS94

M. Schönert and A. Seress.
Finding blocks of imprimitivity in small-base groups in nearly linear time.
In Proc. 1994 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., pages 154--157, 1994.

Ung

W.R. Unger.
Computing chief series of a large permutation group.
In preparation.

Ung02

W.R. Unger.
Computing the solvable radical of a permutation group.
In preparation, 2002.