STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Polynomial-time versions of Sylow's theorem
Journal of Algorithms
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Reduction of group constructions to point stabilizers
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Computing the structure of finite algebras
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Finding Sylow normalizers in polynomial time
Journal of Algorithms
Moderately Exponential Bound for Graph Isomorphism
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Normal forms for trivalent graphs and graphs of bounded valence
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Deciding finiteness of matrix groups in Las Vegas polynomial time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Computing normalizers in permutation p-groups
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Automorphism group computation and isomorphism testing in finite groups
Journal of Symbolic 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 |