Finkelstein and A Seress, Nearly linear time algorithms for permutation groups with a small base (1991)

by G Cooperman Babai
Venue:in: Proc. Int. Symp. Symbolic and Algebraic Computation, ACM