Avrim Blum | |
Birth Name: | Avrim Louis Blum |
Birth Date: | 27 May 1966 |
Birth Place: | Boston, Massachusetts, United States |
Field: | Computer Science |
Work Institution: | Carnegie Mellon University Toyota Technological Institute at Chicago |
Alma Mater: | Massachusetts Institute of Technology |
Thesis Title: | Algorithms for Approximate Graph Coloring |
Thesis Year: | 1991 |
Thesis Url: | https://dspace.mit.edu/handle/1721.1/149708 |
Doctoral Advisor: | Ron Rivest |
Doctoral Students: | |
Known For: | Co-training |
Father: | Manuel Blum |
Mother: | Lenore Blum |
Avrim Louis Blum (born 27 May 1966) is a computer scientist. In 2007, he was made a Fellow of the Association for Computing Machinery[1] "for contributions to learning theory and algorithms." Blum attended MIT, where he received his Ph.D. in 1991 under professor Ron Rivest.[2] He was a professor of computer science at Carnegie Mellon University from 1991 to 2017.[3]
In 2017, he joined Toyota Technological Institute at Chicago as professor and chief academic officer.
His main work has been in the area of theoretical computer science, with particular activity in the fields of machine learning, computational learning theory, algorithmic game theory, database privacy, and algorithms.
Avrim is the son of two other well-known computer scientists, Manuel Blum, 1995 Turing Award winner, and Lenore Blum.[4]