Browsing by Author Braverman, Mark
Showing results 24 to 43 of 77
< previous
next >
| Publication Date | Article Title | Author(s) |
| 2-Oct-2013 | A hard-to-compress interactive task? | Braverman, Mark |
| Jun-2018 | Hitting sets with near-optimal error for read-once branching programs | Braverman, Mark; Cohen, Gil; Garg, Sumegha |
| 2013 | How to Compress Interactive Communication | Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup |
| Jun-2013 | An information complexity approach to extended formulations | Braverman, Mark; Moitra, Ankur |
| 2016 | Information complexity is computable | Braverman, Mark; Schneider, J |
| Oct-2014 | Information Equals Amortized Communication | Braverman, Mark; Rao, Anup |
| 2013 | Information Lower Bounds via Self-reducibility | Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri |
| 2016 | Information Lower Bounds via Self-Reducibility | Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri |
| 2018 | Information Value of Two-Prover Games | Braverman, Mark; Ko, Young K |
| 2014 | Interactive information and coding theory | Braverman, Mark |
| 2017 | Interactive Information Complexity | Braverman, Mark |
| 2015 | Interactive Information Complexity | Braverman, Mark |
| 2012 | Interactive information complexity | Braverman, Mark |
| 2015 | An Interactive Information Odometer and Applications | Braverman, Mark; Weinstein, Omri |
| 2016 | Interpolating between truthful and non-truthful mechanisms for combinatorial auctions | Braverman, Mark; Mao, J; Weinberg, SM |
| 28-Feb-2017 | List and unique coding for interactive communication in the presence of adversarial noise | Braverman, Mark; Efremenko, K |
| 2017 | LIST and unique coding for interactive communication in the presence of adversarial noise | Braverman, Mark; Efremenko, K |
| 2019 | Multi-armed Bandit Problems with Strategic Arms | Braverman, Mark; Mao, Jieming; Schneider, Jon; Weinberg, S Matthew |
| 2017 | Nash Equilibria in Perturbation-Stable Games | Balcan, Maria-Florina; Braverman, Mark |
| 17-Dec-2015 | Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness | Braverman, Mark; Garg, A; Ko, YK; Mao, J; Touchette, D |
