Lower bounds on communication complexity
Information and Computation
Randomized versus nondeterministic communication complexity
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
Rounds in communication complexity revisited
SIAM Journal on Computing
Different modes of communication
SIAM Journal on Computing
On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh 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
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Quantum circuits with mixed states
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
Information theory of quantum entanglement and measurement
PhysComp96 Proceedings of the fourth workshop on Physics and computation
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Dense quantum coding and a lower bound for 1-way quantum automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The communication complexity of pointer chasing: applications of entropy and sampling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Classical versus quantum communication complexity
ACM SIGACT News
On the Size of Probabilistic Formulae
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Computation with Limited Nondeterminism
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
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
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
On communication over an entanglement-assisted quantum channel
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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 branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Limits on the ability of quantum states to convey classical messages
Journal of the ACM (JACM)
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Superiority of exact quantum automata for promise problems
Information Processing Letters
Quantum weakly nondeterministic communication complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Unbounded-error one-way classical and quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Quantum weakly nondeterministic communication complexity
Theoretical Computer Science
| Hi-index | 0.00 |