Effective computation with group homomorphisms
Journal of Symbolic Computation
A General backtrack algorithm for the isomorphism problem of combinatorial objects
Journal of Symbolic Computation
Reduction of group constructions to point stabilizers
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Computing in permutation and matrix groups III: Sylow subgroups
Journal of Symbolic Computation
A random base change algorithm for permutation groups
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Fast Monte Carlo algorithms for permutation groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Nearly linear time algorithms for permutation groups with a small base
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Structure forest and composition factors for small base groups in nearly linear time
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast recognition of doubly transitive groups
Journal of Symbolic Computation - Special issue on computational group theory: part 2
A strong generating test and short presentations for permutation groups
Journal of Symbolic Computation - Special issue on computational group theory: part 2
The computation of normalizers in permutation groups
Journal of Symbolic Computation - Special issue on computational group theory: part 2
Permutation group algorithms based on partitions, I: Theory and algorithms
Journal of Symbolic Computation - Special issue on computational group theory: part 2
A fast cyclic base change for permutation groups
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
An elementary algorithm for computing the composition factors of a permutation group
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Finding blocks of imprimitivity in small-base groups in nearly linear time
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
STAR/MPI: binding a parallel library to interactive symbolic algebra systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Computing with matrix groups using permutation representations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On sampling generating sets of finite groups and product replacement algorithm: extended abstract
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Intelligent backtracking using symmetry
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Computing transformation semigroups
Journal of Symbolic Computation
Backtrack searching in the presence of symmetry
Nordic Journal of Computing
Symmetric Block Ciphers Based on Group Bases
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
TOP-C: a task-oriented parallel C interface
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Memory-based and disk-based algorithms for very high degree permutation groups
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
On the diameter of the symmetric group: polynomial bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the smallest image of a set
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Polynomial-time theory of matrix groups
Proceedings of the forty-first annual ACM symposium on Theory of computing
Computation schemes for splitting fields of polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Complexity classes of equivalence problems revisited
Information and Computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Code equivalence and group isomorphism
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Linear optimization over permutation groups
Discrete Optimization
Polynomial-time isomorphism test for groups with no abelian normal subgroups
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
The purpose of this paper is to provide an introduction to some computational techniques which have proved useful in the study of large permutation groups. In particular they have been used to study the Suzuki simple group of degree 1782 and order 448,345,497,600 and the simple group G2(5) of order 5,859,000,000 in a representation of degree 3906. Many of the algorithms discussed here are still in a developmental state and no claim is made that the most efficient solutions have been found.