Avrim Blum
From Wikipedia the free encyclopedia
Avrim Blum | |
|---|---|
 | |
| Born | Avrim Louis Blum May 27, 1966 Boston, Massachusetts, United States |
| Alma mater | Massachusetts Institute of Technology |
| Known for | Co-training |
| Parents |
|
| Scientific career | |
| Fields | Computer Science |
| Institutions | Carnegie Mellon University Toyota Technological Institute at Chicago |
| Thesis | Algorithms for Approximate Graph Coloring (1991) |
| Doctoral advisor | Ron Rivest |
| Doctoral students | |
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]
Bibliography[edit]
- Blum, Avrim, John Hopcroft, and Ravindran Kannan. "Foundations of Data Science," February 27, 2020. https://home.ttic.edu/~avrim/book.pdf.
See also[edit]
References[edit]
External links[edit]
- Videos of Avrim lecturing
- Avrim Blum's homepage at the Toyota Technological Institute at Chicago
- Avrim Blum's homepage at Carnegie Mellon University
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
   | This article about an American scientist is a stub. You can help Wikipedia by expanding it. |