Secured Electronic Transaction System PFHU Hertel, AWKK Hertel, JDT Graham, M Braverman US Patent App. 12/467,991, 2009 | 492 | 2009 |

Dispensing digital objects to an electronic wallet PFHU Hertel, AWKK Hertel, JDT Graham, M Braverman US Patent 9,361,606, 2016 | 273 | 2016 |

How to compress interactive communication B Barak, M Braverman, X Chen, A Rao SIAM Journal on Computing 42 (3), 1327-1363, 2013 | 211 | 2013 |

Information equals amortized communication M Braverman, A Rao IEEE Transactions on Information Theory 60 (10), 6058-6069, 2014 | 189 | 2014 |

Noisy sorting without resampling M Braverman, E Mossel Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 178 | 2008 |

Interactive information complexity M Braverman SIAM Journal on Computing 44 (6), 1698-1739, 2015 | 152 | 2015 |

Termination of integer linear programs M Braverman International Conference on Computer Aided Verification, 372-385, 2006 | 133 | 2006 |

Polylogarithmic independence fools *AC*^{0} circuitsM Braverman Journal of the ACM (JACM) 57 (5), 1-10, 2008 | 117 | 2008 |

Computing over the reals: Foundations for scientific computing M Braverman, S Cook Notices of the AMS 53 (3), 318-329, 2006 | 113 | 2006 |

Toward coding for maximum errors in interactive communication M Braverman, A Rao IEEE Transactions on Information Theory 60 (11), 7248-7255, 2014 | 110 | 2014 |

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 | 87 | 2014 |

Stability in large matching markets with complementarities I Ashlagi, M Braverman, A Hassidim Operations Research 62 (4), 713-732, 2014 | 86 | 2014 |

An information complexity approach to extended formulations M Braverman, A Moitra Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 85 | 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 | 79 | 2013 |

Non-computable Julia sets M Braverman, M Yampolsky Journal of the American Mathematical Society 19 (3), 551-578, 2006 | 79 | 2006 |

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 | 78 | 2016 |

The Grothendieck constant is strictly smaller than Krivine’s bound M Braverman, K Makarychev, Y Makarychev, A Naor Forum of Mathematics, Pi 1, 2013 | 77 | 2013 |

Monotonicity and implementability I Ashlagi, M Braverman, A Hassidim, D Monderer Econometrica 78 (5), 1749-1772, 2010 | 71 | 2010 |

Position auctions with budgets: Existence and uniqueness I Ashlagi, M Braverman, A Hassidim, R Lavi, M Tennenholtz The BE Journal of Theoretical Economics 10 (1), 2010 | 65 | 2010 |

A tight bound for set disjointness in the message-passing model M Braverman, F Ellen, R Oshman, T Pitassi, V Vaikuntanathan 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 668-677, 2013 | 64 | 2013 |