The work of Mark Braverman
From MaRDI portal
Publication:6200321
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
- scientific article; zbMATH DE number 3124239 (Why is no real title available?)
- scientific article; zbMATH DE number 1256711 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- A Parallel Repetition Theorem
- A candidate for a strong separation of information and communication
- A simple proof of Bazzi's theorem
- An information complexity approach to extended formulations
- An information statistics approach to data stream and communication complexity
- An interactive information odometer and applications
- Analytical approach to parallel repetition
- Approximate inclusion-exclusion
- Coding for interactive communication
- Compressing interactive communication under product distributions
- Constant depth circuits, Fourier transform, and learnability
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Deterministic coding for interactive communication
- Explicit two-source extractors and resilient functions
- Exponential separation of communication and external information
- Exponential separation of information and communication for Boolean functions
- From information to exact communication
- How to compress interactive communication
- Information Equals Amortized Communication
- Information complexity is computable
- Interactive Information Complexity
- Interactive compression for product distributions
- Interactive compression to external information
- Interactive information and coding theory
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- New separations results for external information
- On the distributional complexity of disjointness
- Polylogarithmic independence can fool DNF formulas
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Simplified separation of information and communication
- Small value parallel repetition for general games
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
- The Infinite-Message Limit of Two-Terminal Interactive Source Coding
- The Probabilistic Communication Complexity of Set Intersection
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Toward coding for maximum errors in interactive communication
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)
