Projects per year
Fingerprint
Dive into the research topics where Mark Braverman is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
-
AF: Small: Noise Across Computational Settings
NSF - National Science Foundation
9/1/15 → 8/31/18
Project: Research project
-
ICES: Small: Collaborative Research: Data-driven mechanisms in healthcare
NSF - National Science Foundation
9/1/12 → 8/31/15
Project: Research project
-
CAREER: Coding and Information Theory for Interactive Computing
NSF - National Science Foundation
1/15/12 → 12/31/16
Project: Research project
Research output
-
New separations results for external information
Braverman, M. & Minzer, D., Jun 15 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 248-258 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
On rich 2-to-1 games
Braverman, M., Khot, S. & Minzer, D., Feb 1 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
1 Scopus citations -
Optimal tiling of the euclidean space using permutation-symmetric bodies
Braverman, M. & Minzer, D., Jul 1 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 200).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Tiered random matching markets: Rank is proportional to popularity
Ashlagi, I., Braverman, M., Saberi, A., Thomas, C. & Zhao, G., Feb 1 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 46. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
1 Scopus citations -
BeauCoup: Answering Many Network Traffic Queries, One Memory Update at a Time
Chen, X., Landau-Feibish, S., Braverman, M. & Rexford, J., Jul 30 2020, SIGCOMM 2020 - Proceedings of the 2020 Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication. Association for Computing Machinery, p. 226-239 14 p. (SIGCOMM 2020 - Proceedings of the 2020 Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
8 Scopus citations