Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Space lower bounds for distance approximation in the data stream model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Counting Distinct Elements in a Data Stream
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
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
Finding frequent items in data streams
Theoretical Computer Science - Special issue on automata, languages and programming
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Optimal approximations of the frequency moments of data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Simpler algorithm for estimating frequency moments of data streams
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Journal of the ACM (JACM)
Geometry of Cuts and Metrics
Lower bounds for edit distance and product metrics via Poincaré-type inequalities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fast moment estimation in data streams in optimal space
Proceedings of the forty-third annual ACM symposium on Theory of computing
The Value of Multiple Read/Write Streams for Approximating Frequency Moments
ACM Transactions on Computation Theory (TOCT)
Edit distance to monotonicity in sliding windows
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The ${\textsc{And}}$ problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (No instance) or all t bits are set to 1 (${\textsc{Yes}}$ instance). In this note, I will give a new proof of an ***(1/t ) lower bound on the information complexity of ${\textsc{And}}$ in the number-in-hand model of communication. This was recently established by Gronemeier, STACS 2009. The proof exploits the information geometry of communication protocols via Hellinger distance in a novel manner and avoids the analytic approach inherent in previous work. As previously known, this bound implies an ***(n /t ) lower bound on the communication complexity of multiparty disjointness and consequently a ***(n 1 *** 2/k ) space lower bound on estimating the k -th frequency moment F k .