[HN80] Havas, G. and Newman, M. F., Application of computers to questions like those of Burnside, in Burnside groups (Proc. Workshop, Univ. Bielefeld, Bielefeld, 1977), Springer, Lecture Notes in Math., 806, Berlin (1980), 211--230.
[LS90] Leedham-Green, C. R. and Soicher, L. H.,
Collection from the left and other strategies,
J. Symbolic Comput.,
9 (5-6)
(1990),
665--675
(Computational group theory, Part 1).
[New77] Newman, M. F., Determination of groups of prime-power order, in Group theory (Proc. Miniconf., Australian Nat. Univ., Canberra, 1975), Springer, Berlin (1977), 73--84. Lecture Notes in Math., Vol. 573.
[NNN98] Newman, M. F., Nickel, W. and Niemeyer, A. C., Descriptions of groups of prime-power order, J. Symbolic Comput., 25 (5) (1998), 665--682.
[NO96] Newman, M. F. and O'Brien, E. A., Application of computers to questions like those of Burnside. II, Internat. J. Algebra Comput., 6 (5) (1996), 593--605.
[O'B90] O'Brien, E. A.,
The p-group generation algorithm,
J. Symbolic Comput.,
9 (5-6)
(1990),
677--698
(Computational group theory, Part 1).
[O'B94] O'Brien, E. A., Isomorphism testing for p-groups, J. Symbolic Comput., 17 (2) (1994), 131, 133--147.
[O'B95] O'Brien, E. A., Computing automorphism groups of p-groups, in Computational algebra and number theory (Sydney, 1992), Kluwer Acad. Publ., Math. Appl., 325, Dordrecht (1995), 83--90.
[Sim94] Sims, C. C.,