Mark Braverman is an assistant professor of computer science at Princeton University, where he has been on the faculty since 2011. He received his Ph.D. in 2008 from the University of Toronto under the supervision of Stephen Cook. Prior to joining Princeton, Braverman spent two years as a postdoc at Microsoft Research New England and a year as a faculty member at the University of Toronto. He is a recipient of the Alfred P. Sloan Research Fellowship, NSF CAREER Award, Turing Centenary Research Fellowship, and Packard Fellowship in Science and Engineering.
His interests include complexity theory, information theory, algorithms, the theory of computation in dynamical systems, and applications of computer science and game theory in healthcare and medicine. Braverman’s recent work developed and expanded the connections between information theory and computational complexity, by extending the reach of Shannon’s information theory to interactive computation.