| How to compress interactive communication B Barak, M Braverman, X Chen, A Rao Proceedings of the forty-second ACM symposium on Theory of computing, 67-76, 2010 | 274 | 2010 |
| Noisy sorting without resampling M Braverman, E Mossel arXiv preprint arXiv:0707.1051, 2007 | 245 | 2007 |
| Information equals amortized communication M Braverman, A Rao IEEE Transactions on Information Theory 60 (10), 6058-6069, 2014 | 238 | 2014 |
| Communication lower bounds for statistical estimation problems via a distributed data processing inequality M Braverman, A Garg, T Ma, HL Nguyen, DP Woodruff Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 199 | 2016 |
| Termination of integer linear programs M Braverman Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006 | 184 | 2006 |
| Interactive information complexity M Braverman Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 181 | 2012 |
| Data-driven decisions for reducing readmissions for heart failure: General methodology and case study M Bayati, M Braverman, M Gillam, KM Mack, G Ruiz, MS Smith, E Horvitz PloS one 9 (10), e109264, 2014 | 166 | 2014 |
| Polylogarithmic independence fools AC0 circuits M Braverman Journal of the ACM (JACM) 57 (5), 1-10, 2008 | 159 | 2008 |
| Towards coding for maximum errors in interactive communication M Braverman, A Rao Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 148 | 2011 |
| Computing over the reals: Foundations for scientific computing M Braverman, S Cook Notices of the AMS 53 (3), 318-329, 2006 | 139 | 2006 |
| Stability in large matching markets with complementarities I Ashlagi, M Braverman, A Hassidim Operations Research 62 (4), 713-732, 2014 | 124 | 2014 |
| On the convergence of the Hegselmann-Krause system A Bhattacharyya, M Braverman, B Chazelle, HL Nguyen Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 116 | 2013 |
| The Grothendieck constant is strictly smaller than Krivine’s bound M Braverman, K Makarychev, Y Makarychev, A Naor Forum of Mathematics, Pi 1, e4, 2013 | 112 | 2013 |
| Beaucoup: Answering many network traffic queries, one memory update at a time X Chen, S Landau-Feibish, M Braverman, J Rexford Proceedings of the Annual conference of the ACM Special Interest Group on …, 2020 | 107 | 2020 |
| An information complexity approach to extended formulations M Braverman, A Moitra Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 104 | 2013 |
| From information to exact communication M Braverman, A Garg, D Pankratov, O Weinstein Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 102 | 2013 |
| Sorting from noisy information M Braverman, E Mossel arXiv preprint arXiv:0910.1191, 2009 | 98 | 2009 |
| Non-computable Julia sets M Braverman, M Yampolsky Journal of the American Mathematical Society, 551-578, 2006 | 98 | 2006 |
| Direct products in communication complexity M Braverman, A Rao, O Weinstein, A Yehudayoff 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 746-755, 2013 | 96 | 2013 |
| Pseudorandom generators for regular branching programs M Braverman, A Rao, R Raz, A Yehudayoff SIAM Journal on Computing 43 (3), 973-986, 2014 | 95 | 2014 |
