László Babai won a gold medal at the International Mathematical Olympiad in 1968, marking the beginning of an extensive academic career. A mathematician and computer scientist born in 1950 in Budapest, he focuses his research on computational complexity theory, combinatorics, and finite groups, with an emphasis on the interactions between these specialized fields of study.
Academic Foundations and Early Career
Babai attended the Fazekas Mihály Gimnázium before studying at the Faculty of Science of the Eötvös Loránd University from 1968 to 1973. He later earned a PhD in 1975 and a DSc in 1984 from the Hungarian Academy of Sciences. His teaching career began at Eötvös Loránd University in 1971. In 1987, he moved into joint positions as a professor of algebra in Budapest and computer science at the University of Chicago. He transitioned fully to the University of Chicago mathematics department in 1995.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Complexity Theory
The author of over 180 academic papers, Babai is noted for introducing interactive proof systems and group theoretic methods in graph isomorphism testing. He also coined the term Las Vegas algorithm. In 2015, he announced a quasipolynomial time algorithm for the graph isomorphism problem, subsequently presenting the detailed proof at the 2016 ACM Symposium on Theory of Computing and providing an update in 2017 following a review by Harald Helfgott.
Professional Service and Recognition
Babai serves as editor-in-chief of the online journal Theory of Computing and contributed to the creation of the Budapest Semesters in Mathematics program. His work earned him the Gödel Prize in 1993, the Knuth Prize in 2015, and the Dijkstra Prize in 2016. He is a member of the Hungarian Academy of Sciences and the American Academy of Arts and Sciences. He has delivered talks at International Congresses of Mathematicians in Kyoto, Zürich, and Rio de Janeiro.
Fast facts
- Born: 1950, Budapest
- Citizenship: Hungary
- Education: Eötvös Loránd University, Hungarian Academy of Sciences
- Primary Fields: Combinatorics, computational complexity theory, finite group
- Employment: University of Chicago
- Notable Awards: Gödel Prize (1993), Knuth Prize (2015), Dijkstra Prize (2016)
- Professional Membership: Hungarian Academy of Sciences, American Academy of Arts and Sciences
Questions readers ask
What is the primary focus of László Babai's research?
His work centers on computational complexity theory, combinatorics, and finite group theory, particularly the intersections of these fields.
Has he received recognition for his contributions to computer science?
Yes, he has been awarded the Gödel Prize, the Knuth Prize, and the Dijkstra Prize for his academic achievements.
Achievements
- Affiliated with University of Chicago
- Educated at Eötvös Loránd University, Hungarian Academy of Sciences and Fazekas Mihály Gimnázium
- Worked as mathematician, computer scientist and university teacher
