Mark Braverman
Mark Braverman
Unknown affiliation
Verified email at princeton.edu
Title
Cited by
Cited by
Year
Secured Electronic Transaction System
PFHU Hertel, AWKK Hertel, JDT Graham, M Braverman
US Patent App. 12/467,991, 2009
4922009
Dispensing digital objects to an electronic wallet
PFHU Hertel, AWKK Hertel, JDT Graham, M Braverman
US Patent 9,361,606, 2016
2732016
How to compress interactive communication
B Barak, M Braverman, X Chen, A Rao
SIAM Journal on Computing 42 (3), 1327-1363, 2013
2112013
Information equals amortized communication
M Braverman, A Rao
IEEE Transactions on Information Theory 60 (10), 6058-6069, 2014
1892014
Noisy sorting without resampling
M Braverman, E Mossel
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
1782008
Interactive information complexity
M Braverman
SIAM Journal on Computing 44 (6), 1698-1739, 2015
1522015
Termination of integer linear programs
M Braverman
International Conference on Computer Aided Verification, 372-385, 2006
1332006
Polylogarithmic independence fools AC0 circuits
M Braverman
Journal of the ACM (JACM) 57 (5), 1-10, 2008
1172008
Computing over the reals: Foundations for scientific computing
M Braverman, S Cook
Notices of the AMS 53 (3), 318-329, 2006
1132006
Toward coding for maximum errors in interactive communication
M Braverman, A Rao
IEEE Transactions on Information Theory 60 (11), 7248-7255, 2014
1102014
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
872014
Stability in large matching markets with complementarities
I Ashlagi, M Braverman, A Hassidim
Operations Research 62 (4), 713-732, 2014
862014
An information complexity approach to extended formulations
M Braverman, A Moitra
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
852013
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
792013
Non-computable Julia sets
M Braverman, M Yampolsky
Journal of the American Mathematical Society 19 (3), 551-578, 2006
792006
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
782016
The Grothendieck constant is strictly smaller than Krivine’s bound
M Braverman, K Makarychev, Y Makarychev, A Naor
Forum of Mathematics, Pi 1, 2013
772013
Monotonicity and implementability
I Ashlagi, M Braverman, A Hassidim, D Monderer
Econometrica 78 (5), 1749-1772, 2010
712010
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
652010
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
642013
The system can't perform the operation now. Try again later.
Articles 1–20