Private vs. common random bits in communication complexity
Information Processing Letters
Elements of information theory
Elements of information theory
New applications of the incompressibility method: part II
Theoretical Computer Science - Selected papers in honor of Manuel Blum
An Information Statistics Approach to Data Stream and Communication Complexity
FOCS '02 Proceedings of the 43rd 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
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Communication Complexity
Average and randomized communication complexity
IEEE Transactions on Information Theory
On communication complexity of vector-valued functions
IEEE Transactions on Information Theory
On the Average Case Communication Complexity for Detection in Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.89 |
It is well known that the average case deterministic communication complexity is bounded below by an entropic quantity, which one would now call deterministic information complexity. In this paper we show a corresponding upper bound. We also improve known lower bounds for the public coin Las Vegas communication complexity by a constant factor.