• 1733 Citations
  • 25 h-Index
20042024
If you made any changes in Pure, your changes will be visible here soon.

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.

  • 3 Similar Profiles
Communication Engineering & Materials Science
Polynomials Engineering & Materials Science
Communication Complexity Mathematics
Julia set Mathematics
Branching Programs Mathematics
Network protocols Engineering & Materials Science
Lower bound Mathematics
Hardness Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects 2012 2024

Research Output 2004 2019

Information complexity and applications: Takagi Lectures Notes

Braverman, M., Mar 1 2019, In : Japanese Journal of Mathematics. 14, 1, p. 27-65 39 p.

Princeton University

Research output: Contribution to journalArticle

Complexity Theory
Communication Complexity
Information Theory
Direct Sum
Theorem

Optimal short-circuit resilient formulas

Braverman, M., Efremenko, K., Gelles, R. & Yitayew, M. A., Jul 1 2019, 34th Computational Complexity Conference, CCC 2019. Shpilka, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 137).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Short circuit currents
Polynomials
Feedback
Communication

The price of uncertain priors in source coding

Braverman, M. & Juba, B., Feb 1 2019, In : IEEE Transactions on Information Theory. 65, 2, p. 1165-1171 7 p., 8581454.

Princeton University

Research output: Contribution to journalArticle

coding
recipient
Communication
Sudan
uncertainty
1 Citation (Scopus)

A candidate for a strong separation of information and communication

Braverman, M., Ganor, A., Kol, G. & Raz, R., Jan 1 2018, 9th Innovations in Theoretical Computer Science, ITCS 2018. Karlin, A. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 94).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Communication
Network protocols
1 Citation (Scopus)

Hitting sets with near-Optimal error for read-Once branching programs

Braverman, M., Cohen, G. & Garg, S., Jun 20 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). Association for Computing Machinery, p. 940-951 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Seed
Probability distributions

Press/Media

New frontier in error-correcting codes

Mark Braverman

10/2/14

2 items of Media coverage

Princeton University

Press/Media: Press / Media

New Frontier in Error-Correcting Codes

Mark Braverman

10/2/14

1 item of Media coverage

Princeton University

Press/Media: Press / Media

Reaching the Limit of Error-Correcting Codes

Mark Braverman

10/2/14

1 item of Media coverage

Princeton University

Press/Media: Press / Media