László Babai
| László Babai | |
|---|---|
 |
|
| Born |
July 20, 1950 Budapest |
| Nationality | Hungarian |
| Fields | Computer Science, Mathematics |
| Institutions | University of Chicago |
| Alma mater | Hungarian Academy of Sciences |
| Doctoral advisor |
Pál Turán Vera T. Sós |
| Doctoral students |
Péter Hajnal Lajos Rónyai José Soares Mario Szegedy Gábor Tardos |
| Notable awards |
Gödel Prize (1993) Knuth Prize (2015) Dijkstra Prize (2016) |
László "Laci" Babai (born July 20, 1950 in Budapest) is a Hungarian professor of computer science and mathematics at the University of Chicago. His research focuses on computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields.
In 1968 Babai got a gold medal at International Mathematical Olympiad. Babai studied mathematics at Eötvös Loránd University from 1968 to 1973, received a Ph.D. from the Hungarian Academy of Sciences in 1975, and received a D.Sc. from the Hungarian Academy of Sciences in 1984. He held a teaching position at Eötvös Loránd University since 1971; in 1987 he took joint positions as a professor in algebra at Eötvös Loránd and in computer science at the University of Chicago. In 1995 he began a joint appointment in the mathematics department at Chicago and gave up his position at Eötvös Loránd.
He is the author of over 180 academic papers. His notable accomplishments include the introduction of interactive proof systems, the introduction of the term Las Vegas algorithm, and the introduction of group theoretic methods in graph isomorphism testing. In November 2015, he announced a quasipolynomial time algorithm for the graph isomorphism problem.
He is editor-in-chief of the refereed online journal Theory of Computing. Babai was also involved in the creation of the Budapest Semesters in Mathematics program and first coined the name.
...
Wikipedia