1. Atkinson, M.D. (1975): An algorithm for finding the blocks of a permutation group, Math. Comp., 29, pp.911–913.
2. Butler, G. (1985): Effective computation with group homomorphisms, J. Symbolic Comp., 1, pp.143–157.
3. Butler, G. (1986): Data structures and algorithms for cyclically extended Schreier vectors, Congressus Numerantum 52, 63–78.
4. Butler, G. (1990), Computing a conditioned pc presentation of a soluble permutation group, TR 392, Basser Department of Computer Science, University of Sydney, 5 pages.
5. Butler, G., and Cannon, J.J. (1982): Computing in permutation and matrix groups I: normal closure, commutator subgroup, series, Math. Comp., 39, pp.663–670.