1. L. Adleman and K. Manders, Reducibility, randomness and intractability. Proc. 9th Annu. ACM Symp. on Theory of Computing (1977) 151–163.
2. L. Babai. On the isomorphism problem, Preprint, Proc. of the FCT '77 Conf., Poznań-Kórnik, Poland (Sept. 1977).
3. On the complexity of canonical labelling of strongly regular graphs;Babai;SIAM J. Comput.,1980
4. L. Babai, The star system problem is at least as hard as the graph isomorphism problem, in: A. Hajnal and V. T. Sós, Eds., Combinatorics (Proc. Conf. Keszthely, Hungary, 1976). (North-Holland, Amsterdam, 1978) 1214.
5. L. Babai. On the order of primitive permutation groups, submitted.