Allan Borodin
From Wikipedia, the free encyclopedia
Allan Bertram Borodin is a mathematician and computational theorist who has done important work in computational complexity theory and algorithms. His influence on theoretical computer science has been enormous, and its scope very broad. Jon Kleinberg, winner of the 2006 Nevanlinna Prize, writes of Borodin, "he is one of the few researchers for whom one can cite examples of impact on nearly every area of theory, and his work is characterized by a profound taste in choice of problems, and deep connections with broader issues in computer science." Allan Borodin has made fundamental contributions to many areas, including algebraic computations, resource tradeoffs, routing in interconnection networks, parallel algorithms, online algorithms, adversarial queuing theory and information retrieval.
He received his B.A. in Mathematics from Rutgers University in 1963, his M.S. in Electrical Engineering & Computer Science in 1966 from Stevens Institute of Technology, and his Ph.D. in Computer Science from Cornell University in 1969. He was a systems programmer at Bell Laboratories in New Jersey from 1963-1966, and a Research Fellow at Cornell from 1966-1969. Since 1969 he has taught with the computer science department at the University of Toronto, becoming a full professor in 1977, and chair of the department from 1980-1985. He has been the editor of many journals including the SIAM Journal of Computing, Algorithmica, the Journal of Computer Algebra, the Journal of Computational Complexity, and the Journal of Applicable Algebra in Engineering, Communication and Computing. He has held positions on, or been active in, dozens of committees and organizations, both inside and outside the University, and has held several visiting professorships internationally. In 1991 Borodin was elected a Fellow of the Royal Society of Canada. In 2008 Borodin won the CRM-Fields Prize.
[edit] See also
[edit] External links
- Allan Borodin at the Mathematics Genealogy Project
- Home Page at University of Toronto
- ALLAN BORODIN: RECIPIENT OF THE 2008 CRM-FIELDS-PIMS PRIZE
[edit] References
- Allan Borodin and Ran El-Yaniv (1998). Online Computation and Competitive Analysis. Cambridge University Press. pp. 1–402.
 |
This article about a mathematician is a stub. You can help Wikipedia by expanding it. |
