Nationality Hungarian Fields Mathematics | Name Laszlo Babai Awards Godel Prize Role Professor of mathematics | |
 | ||
Doctoral students Peter HajnalLajos RonyaiJose SoaresMario SzegedyGabor Tardos Similar People | ||
Education Eotvos Lorand University Doctoral advisor Pal Turan, Vera T. Sos | ||
graph isomorphism in quasipolynomial time i seminar lecture by laszlo babai on november 10 2015
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.
Contents
- graph isomorphism in quasipolynomial time i seminar lecture by laszlo babai on november 10 2015
- graph isomorphism in quasipolynomial time ii seminar lecture by laszlo babai on november 24 2015
- Life
- Work
- Graph Isomorphism in Quasipolynomial Time
- Honors
- L szl babai
- References
graph isomorphism in quasipolynomial time ii seminar lecture by laszlo babai on november 24 2015
Life
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.
Work
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.
Graph Isomorphism in Quasipolynomial Time
From 10 November to 1 December 2015, Babai gave three lectures on «Graph Isomorphism in Quasipolynomial Time» in the «Combinatorics and Theoretical Computer Science» Seminar at the University of Chicago. He outlined a proof to show that the Graph isomorphism problem can be solved in quasi-polynomial time. A video of the first talk was published on 10 December 2015 and a preprint was uploaded to arXiv.org on 11 December 2015.
Honors
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. In 1999 the Budapest University of Technology and Economics awarded him an honorary doctorate.
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.
In 2015, he was elected a fellow of the American Academy of Arts and Sciences, and won the Knuth Prize.