Browsing by Author Braverman, Mark
Showing results 15 to 34 of 79
< previous
next >
| Publication Date | Article Title | Author(s) |
|---|---|---|
| 8-Oct-2014 | Data-driven decisions for reducing readmissions for heart failure: General methodology and case study | Bayati, M; Braverman, Mark; Gillam, M; Mack, KM; Ruiz, G; et al |
| Mar-2022 | Data-Driven Incentive Alignment in Capitation Schemes | Braverman, Mark; Chassang, Sylvain |
| 2013 | Direct Product via Round-Preserving Compression | Braverman, Mark; Rao, Anup; Weinstein, Omri; Yehudayoff, Amir |
| 26-Oct-2013 | Direct products in communication complexity | Braverman, Mark; Weinstein, O; Rao, A; Yehudayoff, A |
| 1-Nov-2016 | A Discrepancy Lower Bound for Information Complexity | Braverman, Mark; Weinstein, O |
| 2012 | A Discrepancy Lower Bound for Information Complexity | Braverman, Mark; Weinstein, Omri |
| 16-Jan-2017 | ETH hardness for densest-k-Subgraph with perfect completeness | Braverman, Mark; Ko, YK; Rubinstein, A; Weinstein, O |
| 6-Jan-2013 | Finding endogenously formed communities | Balcan, M-F; Borgs, C; Braverman, Mark; Chayes, J; Teng, S-H |
| 2013 | From information to exact communication | Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri |
| 2013 | The Grothendieck Constant is Strictly Smaller than Krivine's Bound | Braverman, Mark; Makarychev, Konstantin; Makarychev, Yury; Naor, Assaf |
| 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 |