László Babai

From Wikipedia, the free encyclopedia
Jump to: navigation, search
László Babai
Laszlo Babai.jpg
Born (1950-07-20) July 20, 1950 (age 66)
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)[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 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.[1][2] 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,[3] the introduction of the term Las Vegas algorithm,[4] and the introduction of group theoretic methods in graph isomorphism testing.[4] In November 2015, he announced a quasipolynomial time algorithm for the graph isomorphism problem.[5][6][7]

He is editor-in-chief of the refereed online journal Theory of Computing.[8] Babai was also involved in the creation of the Budapest Semesters in Mathematics program and first coined the name.

Graph Isomorphism in Quasipolynomial Time[edit]

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.[9][10][11][12] A video of the first talk was published on 10 December 2015[13] and a preprint was uploaded to arXiv.org on 11 December 2015.[7]


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.[17]

In 2015, he was elected[18] a fellow of the American Academy of Arts and Sciences, and won the Knuth Prize.


copy from Lenta.ru // texnomaniya.ru, 20 ноября 2015
Опубліковано швидкий алгоритм для задачі ізоморфізму графів // Джерело: Хабрахабр, перекладено 16 грудня 2015, 06:30


  1. ^ a b c d e f Curriculum vitae from Babai's web site, retrieved 2016-01-28.
  2. ^ László Babai at the Mathematics Genealogy Project
  3. ^ Babai, László; Moran, Shlomo (1988), "Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class", J. Comput. Syst. Sci., 36 (2): 254–276, doi:10.1016/0022-0000(88)90028-1 .
  4. ^ a b Babai, László (1979), Monte-Carlo algorithms in graph isomorphism testing (PDF), Tech. Report, Université de Montréal .
  5. ^ Cho, Adrian (November 10, 2015), "Mathematician claims breakthrough in complexity theory", Science, doi:10.1126/science.aad7416 
  6. ^ Klarreich, Erica. "Landmark Algorithm Breaks 30-Year Impasse". quantamagazine.org. Quanta Magazine. 
  7. ^ a b László Babai. Graph Isomorphism in Quasipolynomial Time, 84 pages / abstract // arXiv.org > cs > arXiv:1512.03547 / version 1 [v1] Fri, 11 Dec 2015 08:04:26 GMT
  8. ^ Theory of Computing editors, retrieved 2010-07-30.
  9. ^ Laszlo Babai (University of Chicago): Graph Isomorphism in Quasipolynomial Time I: The "Local Certificates Algorithm" // Combinatorics and Theoretical Computer Science seminar, 10 November 2015, 15:00 – 16:00
  10. ^ A Big Result On Graph Isomorphism // November 4, 2015, A Fast Graph Isomorphism Algorithm // November 11, 2015
  11. ^ Combinatorics and Theoretical Computer Science calendar // Theoretical Computer Science at the University of Chicago. November 24, 2015, Laszlo Babai (University of Chicago): Graph Isomorphism in Quasipolynomial Time II: The "Split-or-Johnson routine" (Combinatorics and TCS seminar)
  12. ^ Claimed Breakthrough Slays Classic Computing Problem // MIT Technology Review, by Tom Simonite on November 13, 2015
  13. ^ Graph Isomorphism in Quasipolynomial Time I, seminar lecture by László Babai on November 10, 2015. The University of Chicago // youtube, 1 год. 40 хв. Опубліковано 10 грудня 2015
  14. ^ Definition 2.3. String Isomorphism, in: Transactions on Computational Science V. Special Issue on Cognitive Knowledge Representation. Editors-in-Chief: Marina L. Gavrilova, C. J. Kenneth Tan. Editors: Yingxu Wang, Keith Chan / Lecture Notes in Computer Science / Volume 5540, Springer Verlag, 2009
  15. ^ Coset intersection problem // The Group Properties Wiki (beta)
  16. ^ Complexity of the coset intersection problem // Theoretical Computer Science Stack Exchange, asked Sep 25 2014 at 9:43
  17. ^ 1993 Gödel Prize, ACM SIGACT, retrieved 2010-08-14.
  18. ^ American Academy of Arts and Sciences. 2015 Fellows and Their Affiliations

External links[edit]