New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
Amortized Communication Complexity of Distributions
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
The communication complexity of correlation
IEEE Transactions on Information Theory
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching
SIAM Journal on Computing
Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Direct product via round-preserving compression
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Direct sum fails for zero error average communication
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.06 |
There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...