scientific article; zbMATH DE number 6890211
From MaRDI portal
Publication:4568116
DOI10.4086/toc.2018.v014a006zbMath1394.68148OpenAlexW2556555060MaRDI QIDQ4568116
Yuval Dagan, Yaqiao Li, Hamed Hatami, Yuval Filmus
Publication date: 15 June 2018
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2018.v014a006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (3)
Unnamed Item ⋮ Information complexity of the AND function in the two-party and multi-party settings ⋮ Trading information complexity for error. II: The case of a large error and the external information complexity
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Information lower bounds via self-reducibility
- An information statistics approach to data stream and communication complexity
- On the distributional complexity of disjointness
- New Strong Direct Product Results in Communication Complexity
- How to Compress Interactive Communication
- A strong direct product theorem for disjointness
- Communication Complexity Theory: Thirty-Five Years of Set Disjointness
- Information Equals Amortized Communication
- Interactive Information Complexity
- The Probabilistic Communication Complexity of Set Intersection
- Information complexity is computable
- Amortized Communication Complexity
- The Communication Complexity of Correlation
- Some Results on Distributed Source Coding for Interactive Function Computation
- Direct Product via Round-Preserving Compression
- The Infinite-Message Limit of Two-Terminal Interactive Source Coding
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching
- Exponential Separation of Information and Communication for Boolean Functions
- Information complexity of the AND function in the two-party and multi-party settings
This page was built for publication:
