Fast Monte Carlo algorithms for permutation groups

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	At	M.D. Atkinson, "An algorithm for finding the blocks of a permutation group", Ma#h. Comp. 29 (1975), pp. 911-913.
	Ba1	L. Babai, "Monte Carlo algorithms in graph isomorphism testing", Universit6 de Montr6al Tech. Report D.M.S. 79-10, 1979.
	Ba2	L. Bahai, "On the Length of Chains of Subgroups in the Symmetric Group", Comm. in Algebra 14 (1986), pp. 1729-1736.
	Ba3	László Babai, Bounded round interactive proofs in finite groups, SIAM Journal on Discrete Mathematics, v.5 n.1, p.88-111, Feb. 1992 [doi>10.1137/0405008]
	Ba4	László Babai, Local expansion of vertex-transitive graphs and random generation in finite groups, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.164-174, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103440]
	BCFS	L. Babai, G. Cooperman, L.Finkelstein, and /#. Seress, "Nearly Linear Time Algorithms for Permutation Groups with a Small Base", manuscript
	BLS1	L. Babai , E. Luks , A. Seress, Permutation groups in NC, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.409-420, January 1987, New York, New York, United States [doi>10.1145/28395.28439]
	BLS2	L. Babai, E. Luks, and/i#. Seress, "Fast Management of Permutation Groups", Proc. 28th IEEE EOCS (1988), pp. 272-282.
	BLS3	L. Babai, n. Luks, and/(. Seress, "Fast Deterministic Management of Permutation Groups", in preparation.
	BS	László Babai , Ákos Seress, On the degree of transitivity of permutation groups: A short proof, Journal of Combinatorial Theory Series A, v.45 n.2, p.310-315, July 1987 [doi>10.1016/0097-3165(87)90023-9]
	BSz	L. Babai and E. Szemer6di, "On the complexity of matrix group problems I", 25th IEEE FOCS, Palm Beach FL (1984), pp. 229-240.
	BFP	C. A. Brown , L. Finkelstein , P. W. Purdom, Jr., A new base change algorithm for permutation groups, SIAM Journal on Computing, v.18 n.5, p.1037-1047, Oct. 1989 [doi>10.1137/0218070]
	CST	P. J. Cameron, R. Solomon, and A. Turull, "Chains of subgroups in symmetric groups", J. of Algebra 127 (1989), pp. 340-352.
	CF	Gene Cooperman , Larry Finkelstein, A strong generating test and short presentations for permutation groups, Journal of Symbolic Computation, v.12 n.4-5, p.475-497, Oct./Nov. 1991 [doi>10.1016/S0747-7171(08)80099-5]
	CFS	G. Cooperman , L. Finkelstein , N. Sarawagi, A random base change algorithm for permutation groups, Proceedings of the international symposium on Symbolic and algebraic computation, p.161-168, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96918]
	FHL	M. Furst, J. Hopcroft, and E. Luks, "Polynomial Time Algorithms for Permutation Groups", Proc. 21st IEEE FOCS (1980), pp. 36-41.
	Je	Mark Jerrum, A compact representation for permutation groups, Journal of Algorithms, v.7 n.1, p.60-78, March 1986 [doi>10.1016/0196-6774(86)90038-6]
	Jo	C. jordan, "Nouvelles recherches sur la limite de transitivit# des groupes non altern6s", Bull. Soc. Math. France 1 (1873), pp. 35-60.
	Kn	D.E. Knuth, "Notes on Efficient Representation of Permutation Groups" (1981), unpublished manuscript.
	Si	Charles C. Sims, Computation with permutation groups, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.23-28, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806264]
	Wi	H. Wielandt, "Absch#tzungen fiir den Grad einer Permutationsgruppe von vorgeschriebenem Transitivit#itsgrad", Dissertation, Berlin, 1934. Schriften Math. Seminars Inst. Angew. Math. Univ. Berlin 2 (1934), pp. 151-174.

Collaborative Colleagues:

László Babai: colleagues

Gene Cooperman: colleagues

Larry Finkelstein: colleagues

Eugene Luks: colleagues

Ákos Seress: colleagues