A variety of elementary combinatorial techniques for permutation groups are reviewed.
Emphasis is placed on randomized techniques and new data structures.
The paper includes both a survey of recent algorithms with which the authors have been associated, and some new algorithms in the same spirit that have not previously appeared in print. Many of the results include both complexity bounds and pseudo-code, along with comments for faster software implementations. Bm and g 2 hSig. PP lowness for several abelian black box groups problems. Fast monte carlo algorithms for permutation groups - Babai, Cooperman et al.