Combinatorica
Polynomial time solutions of some problems of computational algebra
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Computing the structure of finite algebras
Journal of Symbolic Computation - Special issue on computational algebraic complexity
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
Approximate representation theory of finite groups
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Deciding finiteness of matrix groups in Las Vegas polynomial time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Computations for algebras and group representations
Computations for algebras and group representations
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
The growth rate of vertex-transitive planar graphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for computing with nilpotent matrix groups over infinite domains
Journal of Symbolic Computation
On deciding finiteness of matrix groups
Journal of Symbolic Computation
Quantum automata and algebraic groups
Journal of Symbolic Computation
Recognizing finite matrix groups over infinite fields
Journal of Symbolic Computation
Hi-index | 0.00 |