On the degree of transitivity of permutation groups: A short proof

Authors:
László Babai;Ákos Seress
Affiliations:
Eo¨tvo¨s Univ., Budapest, Hungary;Hungarian Academy of Sciences, Budapest, Hungary
Venue:
Journal of Combinatorial Theory Series A
Year:
1987

Fast Monte Carlo algorithms for permutation groups

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the automorphism groups of strongly regular graphs I

Proceedings of the 5th conference on Innovations in theoretical computer science

Hi-index	0.00