1. An algorithm for finding the blocks of a permutation group;Atkinson;Math. Comp.,1975
2. Monte-Carlo algorithms in graph isomorphism testing;Babai,1979
3. Moderately exponential bound for graph isomorphism;Babai,1981
4. L. Babai, P. J. Cameron, and P. P. Pálfy, On the order of primitive permutation groups with bounded nonabelian composition factors, to appear. 5.|L. Babai and E. Luks, A subexponential algorithm for tournament isomorphism, to appear.
5. Finite permutation groups and finite simple groups;Cameron;Bull. London Math. Soc.,1981