The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Quantum computation of Fourier transforms over symmetric groups
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum Fourier sampling simplified
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
The Complexity of Solving Equations Over Finite Groups
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
On quantum algorithms for noncommutative hidden subgroups
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum Factoring, Discrete Logarithms, and the Hidden Subgroup Problem
Computing in Science and Engineering
Quantum algorithms for some hidden shift problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Hidden translation and orbit coset in quantum computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Generic quantum Fourier transforms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The quantum query complexity of the hidden subgroup problem is polynomial
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
New lattice-based cryptographic constructions
Journal of the ACM (JACM)
The hidden subgroup problem and permutation group theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The Symmetric Group Defies Strong Fourier Sampling
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Information and Computation
Generic quantum Fourier transforms
ACM Transactions on Algorithms (TALG)
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Journal of the ACM (JACM)
On the impossibility of a quantum sieve algorithm for graph isomorphism
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum algorithms for Simon's problem over general groups
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum algorithms for Simon's problem over nonabelian groups
ACM Transactions on Algorithms (TALG)
Information and Computation
Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups
Quantum Information & Computation
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
Quantum Information & Computation
Topological Structure of Quantum Algorithms
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.02 |