Endre Szemerédi
| Endre Szemerédi | |
|---|---|
Endre Szemerédi
|
|
| Born |
August 21, 1940 Budapest, Hungary |
| Nationality | Hungarian American |
| Fields |
Combinatorics Computer science Mathematics Theoretical computer science |
| Institutions | Rutgers University |
| Alma mater | Moscow State University |
| Doctoral advisor | Israel Gelfand |
| Doctoral students |
Jaikumar Radhakrishnan Gabor Sarkozy |
| Notable awards |
Abel Prize (2012) Rolf Schock Prizes (2008) Leroy P. Steele Prize (2008) Pólya Prize (1975) Alfréd Rényi Prize (1973) Member NAS |
Endre Szemerédi (Hungarian: [ˈɛndrɛ ˈsɛmɛreːdi]; born August 21, 1940) is a Hungarian-Americanmathematician, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science at Rutgers University since 1986. He also holds a professor emeritus status at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.
Szemerédi has won prizes in mathematics and science, including the Abel Prize in 2012. He has made a number of discoveries in combinatorics and computer science, including Szemerédi's theorem, the Szemerédi regularity lemma, the Erdős–Szemerédi theorem, the Hajnal–Szemerédi theorem and the Szemerédi–Trotter theorem.
Szemerédi was born in Budapest. Since his parents wished him to become a doctor, Szemerédi enrolled at a college of medicine, but he dropped out after six months (in an interview he explained it: "I was not sure I could do work bearing such responsibility."). He studied in Eötvös Loránd University in Budapest and received his PhD from Moscow State University. His adviser was Israel Gelfand. This stemmed from a misspelling, as Szemerédi originally wanted to study with Alexander Gelfond.
...
Wikipedia