| László Babai | |
| Birth Date: | July 20, 1950 |
| Birth Place: | Budapest, Hungary |
| Nationality: | Hungarian |
| Fields: | Computer Science, Mathematics |
| Workplaces: | University of Chicago |
| Alma Mater: | Hungarian Academy of Sciences |
| Doctoral Advisor: | Pál Turán Vera T. Sós |
| Doctoral Students: | Mario Szegedy Gábor Tardos Péter Pál Pálfy |
| Awards: | Gödel Prize (1993) Knuth Prize (2015) Dijkstra Prize (2016) |
László "Laci" Babai (born July 20, 1950, in Budapest)[1] 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 won a gold medal at the International Mathematical Olympiad. Babai studied mathematics at Faculty of Science of the Eötvös Loránd University from 1968 to 1973, received a PhD from the Hungarian Academy of Sciences in 1975, and received a DSc from the Hungarian Academy of Sciences in 1984.[1] 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.[1]
He is the author of over 180 academic papers.[1] His notable accomplishments include the introduction of interactive proof systems,[2] the introduction of the term Las Vegas algorithm,[3] and the introduction of group theoretic methods in graph isomorphism testing.[3] In November 2015, he announced a quasipolynomial time algorithm for the graph isomorphism problem.[4]
He is editor-in-chief of the refereed online journal Theory of Computing.[5] Babai was also involved in the creation of the Budapest Semesters in Mathematics program and first coined the name.
After announcing the result in 2015,[4] [6] [7] Babai presented a paper proving that the graph isomorphism problem can be solved in quasi-polynomial time in 2016, at the ACM Symposium on Theory of Computing. In response to an error discovered by Harald Helfgott, he posted an update in 2017.[8]
In 1988, Babai won the Hungarian State Prize, in 1990 he was elected as a corresponding member of the Hungarian Academy of Sciences, and in 1994 he became a full member.[1] In 1999 the Budapest University of Technology and Economics awarded him an honorary doctorate.[1]
In 1993, Babai was awarded the Gödel Prize together with Shafi Goldwasser, Silvio Micali, Shlomo Moran, and Charles Rackoff, for their papers on interactive proof systems.[9]
In 2015, he was elected[10] a fellow of the American Academy of Arts and Sciences, and won the Knuth Prize.
Babai was an invited speaker at the International Congresses of Mathematicians in Kyoto (1990), Zürich (1994, plenary talk), and Rio de Janeiro (2018).
copy from Lenta.ru // texnomaniya.ru, 20 ноября 2015
Опубліковано швидкий алгоритм для задачі ізоморфізму графів // Джерело: Хабрахабр, перекладено 16 грудня 2015, 06:30