Mark Braverman (mathematician)

from Wikipedia, the free encyclopedia

Mark Braverman (* 1984 in Perm ) is an Israeli computer scientist and mathematician.

Braverman studied mathematics and computer science at Technion and received his PhD in 2008 from the University of Toronto with Stephen Arthur Cook (Computability and Complexity of Julia sets). As a post-doctoral student , he was with Microsoft Research in their New England Lab. He was an Assistant Professor at the University of Toronto and was at Princeton University from 2011 , where he is a professor.

He deals with complexity theory , machine learning, algorithms in the presence of random structures (noise), computability theory in the real and complex, (algorithmic) game theory and applications of computer science in medicine, health care and economics. In particular, he dealt with interactive information and coding theory (complexity of communication).

In 2016 he received the EMS Prize . In 2014 he was invited speaker at the International Congress of Mathematicians in Seoul (Interactive information and coding theory).

In 2016 he received the Presburger Award , was a Packard Fellow in 2013 and received the SFCM Stephen Smale Prize in 2014 and the Alan T. Waterman Award in 2019 .

Web links

Individual evidence

  1. Mark Braverman in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ^ Braverman, ICM talk, 2014, pdf
  3. Laudation for the Stephen Smale Prize