Fast recognition of the nilpotency of permutation groups

Authors:
Ferenc Rákóczi
Affiliations:
Computer and Information Science, University of Oregon
Venue:
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Year:
1995

Computing normalizers in permutation p-groups

ISSAC '94 Proceedings of the 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
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Hi-index	0.00