| 2026 | COLT | Learning from Equivalence Queries, Revisited. | Mark Braverman, Roi Livni, Yishay Mansour, Shay Moran, Kobbi Nissim |
| 2026 | STOC | An Analytical Approach to Parallel Repetition via CSP Inverse Theorems. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang Liu, Dor Minzer, Kunal Mittal |
| 2025 | FOCS | Undirected Multicast Network Coding Gaps via Locally Decodable Codes. | Mark Braverman, Zhongtian He |
| 2025 | SODA | New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. | Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc |
| 2025 | STOC | Parallel Repetition for 3-Player XOR Games. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | STOC | Optimality of Frequency Moment Estimation. | Mark Braverman, Or Zamir |
| 2025 | TCC | Practical Secure Delegated Linear Algebra with Trapdoored Matrices. | Mark Braverman, Stephen Newman |
| 2024 | FOCS | Tight Analyses of Ordered and Unordered Linear Probing. | Mark Braverman, William Kuszmaul |
| 2024 | PODC | Multi-Party Set Disjointness and Intersection with Bounded Dependence. | Mark Braverman, Rotem Oshman, Tal Roth |
| 2024 | STOC | A New Information Complexity Measure for Multi-pass Streaming with Applications. | Mark Braverman, Sumegha Garg, Qian Li, Shuo Wang, David P. Woodruff, Jiapeng Zhang |
| 2023 | FOCS | Parallel Repetition for the GHZ Game: Exponential Decay. | Mark Braverman, Subhash Khot, Dor Minzer |
| 2023 | ICLR | Understanding Influence Functions and Datamodels via Harmonic Analysis. | Nikunj Saunshi, Arushi Gupta, Mark Braverman, Sanjeev Arora |
| 2021 | COLT | Near Optimal Distributed Learning of Halfspaces with Two Parties. | Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena |
| 2021 | FOCS | Statistically Near-Optimal Hypothesis Selection. | Olivier Bousquet, Mark Braverman, Gillat Kol, Klim Efremenko, Shay Moran |
| 2021 | FOCS | Tight Space Complexity of the Coin Problem. | Mark Braverman, Sumegha Garg, Or Zamir |
| 2021 | FOCS | An Invariance Principle for the Multi-slice, with Applications. | Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer |
| 2021 | STOC | New separations results for external information. | Mark Braverman, Dor Minzer |
| 2020 | COLT | The Gradient Complexity of Linear Regression. | Mark Braverman, Elad Hazan, Max Simchowitz, Blake E. Woodworth |
| 2020 | FOCS | The Coin Problem with Applications to Data Streams. | Mark Braverman, Sumegha Garg, David P. Woodruff |
| 2020 | ICML | Calibration, Entropy Rates, and Memory in Language Models. | Mark Braverman, Xinyi Chen, Sham M. Kakade, Karthik Narasimhan, Cyril Zhang, Yi Zhang |
| 2020 | SIGCOMM | BeauCoup: Answering Many Network Traffic Queries, One Memory Update at a Time. | Xiaoqi Chen, Shir Landau Feibish, Mark Braverman, Jennifer Rexford |
| 2019 | COLT | Sorted Top-k in Rounds. | Mark Braverman, Jieming Mao, Yuval Peres |
| 2019 | COLT | Multi-armed Bandit Problems with Strategic Arms. | Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg |
| 2018 | SODA | On Simultaneous Two-player Combinatorial Auctions. | Mark Braverman, Jieming Mao, S. Matthew Weinberg |
| 2018 | STOC | Hitting sets with near-optimal error for read-once branching programs. | Mark Braverman, Gil Cohen, Sumegha Garg |
| 2018 | STOC | Interactive compression to external information. | Mark Braverman, Gillat Kol |
| 2017 | FOCS | A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness. | Mark Braverman, Rotem Oshman |
| 2017 | SODA | ETH Hardness for Densest- | Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein |
| 2016 | ICALP | Coding for Interactive Communication Correcting Insertions and Deletions. | Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky |
| 2016 | ICALP | Information Complexity Is Computable. | Mark Braverman, Jon Schneider |
| 2016 | PODC | Reliable Communication over Highly Connected Noisy Networks. | Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler |
| 2016 | SODA | Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions. | Mark Braverman, Jieming Mao, S. Matthew Weinberg |
| 2016 | STOC | Constant-rate coding for multiparty interactive communication is impossible. | Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler |
| 2016 | STOC | Communication lower bounds for statistical estimation problems via a distributed data processing inequality. | Mark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, David P. Woodruff |
| 2016 | STOC | Parallel algorithms for select and partition with noisy comparisons. | Mark Braverman, Jieming Mao, S. Matthew Weinberg |
| 2015 | FOCS | Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. | Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette |
| 2015 | PODC | On Information Complexity in the Broadcast Model. | Mark Braverman, Rotem Oshman |
| 2015 | SODA | Approximating the best Nash Equilibrium in | Mark Braverman, Young Kun-Ko, Omri Weinstein |
| 2015 | STOC | Small Value Parallel Repetition for General Games. | Mark Braverman, Ankit Garg |
| 2015 | STOC | An Interactive Information Odometer and Applications. | Mark Braverman, Omri Weinstein |
| 2014 | FOCS | List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. | Mark Braverman, Klim Efremenko |
| 2014 | ICALP | Public vs Private Coin in Bounded-Round Information. | Mark Braverman, Ankit Garg |
| 2013 | CiE | Noise versus Computational Intractability in Dynamics. | Mark Braverman |
| 2013 | CSR | Information Lower Bounds via Self-reducibility. | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
| 2013 | FOCS | A Tight Bound for Set Disjointness in the Message-Passing Model. | Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan |
| 2013 | FOCS | Direct Products in Communication Complexity. | Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff |
| 2013 | ICALP | Direct Product via Round-Preserving Compression. | Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff |
| 2013 | WWW | Strategyproof mechanisms for competitive influence in networks. | Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren |
| 2013 | SODA | Finding Endogenously Formed Communities. | Maria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng |
| 2013 | STOC | From information to exact communication. | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
| 2013 | STOC | An information complexity approach to extended formulations. | Mark Braverman, Ankur Moitra |
| 2013 | STACS | Search using queries on indistinguishable items. | Mark Braverman, Gal Oshri |
| 2012 | STOC | Interactive information complexity. | Mark Braverman |
| 2011 | FOCS | The Grothendieck Constant is Strictly Smaller than Krivine's Bound. | Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor |
| 2011 | FOCS | Information Equals Amortized Communication. | Mark Braverman, Anup Rao |
| 2011 | STOC | Towards coding for maximum errors in interactive communication. | Mark Braverman, Anup Rao |
| 2010 | FOCS | Pseudorandom Generators for Regular Branching Programs. | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
| 2010 | STOC | How to compress interactive communication. | Boaz Barak, Mark Braverman, Xi Chen, Anup Rao |
| 2009 | CCA | Computability and Complexity of Julia Sets (Invited Talk). | Mark Braverman |
| 2009 | COLT | Finding Low Error Clusterings. | Maria-Florina Balcan, Mark Braverman |
| 2009 | MFCS | Branching Programs for Tree Evaluation. | Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr |
| 2009 | SODA | The complexity of simulating Brownian Motion. | Ilia Binder, Mark Braverman |
| 2008 | PODC | On ad hoc routing with guaranteed delivery. | Mark Braverman |
| 2008 | SODA | Noisy sorting without resampling. | Mark Braverman, Elchanan Mossel |
| 2007 | STOC | Constructing non-computable Julia sets. | Mark Braverman, Michael Yampolsky |
| 2006 | CAV | Termination of Integer Linear Programs. | Mark Braverman |
| 2005 | FOCS | On the Complexity of Real Functions. | Mark Braverman |
| 2004 | FOCS | Learnability and Automatizability. | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |