László Babai
From Wikipedia, the free encyclopedia
László Babai (called Laci by friends and colleagues), born July 20, 1950 in Budapest, is a Hungarian professor of mathematics and computer science 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. He is the author of over 150 academic papers.
His notable accomplishments include the introduction of interactive proof systems (see [1]), the introduction of the term Las Vegas algorithm, and the introduction of group theoretic methods in graph isomorphism testing (see [2] for the latter two).
He received his doctorate from the Hungarian Academy of Sciences in 1975.[1]
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.
His Erdős number is one.
Contents |
[edit] Honors
- Gödel Prize for outstanding papers in the area of theoretical computer science (1993)
- Llewellyn John and Harriet Manchester Quantrell Award for Excellence in Undergraduate Teaching (June 2005).
[edit] Quotations
- "What we need is not more theorems, but more proofs."
- "The only math I never used is math I never learned."
[edit] References
[edit] External links
|
|||||
