1. L. Babai, E. Luks, and A. Seress, “On Managing Permutation Groups in O(n4logc7n)”,Proc. 28th IEEE FOCS (1988), 272–282.
2. C. A. Brown, G. Cooperman, and L. Finkelstein, “Solving Permutation Problems Using Rewriting Rules”, to appear inProc. of the International Symposium on Symbolic and Algebraic Computation (ISSAC 88, Rome, Italy), Springer Verlag Lecture Notes in Computer Science.
3. G. Cooperman and L.A. Finkelstein, “Short Presentations for Permutation Groups and a Strong Generating Test”, submitted to J. Symbolic Computation.
4. M. Hall, Jr.,The Theory of Groups ,Macmillan, New York, 1959.
5. M. Jerrum, “A Compact Representation for Permutation Groups”, J.Algorithms 7 (1986), 60–78.