Showing results 7 to 26 of 79
< previous
next >
| Publication Date | Article Title | Author(s) |
| 2016 | Coding for interactive communication correcting insertions and deletions | Braverman, Mark; Gelles, R; Mao, J; Ostrovsky, R |
| 1-Oct-2012 | Coding for interactive computation: Progress and challenges | Braverman, Mark |
| 2017 | Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All | Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel |
| 2020 | The Coin Problem with Applications to Data Streams | Braverman, Mark; Garg, Sumegha; Woodruff, David P |
| 16-Jun-2016 | Communication lower bounds for statistical estimation problems via a distributed data processing inequality? | Braverman, Mark; Garg, A; Ma, T; Nguyen, Huy L.; Woodruff, DP |
| 12-Jan-2014 | The computational hardness of pricing compound options | Braverman, Mark; Pasricha, K |
| 19-Jun-2016 | Constant-rate coding for multiparty interactive communication is impossible | Braverman, Mark; Efremenko, K; Gelles, Ran; Haeupler, B |
| Dec-2017 | Constant-Rate Coding for Multiparty Interactive Communication Is Impossible | Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard |
| 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 |
