Computing normalizers in permutation p-groups

Authors:
Eugene M. Luks;Ferenc Rákóczi;Charles R. B. Wright
Affiliations:
Computer and Information Science, University of Oregon;Computer and Information Science, University of Oregon;Department of Mathematics, University of Oregon
Venue:
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1994

An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs

Journal of the ACM (JACM)
Parallel algorithms for solvable permutation groups

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Computing intersections and normalizersin soluble groups

Journal of Symbolic Computation
Computing in quotient groups

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The computation of normalizers in permutation groups

Journal of Symbolic Computation - Special issue on computational group theory: part 2
On Holt's algorithm

Journal of Symbolic Computation

Fast recognition of the nilpotency of permutation groups

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Polynomial-time normalizers for permutation groups with restricted composition factors

Proceedings of the 2002 international symposium on Symbolic and algebraic computation

Hi-index	0.00