Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complexity of Boolean functions
The complexity of Boolean functions
Elements of information theory
Elements of information theory
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Communication complexity
SIAM Journal on Computing
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
On randomized one-round communication complexity
Computational Complexity
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
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fast, small-space algorithms for approximate histogram maintenance
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Approximate L1-Difference Algorithm for Massive Data Streams
SIAM Journal on Computing
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual 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
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Spatial scan statistics: approximations and performance study
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
The communication complexity of the Hamming distance problem
Information Processing Letters
Estimating the sortedness of a data stream
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Earth mover distance over high-dimensional spaces
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sketching information divergences
Machine Learning
New results for finding common neighborhoods in massive graphs in the data stream model
Theoretical Computer Science
On Finding Frequent Elements in a Data Stream
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast evaluation of union-intersection expressions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Information complexity: a tutorial
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The communication complexity of correlation
IEEE Transactions on Information Theory
ACM SIGACT News
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
Effective Computations on Sliding Windows
SIAM Journal on Computing
The Computational Hardness of Estimating Edit Distance
SIAM Journal on Computing
Partition arguments in multiparty communication complexity
Theoretical Computer Science
Kolmogorov complexity and combinatorial methods in communication complexity
Theoretical Computer Science
Finding heavy distinct hitters in data streams
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Near-optimal private approximation protocols via a black box transformation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast moment estimation in data streams in optimal space
Proceedings of the forty-third annual ACM symposium on Theory of computing
Everywhere-tight information cost tradeoffs for augmented index
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
The Value of Multiple Read/Write Streams for Approximating Frequency Moments
ACM Transactions on Computation Theory (TOCT)
SIAM Journal on Computing
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Lower bounds for number-in-hand multiparty communication complexity, made easy
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
NOF-multiparty information complexity bounds for pointer jumping
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Densest subgraph in streaming and MapReduce
Proceedings of the VLDB Endowment
Evaluation of analogical proportions through Kolmogorov complexity
Knowledge-Based Systems
Rectangle-efficient aggregation in spatial data streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A new exponential separation between quantum and classical one-way communication complexity
Quantum Information & Computation
Lower bounds in differential privacy
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Validating XML documents in the streaming model with external memory
Proceedings of the 15th International Conference on Database Theory
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Validating XML documents in the streaming model with external memory
ACM Transactions on Database Systems (TODS) - Invited papers issue
Tight lower bound for linear sketches of moments
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.06 |
We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of the conditional information complexity, of a function which is the minimum amount of information about the inputs that has to be revealed by a communication protocol for the function. While conditional information complexity is a lower bound on communication complexity, we show that it also admits a direct sum theorem. Direct sum decomposition reduces our task to that of proving conditional information complexity lower bounds for simple problems (such as the AND of two bits). For the latter, we develop novel techniques based on Hellinger distance and its generalizations.Our paradigm leads to two main results: (1) An improved lower bound for the multi-party set-disjointness problem in the general communication complexity model, and a nearly optimal lower bound in the one-way communication model. As a consequence, we show that for any real k 2, approximating the kth frequency moment in the data stream model requires essentially Ω(n1-2/k) space; this resolves a conjecture of Alon et al. (J. Comput. System Sci. 58(1) (1999) 137).(2) A lower bound for the Lp approximation problem in the general communication model: this solves an open problem of Saks and Sun (in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 360-369). As a consequence, we show that for p 2, approximating the Lp norm to within a factor of nε in the data stream model with constant number of passes requires Ω(n1-4ε-2/p) space.