A compact representation for permutation groups
Journal of Algorithms
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Combinatorica
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
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
A random base change algorithm for permutation groups
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Bounded round interactive proofs in finite groups
SIAM Journal on Discrete Mathematics
Fast Monte Carlo algorithms for permutation groups
Selected papers of the 23rd annual ACM symposium on Theory of computing
Fast Monte Carlo algorithms for permutation 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
Structure forest and composition factors for small base groups in nearly linear time
STOC '92 Proceedings of the twenty-fourth 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
Decomposition of *-closed algebras in polynomial time
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Deciding finiteness of matrix groups in deterministic polynomial time
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Constructing permutation representations for large matrix groups
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
On sampling generating sets of finite groups and product replacement algorithm: extended abstract
ISSAC '99 Proceedings of the 1999 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
Strong bias of group generators: an obstacle to the “product replacement algorithm”
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Constructive recognition of classical groups in their natural representation
Journal of Symbolic Computation
Memory-based and disk-based algorithms for very high degree permutation groups
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
On Local Expansion of Vertex-Transitive Graphs
Combinatorics, Probability and Computing
Strong bias of group generators: an obstacle to the "product replacement algorithm"
Journal of Algorithms - Special issue: SODA 2000
Generating random elements of abelian groups
Random Structures & Algorithms
On the diameter of Eulerian orientations of graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Polynomial-time theory of matrix groups
Proceedings of the forty-first annual ACM symposium on Theory of computing
A full characterization of quantum advice
Proceedings of the forty-second ACM symposium on Theory of computing
Quantum and randomized lower bounds for local search on vertex-transitive graphs
Quantum Information & Computation
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
Quantum Information & Computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Property testing for cyclic groups and beyond
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The Product Replacement Prospector
Journal of Symbolic Computation
SZK proofs for black-box group problems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Quantum algorithms for a set of group theoretic problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
The complexity of black-box ring problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Near-Optimal expanding generator sets for solvable permutation groups
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
A note on computing involution centralizers
Journal of Symbolic Computation
Property testing for cyclic groups and beyond
Journal of Combinatorial Optimization
| Hi-index | 0.00 |