The work of Mark Braverman
DOI10.4171/icm2022/214OpenAlexW4389819021MaRDI QIDQ6200321
Publication date: 22 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/icm2022/214
Biographies, obituaries, personalia, bibliographies (01A70) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information theory (general) (94A15) General topics in the theory of computing (68Q01) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An information statistics approach to data stream and communication complexity
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Approximate inclusion-exclusion
- On the distributional complexity of disjointness
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- How to Compress Interactive Communication
- Small Value Parallel Repetition for General Games
- An Interactive Information Odometer and Applications
- A Simple Proof of Bazzi’s Theorem
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Toward Coding for Maximum Errors in Interactive Communication
- Information Equals Amortized Communication
- Coding for interactive communication
- Constant depth circuits, Fourier transform, and learnability
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
- Interactive Information Complexity
- Polylogarithmic independence fools AC 0 circuits
- Polylogarithmic Independence Can Fool DNF Formulas
- The Probabilistic Communication Complexity of Set Intersection
- A Parallel Repetition Theorem
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
- Information complexity is computable
- Compressing Interactive Communication Under Product Distributions
- Exponential Separation of Communication and External Information
- Interactive compression to external information
- Deterministic coding for interactive communication
- Analytical approach to parallel repetition
- The Infinite-Message Limit of Two-Terminal Interactive Source Coding
- Explicit two-source extractors and resilient functions
- Interactive compression for product distributions
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
- From information to exact communication
- An information complexity approach to extended formulations
- A Method for the Construction of Minimum-Redundancy Codes
- Exponential Separation of Information and Communication for Boolean Functions
- New separations results for external information
This page was built for publication: The work of Mark Braverman
