The following publications are possibly variants of this publication:
- A Random Base Change Algorithm for Permutation GroupsGene Cooperman, Larry Finkelstein, N. Sarawagi. issac 1990: 161-168 [doi]
- Fast Group Membership Using a Strong Generating Test for Permutation GroupsGene Cooperman, Larry Finkelstein, Paul Walton Purdom Jr.. cm 1989: 27-36 [doi]
- Combinatorial Tools for Computational Group TheoryGene Cooperman, Larry Finkelstein. dimacs 1993: 53-86
- A Fast Cyclic Base Change for Permutation GroupsGene Cooperman, Larry Finkelstein. issac 1992: 224-232 [doi]
- A Strong Generating Test and Short Presentation for Permutation GroupsGene Cooperman, Larry Finkelstein. JSC, 12(4/5):475-498, 1991.
- A Random Base Change Algorithm for Permutation GroupsGene Cooperman, Larry Finkelstein. JSC, 17(6):513-528, 1994.
- Reduction of Group Constructions to Point StabilizersGene Cooperman, Larry Finkelstein, Eugene M. Luks. issac 1989: 351-356 [doi]
- Computing with Matrix Groups Using Permutation RepresentationsGene Cooperman, Larry Finkelstein, Michael Tselman. issac 1995: 259-264 [doi]
- Constructive recognition of a black box group isomorphic to GL(n,2)Gene Cooperman, Larry Finkelstein, Steve Linton. dimacs 1996: 85-100
- Constructing Permutation Representations for Matrix GroupsGene Cooperman, Larry Finkelstein, Michael Tselman, Bryant W. York. JSC, 24(3/4):471-488, 1997.
- Applications of Cayley GraphsGene Cooperman, Larry Finkelstein, N. Sarawagi. AAECC 1991: 367-378