Recommendations
Cites work
- scientific article; zbMATH DE number 3573787 (Why is no real title available?)
- scientific article; zbMATH DE number 1947403 (Why is no real title available?)
- scientific article; zbMATH DE number 6292744 (Why is no real title available?)
- A direct product theorem for two-party bounded-round public-coin communication complexity
- Advances in Cryptology - EUROCRYPT 2004
- Amortized Communication Complexity
- An information complexity approach to extended formulations
- An information statistics approach to data stream and communication complexity
- Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching
- Certifying equality with limited interaction
- Communication Complexity
- Direct product via round-preserving compression
- Elements of Information Theory
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- From information to exact communication
- How to compress interactive communication
- Information Equals Amortized Communication
- Information cost tradeoffs for augmented index and streaming language recognition
- Interactive information complexity
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- Nearly Private Information Retrieval
- Oblivious Polynomial Evaluation
- On data structures and asymmetric communication complexity
- On the distributional complexity of disjointness
- On the exact space complexity of sketching and streaming small norms
- Private vs. common random bits in communication complexity
- Quantum and approximate privacy
- Recognizing well-parenthesized expressions in the streaming model
- Sparse and Lopsided Set Disjointness via Information Theory
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- The Communication Complexity of Correlation
- The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection
- The Probabilistic Communication Complexity of Set Intersection
- The hardness of being private
- The randomized communication complexity of set disjointness
- The space complexity of approximating the frequency moments
- Unifying the landscape of cell-probe lower bounds
Cited in
(6)- Communication complexity with small advantage
- The communication complexity of functions with large outputs
- `Non-interference' implies equality
- Certifying equality with limited interaction
- The communication complexity of set intersection and multiple equality testing
- The communication complexity of set intersection and multiple equality testing
This page was built for publication: Certifying equality with limited interaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343864)
