NP is as easy as detecting unique solutions
Theoretical Computer Science
Combinatorica - Theory of Computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
On the distributional complexity of disjointness
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Private vs. common random bits in communication complexity
Information Processing Letters
STOC '93 Proceedings of the twenty-fifth 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
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
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first 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
Rapid sampling though quantum computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
On communication over an entanglement-assisted quantum channel
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Quantum and Approximate Privacy
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Quantum Computing Challenge
Informatics - 10 Years Back. 10 Years Ahead.
Power, Puzzles and Properties of Entanglement
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Quantum Versions of the Yao Principle
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
New degree bounds for polynomial threshold functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum entanglement as a new information processing resource
New Generation Computing - Quantum computing
Exponential separation of quantum and classical one-way communication complexity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum networks: from quantum cryptography to quantum architecture
ACM SIGCOMM Computer Communication Review
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Limits on the ability of quantum states to convey classical messages
Journal of the ACM (JACM)
Polynomial degree vs. quantum query complexity
Journal of Computer and System Sciences - Special issue on FOCS 2003
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The communication complexity of the Hamming distance problem
Information Processing Letters
On the power of Ambainis lower bounds
Theoretical Computer Science
On a restricted cross-intersection problem
Journal of Combinatorial Theory Series A
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A broader view on the limitations of information processing and communication by nature
Natural Computing: an international journal
Classical interaction cannot replace a quantum message
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Can quantum mechanics help distributed computing?
ACM SIGACT News
From Logic to Physics: How the Meaning of Computation Changed over Time
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Multi-party Quantum Communication Complexity with Routed Messages
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Quantum search on bounded-error inputs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On quantum algorithms for noncommutative hidden subgroups
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
What can be observed locally? round-based models for quantum distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
ACM SIGACT News
Composition theorems in communication complexity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Any AND-OR Formula of Size $N$ Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
SIAM Journal on Computing
Quantum one-way communication can be exponentially stronger than classical communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Unbounded-error quantum query complexity
Theoretical Computer Science
The quantum query complexity of certification
Quantum Information & Computation
On quantum-classical equivalence for composed communication problems
Quantum Information & Computation
Distributed construction of quantum fingerprints
Quantum Information & Computation
Recasting mermin's multi-player game into the framework of pseudo-telepathy
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Exact quantum lower bound for grover's problem
Quantum Information & Computation
On the power of lower bound methods for one-way quantum communication complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Streaming algorithms with one-sided estimation
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Journal of the ACM (JACM)
Communication complexity as a principle of quantum mechanics
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Promised and distributed quantum search
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Faster quantum algorithm for evaluating game trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A new exponential separation between quantum and classical one-way communication complexity
Quantum Information & Computation
The communication complexity of non-signaling distributions
Quantum Information & Computation
SIAM Journal on Computing
Classical and quantum partition bound and detector inefficiency
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Unbounded-error one-way classical and quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The quantum query complexity of read-many formulas
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Intricacies of quantum computational paths
Quantum Information Processing
Experimental multipartner quantum communication complexity employing just one qubit
Natural Computing: an international journal
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Deterministic quantum non-locality and graph colorings
Theoretical Computer Science
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
Towards characterizing the non-locality of entangled quantum states
Theoretical Computer Science
Superlinear advantage for exact quantum algorithms
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |