Mark Braverman

Mark Braverman is a Professor in the Department of Computer Science at Princeton University. He joined the Princeton faculty in 2011. From 2010-2011, he was an assistant professor at the University of Toronto, jointly appointed in the departments of mathematics and computer science. Between 2008 and 2010, he was a postdoctoral researcher at the Microsoft Research New England lab. He received his Ph.D. in 2008 from the Department of Computer Science at the University of Toronto. He works on theoretical computer science and its connections to other disciplines, especially in information theory, mathematical analysis, and economics. His research is supported by a number of awards, including a 2013 Packard Fellowship and a 2019 NSF Waterman award. In 2022, he won the IMU Abacus Medal.

Mark Braverman is a researcher at Princeton University with a focus on theoretical computer science. His work explores the intersection of communication complexity, information theory, and algorithm design. He investigates how information can be efficiently transmitted and processed in distributed systems, with applications in interactive communication, data compression, and statistical estimation. His research also addresses the computational limits of algorithms, particularly in scenarios involving noise and uncertainty. Braverman's contributions include studies on the complexity of interactive protocols, the role of information in communication, and the design of efficient algorithms for large-scale data processing.