Perceptrons: expanded edition
On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
A framework for fast quantum mechanical algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Sampling algorithms: lower bounds and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Quantum summation with an application to integration
Journal of Complexity
Average-Case Quantum Query Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On a problem in quantum summation
Journal of Complexity
Quantum integration in Sobolev classes
Journal of Complexity
From Monte Carlo to quantum computation
Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Quantum approximation I. Embeddings of finite-dimensional Lp spaces
Journal of Complexity
ACM SIGACT News
Sharp error bounds on quantum Boolean summation in various settings
Journal of Complexity
The power of various real-valued quantum queries
Journal of Complexity
Average case quantum lower bounds for computing the Boolean mean
Journal of Complexity
Randomized and quantum algorithms yield a speed-up for initial-value problems
Journal of Complexity
Classical and Quantum Complexity of the Sturm--Liouville Eigenvalue Problem
Quantum Information Processing
On the Complexity of Searching for a Maximum of a Function on a Quantum Computer
Quantum Information Processing
Improved bounds on the randomized and quantum complexity of initial-value problems
Journal of Complexity
The Quantum Setting with Randomized Queries for Continuous Problems
Quantum Information Processing
Polynomial degree vs. quantum query complexity
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the power of Ambainis lower bounds
Theoretical Computer Science
A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries
Quantum Information Processing
Proceedings of the 24th international conference on Machine learning
Quantum lower bounds by entropy numbers
Journal of Complexity
On the complexity of the multivariate Sturm--Liouville eigenvalue problem
Journal of Complexity
A Quantum Algorithm for Finding the Modal Value
Quantum Information Processing
Improved bounds on the randomized and quantum complexity of initial-value problems
Journal of Complexity
Quantum random walks - new method for designing quantum algorithms
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Adiabatic quantum counting by geometric phase estimation
Quantum Information Processing
New developments in quantum algorithms
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Quantum Information Processing
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Optimality proofs of quantum weight decision algorithms
Quantum Information Processing
Numerical analysis on a quantum computer
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Quantum speed-up for unsupervised learning
Machine Learning
Histogram-based segmentation of quantum images
Theoretical Computer Science
| Hi-index | 0.00 |