UCLA Princeton University Institute for Advanced Study ETH Zurich
Thesis
Extremal Problems in Probabilistic Combinatorics and Their Algorithmic Aspects (1999)
Doctoral advisor
Noga Alon
Doctoral students
Jacob Fox Hao Huang Peter Keevash Po-Shen Loh
Benny Sudakov (born October 1969)[1] is an Israeli mathematician, who works mainly on extremal and probabilistic combinatorics.
He was born in Tbilissi, Georgia,[1] and completed his undergraduate studies at Tbilisi State University in 1990.[2] After emigrating to Israel, he received his PhD from Tel Aviv University in 1999, under the supervision of Noga Alon.[3]
From 1999 until 2002, he held a Veblen Research Instructorship,[4] 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.[5]
Sudakov has broad interests within the field of combinatorics, having written papers on extremal combinatorics, Ramsey theory, random graphs, and positional games.[2]
In 2012, he became a Fellow of the American Mathematical Society.[6]
He gave an invited talk at the International Congress of Mathematicians in 2010 at Hyderabad, on the topic of "Combinatorics".[7]
^ ab"Biographies of Candidates 2012" (PDF), Notices of the American Mathematical Society, 59 (8): 1140, 2012
^ abc"Benny Sudakov's CV" (PDF).
^Benny Sudakov at the Mathematics Genealogy Project
^"IAS scholar information site". 9 December 2019.
^Department of Mathematics (September 27, 2012). "ETH Zurich appoints Benjamin Sudakov". www.math.ethz.ch. Retrieved February 6, 2013.
^List of Fellows of the American Mathematical Society, retrieved 2013-08-05.
^"ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians. Archived from the original on 2017-11-08. Retrieved 2013-08-15.
BennySudakov (born October 1969) is an Israeli mathematician, who works mainly on extremal and probabilistic combinatorics. He was born in Tbilissi,...
in 2010 from Princeton University; his dissertation, supervised by BennySudakov, was titled Ramsey Numbers. Fox worked in the mathematics department...
copies of any tree with n {\displaystyle n} edges (Richard Montgomery, BennySudakov, Alexey Pokrovskiy, 2020) Disproof of Hedetniemi's conjecture on the...
Complexity of Gap Hamming Distance". Theory of Computing. Matthew Kwan; BennySudakov; Tuan Tran (2018). "Anticoncentration for subgraph statistics". Journal...
Schelp Vera T. Sós Joel Spencer Emanuel Sperner Richard P. Stanley BennySudakov Endre Szemerédi Terence Tao Carsten Thomassen Jacques Touchard Pál Turán...
mathematics in 1998. He earned his doctorate from Princeton University with BennySudakov as advisor. He took a postdoctoral position at the California Institute...
Doctoral advisor Micha Perles Doctoral students Gregory Gutin Tali Kaufman Michael Krivelevich BennySudakov Uri Zwick Website www.math.tau.ac.il/~nogaa/...
(1938–1982), mathematician and founder of the Jewish People's University BennySudakov (born 1969), combinatorics James Joseph Sylvester (1814–1897), mathematician;...
Vasudevan Srinivas Sergei Starchenko Andrys Stipsicz Catharina Stroppel BennySudakov Suresh Venapally Richard Thomas Tatiana Toro Nizar Touzi Dmitry Turaev...
r(G)} is of the order n1+o(1).{\displaystyle n^{1+o(1)}.} Fox, Jacob; Sudakov, Benny (2011). "Dependent random choice". Random Structures & Algorithms. 38...
of the Symposium Smolenice. Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny (2021). "A proof of Ringel's Conjecture". Geometric and Functional Analysis...
ISSN 1076-9757. Retrieved 7 September 2017. Glock, Stefan; Correia, David Munhá; Sudakov, Benny (6 July 2022). "The n-queens completion problem". Research in the Mathematical...
hdl:11858/00-001M-0000-0014-B73F-2, MR 1327775. Alon, Noga; Krivelevich, Michael; Sudakov, Benny (1998), "Finding a large hidden clique in a random graph", Random Structures...
Global Information