Aller au contenu principal

Dr. Allan Borodin

Fellow
Current Employer
University of Toronto
Election Year
1991
Academy
Académie des sciences
Discipline
Mathematics and Computer Sciences
Department
Department of Computer Science
Keywords
Algorithm, analysis, information retrieval
Allan Borodin is one of the nation's two leading researchers in theoretical computer science. He has earned a world-wide reputation for his contributions to computational complexity; especially for his definitive work on time-space lower bounds and establishment of fundamental principles in the theory of parallel algorithms. His leadership while chairman at Toronto from 1980-85 strengthened one of the continent's top ccmputer science departments. The title of his first book, "Social Issues in Computing", indicates the breadth of his interests, while his second book was a major contribution to algebraic complexity theory. He served as Editor-in-Chief of SIAM Journal on Computing.
678