Hungarian mathematician; combinatorialist, 2021 Abel Prize laureate
academic
László Lovász (born 9 March 1948, Budapest) is a Hungarian mathematician best known for his work in combinatorics, discrete mathematics and theoretical computer science. Inspired as a teenager by Paul Erdős, he won medals at the International Mathematical Olympiad (1963-1966) and published his first paper in 1965 at age 17. He held chairs at Eötvös Loránd University and Yale, was a senior researcher at Microsoft Research (1999-2006), returned to head the Mathematical Institute of ELTE, and served as president of the Hungarian Academy of Sciences. He shared the 2021 Abel Prize with Avi Wigderson for foundational contributions to theoretical computer science and discrete mathematics.
László Lovász is a Hungarian mathematician and 2021 Abel Prize laureate (shared with Avi Wigderson). Educated in Budapest, he was inspired by Paul Erdős and won IMO medals 1963-1966. He earned the Candidate Degree (C.Sc.) from the Hungarian Academy of Sciences in 1970 and a doctorate from Eötvös Loránd University in 1971 (advisor Tibor Gallai). Career: research assistant at ELTE (1971-75); Docent then Professor at József Attila University, Szeged (1975-1983); Chair of Computer Science at ELTE (1983-1993); William K. Lanman Professor at Yale (1993-1999); Senior Researcher at Microsoft Research (1999-2006); Director of the Mathematical Institute at ELTE (2006-). Known for the LLL lattice basis reduction algorithm, the Lovász Local Lemma, and the ellipsoid method in combinatorial optimization.
Details
UniversityEötvös Loránd University
Education
Eötvös Loránd University
Achievements2021 Abel Prize (with Avi Wigderson) · 1999 Wolf Prize in Mathematics · 1970 Grünwald Géza Prize (Bolyai Society) · Medals at the International Mathematical Olympiad 1963-1966
AwardsAbel Prize (2021) · Wolf Prize in Mathematics (1999) · Kyoto Prize · Gödel Prize · Knuth Prize
LL