Laszlo Babai (born July 20, 1950, in Budapest, Hungary) is a Hungarian-American professor of computer science and mathematics at the University of Chicago, holding dual Hungarian and American citizenship. His research emphasizes computational complexity theory, algorithms, combinatorics and finite groups, and the interactions among these fields. In November 2015 he announced a breakthrough quasipolynomial time algorithm for the graph isomorphism problem, presenting the full paper at an ACM symposium in 2016. He shared the Godel Prize in 1993 for work on interactive proof systems, received the Knuth Prize in 2015 and the Dijkstra Prize in 2016, and was elected a fellow of the American Academy of Arts and Sciences in 2015.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.