The work of Mark Braverman
DOI10.4171/ICM2022/214OpenAlexW4389819021MaRDI QIDQ6200321FDOQ6200321
Authors: Ran Raz 
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
Information theory (general) (94A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biographies, obituaries, personalia, bibliographies (01A70) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) General topics in the theory of computing (68Q01) Communication complexity, information complexity (68Q11)
Cites Work
- Title not available (Why is that?)
- The Probabilistic Communication Complexity of Set Intersection
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Constant depth circuits, Fourier transform, and learnability
- A Method for the Construction of Minimum-Redundancy Codes
- An information statistics approach to data stream and communication complexity
- An information complexity approach to extended formulations
- A Parallel Repetition Theorem
- Analytical approach to parallel repetition
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- On the distributional complexity of disjointness
- How to compress interactive communication
- An interactive information odometer and applications
- Information Equals Amortized Communication
- Interactive Information Complexity
- From information to exact communication
- Approximate inclusion-exclusion
- A simple proof of Bazzi's theorem
- Polylogarithmic independence can fool DNF formulas
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
- Coding for interactive communication
- The Infinite-Message Limit of Two-Terminal Interactive Source Coding
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Deterministic coding for interactive communication
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Title not available (Why is that?)
- Exponential separation of information and communication for Boolean functions
- Small value parallel repetition for general games
- Interactive information and coding theory
- Information complexity is computable
- Interactive compression for product distributions
- Toward coding for maximum errors in interactive communication
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
- Explicit two-source extractors and resilient functions
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- New separations results for external information
- Simplified separation of information and communication
- Compressing interactive communication under product distributions
- A candidate for a strong separation of information and communication
- Exponential separation of communication and external information
- Interactive compression to external information
This page was built for publication: The work of Mark Braverman
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200321)
