SIAM Journal on Computing
On the distributional complexity of disjointness
Theoretical Computer Science
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum cryptanalysis of hash and claw-free functions
ACM SIGACT News
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Information Processing Letters
The Quantum Communication Complexity of Sampling
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Better Lower Bound for Quantum Algorithms Searching an Ordered List
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Quantum lower bound for the collision problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Quantum Computing Challenge
Informatics - 10 Years Back. 10 Years Ahead.
On Learning Correlated Boolean Functions Using Statistical Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
On Quantum Versions of the Yao Principle
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum time-space tradeoffs for sorting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Graph entropy and quantum sorting problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum lower bounds for the collision and the element distinctness problems
Journal of the ACM (JACM)
A lower bound on the quantum query complexity of read-once functions
Journal of Computer and System Sciences
Quantum and classical tradeoffs
Theoretical Computer Science
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Quantum Separation of Local Search and Fixed Point Computation
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
Quantum search on bounded-error inputs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On quantum one-way permutations
Quantum Information & Computation
Quantum lower bound for recursive Fourier sampling
Quantum Information & Computation
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum adversary (upper) bound
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
| Hi-index | 0.01 |