Mark Braverman
Affiliations: | Computer Science | Princeton University, Princeton, NJ |
Area:
Complexity theory, algorithms, game theory, machine learning, and applications of computer science in healthcare and medicine.Google:
"Mark Braverman"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Braverman M, Juba B. (2019) The Price of Uncertain Priors in Source Coding Ieee Transactions On Information Theory. 65: 1165-1171 |
Braverman M. (2019) Information complexity and applications Japanese Journal of Mathematics. 14: 27-65 |
Alon N, Braverman M, Efremenko K, et al. (2019) Reliable communication over highly connected noisy networks Distributed Computing. 32: 505-515 |
Braverman M, Efremenko K, Gelles R, et al. (2017) Constant-Rate Coding for Multiparty Interactive Communication Is Impossible Journal of the Acm. 65: 1-41 |
Braverman M, Gelles R, Mao J, et al. (2017) Coding for Interactive Communication Correcting Insertions and Deletions Ieee Transactions On Information Theory. 63: 6256-6270 |
Braverman M, Woodruff DP. (2016) Guest Editorial for Information Complexity and Applications Algorithmica. 76: 595-596 |
Braverman M, Schneider J, Rojas C. (2015) Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems. Physical Review Letters. 115: 098701 |
Braverman M, Oshman R. (2015) On information complexity in the broadcast model Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 2015: 355-364 |
Braverman M, Weinstein O. (2015) An interactive information odometer and applications Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 341-350 |
Braverman M, Garg A, Ko YK, et al. (2015) Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 773-791 |