| No. |
Title |
Author |
Year |
| 1 |
Improved Monotonicity Testers via Hypercube Embeddings |
Braverman, Mark et al. |
2023 |
| 2 |
Rounding via Low Dimensional Embeddings |
Braverman, Mark et al. |
2023 |
| 3 |
Front Matter, Table of Contents, Preface, Conference Organization |
Braverman, Mark |
2022 |
| 4 |
LIPIcs, Volume 215, ITCS 2022, Complete Volume |
Braverman, Mark |
2022 |
| 5 |
On Rich 2-to-1 Games |
Braverman, Mark et al. |
2021 |
| 6 |
Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies |
Braverman, Mark et al. |
2021 |
| 7 |
Tiered Random Matching Markets: Rank Is Proportional to Popularity |
Ashlagi, Itai et al. |
2021 |
| 8 |
The Role of Randomness and Noise in Strategic Classification |
Braverman, Mark et al. |
2020 |
| 9 |
On the Computational Power of Radio Channels |
Braverman, Mark et al. |
2019 |
| 10 |
Optimal Short-Circuit Resilient Formulas |
Braverman, Mark et al. |
2019 |
| 11 |
A Candidate for a Strong Separation of Information and Communication |
Braverman, Mark et al. |
2018 |
| 12 |
Information Value of Two-Prover Games |
Braverman, Mark et al. |
2018 |
| 13 |
Semi-Direct Sum Theorem and Nearest Neighbor under l_infty |
Braverman, Mark et al. |
2018 |
| 14 |
Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All |
Braverman, Mark et al. |
2017 |
| 15 |
Coding for Interactive Communication Correcting Insertions and Deletions |
Braverman, Mark et al. |
2016 |
| 16 |
Information Complexity Is Computable |
Braverman, Mark et al. |
2016 |
| 17 |
Search using queries on indistinguishable items |
Braverman, Mark et al. |
2013 |
| 18 |
Computability and Complexity of Julia Sets (Invited Talk) |
Braverman, Mark |
2009 |
| 19 |
Fractional Pebbling and Thrifty Branching Programs |
Braverman, Mark et al. |
2009 |
