Mark Braverman

Mark Braverman is a Professor at Princeton University, known for his contributions to theoretical computer science, computational complexity, and information theory. He holds a PhD from the University of Toronto (2008), where his dissertation focused on computability and complexity of Julia sets. His research spans a wide range of topics including interactive communication protocols, pseudorandomness, distributed computing, algorithmic game theory, and quantum computing.

Key areas of focus include developing error-correcting codes for interactive communication, establishing lower bounds in computational complexity, and exploring the interplay between information theory and algorithm design. Braverman has co-authored over 240 publications and has collaborated extensively with researchers such as Klim Efremenko, Anup Rao, and Omri Weinstein. His work has been recognized through prestigious venues like STOC, FOCS, and SODA, and has addressed foundational questions in theoretical computer science, including the limits of parallel repetition in games and the design of resilient computational systems.

Recent research highlights include advancements in quantum communication complexity, fault-tolerant circuit design, and algorithmic approaches to matching markets. His interdisciplinary work bridges mathematical theory with practical applications in distributed systems and economics. Braverman also contributes to the academic community through editorial roles and conference organization, furthering the development of computational theory and its applications.