Allan Bertram Borodin CM (born 1941) is a Canadian-American computer scientist who is a professor at the University of Toronto.
[2][3] Borodin did his undergraduate studies at Rutgers University, earning a bachelor's degree in mathematics in 1963.
After earning a master's degree at the Stevens Institute of Technology in 1966 (while at the same time working part time 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 1969 and was promoted to full professor in 1977.
[3][5] He became a fellow of the American Association for the Advancement of Science in 2011,[6] and a fellow of the Association for Computing Machinery in 2014 "For contributions to theoretical computer science in complexity, on-line algorithms, resource tradeoffs, and models of algorithmic paradigms.