On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Communication complexity
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Optimal space lower bounds for all frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
Graph Distances in the Data-Stream Model
SIAM Journal on Computing
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
Cell-probe lower bounds for succinct partial sums
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the exact space complexity of sketching and streaming small norms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for sparse recovery
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
For a variety of reasons, a number of recent works have studied the classic communication problem INDEX, and its variant AUGMENTED-INDEX, from a tradeoff perspective: how much communication can Alice (the player holding the n data bits) save if Bob (the player holding the index) communicates a nontrivial amount? Recently, Magniez et al. (STOC, 2010), Chakrabarti et al. (FOCS, 2010) and Jain and Nayak gave information cost tradeoffs for this problem, where the amount of communication is measured as the amount of information revealed by one player to the other. The latter two works showed that reducing Alice's communication to sublinear requires at least a constant amount of communication from Bob. Here, we show that the above result is just one point on a more general tradeoff curve. That is, we extend the earlier result to show that, for all b, either Bob reveals Ω(b) information to Alice, or else Alice reveals n/2O(b) information to Bob. This tradeoff lower bound is easily seen to be everywhere-tight, by virtue of an easy two-round deterministic protocol. Our lower bound applies to constant-error randomized protocols, with information measured under an "easy" distribution on inputs.