| Benny Sudakov | |
| Birth Date: | October 1969 |
| Birth Place: | Tbilisi, Georgian Soviet Socialist Republic |
| Citizenship: | Israel |
| Field: | Mathematics |
| Work Institutions: | UCLA Princeton University Institute for Advanced Study ETH Zurich |
| Alma Mater: | Tbilisi State University Tel Aviv University |
| Doctoral Advisor: | Noga Alon |
| Thesis Title: | Extremal Problems in Probabilistic Combinatorics and Their Algorithmic Aspects |
| Thesis Year: | 1999 |
| Doctoral Students: | Jacob Fox Hao Huang Peter Keevash Po-Shen Loh |
Benny Sudakov (born October 1969) is an Israeli mathematician, who works mainly on extremal and probabilistic combinatorics.
He was born in Tbilissi, Georgia, and completed his undergraduate studies at Tbilisi State University in 1990. After emigrating to Israel, he received his PhD from Tel Aviv University in 1999, under the supervision of Noga Alon.From 1999 until 2002, he held a Veblen Research Instructorship,[1] a joint position between Princeton University and the Institute for Advanced Study. Until 2007, he was an assistant professor at Princeton University. Until 2014, he was a professor at the University of California, Los Angeles.[2] In July 2013, Sudakov joined ETH Zurich as a professor.[3]
Sudakov has broad interests within the field of combinatorics, having written papers on extremal combinatorics, Ramsey theory, random graphs, and positional games.
In 2012, he became a Fellow of the American Mathematical Society.[4]
He gave an invited talk at the International Congress of Mathematicians in 2010 at Hyderabad, on the topic of "Combinatorics".[5]