Mark Braverman

Mark Braverman is a Professor in the Department of Computer Science at Princeton University. His research spans computational complexity, information theory, and algorithmic mechanism design, with a focus on theoretical foundations and their interdisciplinary applications.

• Fields of Interest: Complexity theory, Information theory, Theory of real computation, Machine learning, Algorithms, Algorithmic mechanism design

Braverman's recent work, including the paper Communication and information complexity (2022), explores the intersection of computational complexity and information theory, advancing understanding of communication efficiency in distributed systems. His research also emphasizes optimization-friendly mechanisms in game theory and algorithm design.

• Teaching: Spring 2022: COS445 (Economics and computation), Fall 2021: COS521 (Advanced algorithm design)
• Service: Program committee chair for ITCS'22 (Innovations in Theoretical Computer Science, 2022)