Allan Borodin

Allan Borodin is a University Professor in the Department of Computer Science at the University of Toronto. His research focuses on theoretical computer science, including the design and analysis of algorithms, algorithmic paradigms, online algorithms, algorithmic game theory, and social choice theory. He is associated with the Theory Group in the department. His home page provides links to his journal, conference, and unpublished papers, as well as teaching materials and a draft table of contents for a forthcoming text on online and other myopic algorithms.

Allan Borodin is a Professor of Computer Science at the University of Toronto, specializing in theoretical computer science and algorithm design. His research focuses on the design and analysis of algorithms, particularly in online computation, competitive analysis, and resource allocation. Borodin has contributed significantly to understanding the performance of algorithms in dynamic and adversarial environments. His work includes studies on metrical task systems, adversarial queuing theory, and time-space tradeoffs for sorting. He has also explored the intersection of algorithmic theory with social networks and link analysis. His research emphasizes the development of efficient and robust algorithms for complex computational problems.