Page semi-protected

Allan Borodin

Allan Borodin
Born1941 (age 80–81)
Alma materRutgers University
Stevens Institute of Technology
Cornell University
AwardsACM Fellow (2014)
Order of Canada (2020)[1]
Scientific career
FieldsTheoretical computer science
InstitutionsUniversity of Toronto
ThesisComputational Complexity and the Existence of Complexity Gaps (1969)
Doctoral advisorJuris Hartmanis
Websitewww.cs.toronto.edu/~bor/

Allan Bertram Borodin CM (born 1941) is a Canadian-American computer scientist who is a professor at the University of Toronto.[2][3]

Biography

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. He served as department chair from 1980 to 1985, and became University Professor in 2011.[2][3][4]

Awards and honors

Borodin was elected as a member of the Royal Society of Canada in 1991. In 2008 he won the CRM-Fields-PIMS prize.[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."[7] In 2020 he received the Order of Canada.[8]

Selected publications

Research articles
  • Borodin, Allan (1972). "Computational complexity and the existence of complexity gaps". Journal of the ACM. 19 (1): 158–174. CiteSeerX 10.1.1.453.2374. doi:10.1145/321679.321691. S2CID 2387962.
  • Borodin, Allan (1977). "On relating time and space to size and depth". SIAM Journal on Computing. 6 (4): 733–744. CiteSeerX 10.1.1.394.1059. doi:10.1137/0206054. MR 0461984.
  • Ben-David, S.; Borodin, A.; Karp, R.; Tardos, G.; Wigderson, A. (1994). "On the power of randomization in on-line algorithms". Algorithmica. 11 (1): 2–14. doi:10.1007/BF01294260. MR 1247985. S2CID 26771869.
Books

See also

References

  1. ^ "Governor General Announces 114 New Appointments to the Order of Canada". 26 November 2020.
  2. ^ a b 보로딘은 미국 토론토 컴퓨터 사이언스의 웨이백 머신에서 Archived 2011-09-13 대학교수를 2012-03-17로 임명했다.
  3. ^ a b c 과거의 상과 상, PIMS는 2012-03-17을 회수했다.
  4. ^ 수학계보 프로젝트 앨런 버트람 보로딘
  5. ^ 알란 보로딘: 2008년 CRM-Fields-PIMS상 수상자, 2012-03-17을 회수했다.
  6. ^ 2011년 동료로 선출된 AAAS 회원들은 2012년 1월 13일 웨이백머신에 보관되어 2012-03-17을 회수했다.
  7. ^ ACM은 2015년 1월 8일 ACM, 웨이백머신에 보관된 2015-01-09 컴퓨팅 혁신 담당자를 선정하여 2015-01-08을 검색했다.
  8. ^ "Governor General Announces 114 New Appointments to the Order of Canada". 26 November 2020.

외부 링크

Flag of United StatesScientist icon Racine carrée bleue.svg

미국 수학자에 관한 이 기사는 단조롭다. 위키피디아를 확장하여 도울 수 있다.