scientific article; zbMATH DE number 7359348

DOI10.4230/LIPIcs.ITCS.2018.11zbMath1462.68054MaRDI QIDQ4993274

Mark Braverman, Anat Ganor, Ran Raz, Gillat Kol

Publication date: 15 June 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

information complexitycommunication complexitydirect sumamortized communication complexitycommunication compression

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11)

Related Items (2)

The work of Mark Braverman ⋮ Exponential Separation of Communication and External Information

Cites Work

• A discrepancy lower bound for information complexity
• An information statistics approach to data stream and communication complexity
• How to compress interactive communication
• Lower Bounds in Communication Complexity
• Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
• Two-way source coding with a fidelity criterion
• Coding for computing
• Communication Complexity
• Exponential separation of communication and external information
• Interactive compression for product distributions
• Interactive information complexity
• Information Equals Amortized Communication

This page was built for publication: