Allan Borodin

Share on Facebook Share on Twitter Email
Top

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

Biography

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]

Awards and honors

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]

See also

Selected publications

References

  1. ^ a b c Past prizes and awards, PIMS, retrieved 2012-03-17.
  2. ^ a b Boridin named University Professor, U. Toronto Computer Science, retrieved 2012-03-17.
  3. ^ Allan Bertram Borodin at the Mathematics Genealogy Project
  4. ^ Allan Borodin: Recipient of the 2008 CRM-Fields-PIMS Prize, retrieved 2012-03-17.
  5. ^ AAAS Members Elected as Fellows in 2011, retrieved 2012-03-17.

External links


Post a question - any question - to the WikiAnswers community:

Copyrights: