On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh 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
Public vs. private coin flips in one round communication games (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth 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
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Estimating simple functions on the union of data streams
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Distributed streams algorithms for sliding windows
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Lower Bounds in the Quantum Cell Probe Model
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
STACS '00 Proceedings of the 17th 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
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the power of quantum fingerprinting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Sampling lower bounds via information theory
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
Exponential separation of quantum and classical one-way communication complexity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On multi-partition communication complexity
Information and Computation
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Bounded-error quantum state identification and exponential separations in communication complexity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The communication complexity of the Hamming distance problem
Information Processing Letters
A characterization of average case communication complexity
Information Processing Letters
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Can quantum mechanics help distributed computing?
ACM SIGACT News
Multi-party Quantum Communication Complexity with Routed Messages
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
Functional Monitoring without Monotonicity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On multi-partition communication complexity
Information and Computation
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
SIAM Journal on Computing
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching
SIAM Journal on Computing
Partition arguments in multiparty communication complexity
Theoretical Computer Science
Tight bounds on communication complexity of symmetric XOR functions in one-way and SMP models
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Non-local box complexity and secure function evaluation
Quantum Information & Computation
Classical and quantum fingerprinting with shared randomness and one-sided error
Quantum Information & Computation
On the role of shared entanglement
Quantum Information & Computation
Space lower bounds for online pattern matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A little advice can be very helpful
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A note on randomized streaming space bounds for the longest increasing subsequence problem
Information Processing Letters
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The communication complexity of non-signaling distributions
Quantum Information & Computation
Multiple usage of random bits in finite automata
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
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
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Space lower bounds for online pattern matching
Theoretical Computer Science
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
| Hi-index | 0.89 |