Mark Braverman
Born1984 (1984)
NationalityIsraeli
Alma materUniversity of Toronto
Awards
Scientific career
FieldsComputer science
Institutions
ThesisComputability and Complexity of Julia Sets[1] (2008)
Doctoral advisorStephen Cook
Websitewww.cs.princeton.edu/~mbraverm/pmwiki/index.php

Mark Braverman (born 1984) is an Israeli mathematician and theoretical computer scientist. He was awarded an EMS Prize in 2016 as well as Presburger Award in the same year.[2][3] In 2019, he was awarded the Alan T. Waterman Award.[4] In 2022 he won the IMU Abacus Medal.[5]

He earned his doctorate from the University of Toronto in 2008, under the supervision of Stephen Cook. After this, he did post-doctoral research at Microsoft Research and then joined the faculty at University of Toronto. In 2011, he joined the Princeton University department of computer science.[6] In 2014 he was an Invited Speaker with talk Interactive information and coding theory at the International Congress of Mathematicians in Seoul.[7]

Braverman is the son of mathematician Elena Braverman[8] and, through her, the grandson of his co-author, mathematical statistician Yan Petrovich Lumel'skii.[9]

References

  1. ↑ Mark Braverman at the Mathematics Genealogy Project
  2. ↑ 7ECM Laureates Retrieved 2018-04-18
  3. ↑ The EATCS bestows the Presburger Award 2016 on Mark Braverman Retrieved 2018-04-18
  4. ↑ "US NSF - Office of the Director - Alan T. Waterman Award". www.nsf.gov. Retrieved 2019-08-10.
  5. ↑ "Mark Braverman Wins the IMU Abacus Medal". Quanta Magazine. 2022-07-05. Retrieved 2022-07-06.
  6. ↑ Mark Braverman | Computer Science Department at Princeton University Retrieved 2018-04-18
  7. ↑ Braverman, Mark (2014). "Interactive information and coding theory" (PDF). Proceedings of the I International Congress of Mathematicians. pp. 539–559.
  8. ↑ For the connection between Elena and Mark Braverman, see the dedication of Mark Braverman's master's thesis, Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable, University of Toronto, 2004.
  9. ↑ Braverman, Mark; Lumelskii, Yan (2002), "Chebyshev systems and estimation theory for discrete distributions", Statistics & Probability Letters, 58 (2): 157–165, doi:10.1016/S0167-7152(02)00114-1, MR 1914914


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.