Allan Bertram Borodin is a Canadian-American computer scientist known for his research in computational complexity theory and algorithms.[1] He is University Professor at the University of Toronto.[2]
|
Contents
|
Borodin did his undergraduate studies at Rutgers University, earning a bachelor's degree in mathematics in 1963. After earning a masters degree at the Stevens Institute of Technology in 1966 (while at the same time working as a programmer at Bell Laboratories), he continued his graduate studies at Cornell University, completing a doctorate in 1969 under the supervision of Juris Hartmanis. He joined the Toronto faculty in 1979 and was promoted to full professor in 1977. He served as department chair from 1980 to 1985, and became University Professor in 2011.[1][2][3]
Borodin was elected as a Fellow of the Royal Society of Canada in 1991. In 2008 he won the CRM-Fields Prize.[1][4] He became a fellow of the American Association for the Advancement of Science in 2011.[5]
| This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)