A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Random oracles separate PSPACE from the polynomial-time hierarchy
Information Processing Letters
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
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
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
Nearly linear time algorithms for permutation groups with a small base
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Bounded round interactive proofs in finite groups
SIAM Journal on Discrete Mathematics
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Fast Monte Carlo algorithms for permutation groups
Selected papers of the 23rd annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Recent Directions in Algorithmic Research
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Isomorphism of graphs with bounded eigenvalue multiplicity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Computation with permutation groups
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Expansion Of Product Replacement Graphs
Combinatorica
Product growth and mixing in finite groups
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorics, Probability and Computing
Polynomial-time algorithms for permutation groups
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Isomorphism of graphs of bounded valence can be tested in polynomial time
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
On The Complexity Of Matrix Group Problems I
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Computing in solvable matrix groups
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Polynomial-time theory of matrix groups
Proceedings of the forty-first annual ACM symposium on Theory of computing
Poly-logarithmic Independence Fools AC^0 Circuits
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
| Hi-index | 0.00 |
Finite groups have affected complexity theory and complexity theory has had an impact on computational group theory. This paper is a personal account of the author's journey through the evolution of some of these interconnections, culminating in recent definitive results on the matrix group membership problem