2026 Allan Borodin: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	44	7401	7184	294	280	163	13497

Research.com Recognitions

2014 - ACM Fellow For contributions to theoretical computer science in complexity, on-line algorithms, resource tradeoffs, and models of algorithmic paradigms.
1991 - Fellow of the Royal Society of Canada Academy of Science

Overview

Allan Borodin is affiliated with the University of Toronto in Canada. Their research spans multiple areas within computer science and decision sciences, with significant contributions in optimization, algorithms, and theoretical computer science.

The scientist's main fields of study include:

Computer Science
Decision Sciences

Subfields of focus highlight diverse interests and expertise:

Computer Networks and Communications
Management Science and Operations Research
Computational Theory and Mathematics
Artificial Intelligence
Economics and Econometrics

Major research topics covered in their work feature:

Optimization and Search Problems
Complexity and Algorithms in Graphs
Auction Theory and Applications
Game Theory and Voting Systems
Cryptography and Data Security
Game Theory and Applications
Transport and Logistics Innovations

Allan Borodin has collaborated with multiple coauthors across various projects. Frequent collaborators include:

Calum MacRury
Christodoulos Karavasilis
Akash Rakheja
Nisarg Shah
Omer Lev

Their publication venues span both formal conferences and repositories:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
ACM Journal of Experimental Algorithmics
IOP Conference Series Materials Science and Engineering

Some recent publications by Allan Borodin include:

"Distortion in Voting with Top-t Preferences," 2022, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
"Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models," 2020, arXiv (Cornell University)
"An Experimental Study of Algorithms for Online Bipartite Matching," 2020, ACM Journal of Experimental Algorithmics
"Greedy Approaches to Online Stochastic Matching," 2020, arXiv (Cornell University)
"Online Bipartite Matching in the Probe-Commit Model," 2023, arXiv (Cornell University)

Allan Borodin has received several notable recognitions, including:

ACM Fellow in 2014 for contributions to theoretical computer science in complexity, online algorithms, resource tradeoffs, and algorithmic paradigms
Fellow of the Royal Society of Canada in 1991, Academy of Science

Best Publications

Online Computation and Competitive Analysis

Allan Borodin;Ran El-Yaniv

3317
Citations
Routing, merging, and sorting on parallel models of computation

A. Borodin;J. E. Hopcroft

816
Citations
THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.

Allan Borodin;Ian Munro

637
Citations
An optimal on-line algorithm for metrical task system

Allan Borodin;Nathan Linial;Michael E. Saks

590
Citations
On the power of randomization in on-line algorithms

S. Ben-David;A. Borodin;R. Karp;G. Tardos

583
Citations
On Relating Time and Space to Size and Depth

Allan Borodin

481
Citations
Link analysis ranking: algorithms, theory, and experiments

Allan Borodin;Gareth O. Roberts;Jeffrey S. Rosenthal;Panayiotis Tsaparas

432
Citations
Threshold models for competitive influence in social networks

Allan Borodin;Yuval Filmus;Joel Oren

416
Citations
Finding authorities and hubs from link structures on the World Wide Web

Allan Borodin;Gareth O. Roberts;Jeffrey S. Rosenthal;Panayiotis Tsaparas

390
Citations
Fast parallel matrix and GCD computations

Allan Borodin;Joachim von zur Gathem;John Hopcroft

331
Citations
Adversarial queuing theory

Allan Borodin;Jon Kleinberg;Prabhakar Raghavan;Madhu Sudan

303
Citations
Can We Learn to Beat the Best Stock

A. Borodin;R. El-Yaniv;V. Gogan

286
Citations
An optimal online algorithm for metrical task systems

A. Borodin;N. Linial;M. Saks

268
Citations
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation

Allan Borodin;Stephen A. Cook

226
Citations
On lower bounds for read- k -times branching programs

A. Borodin;A. Razborov;R. Smolensky

205
Citations
Parallel computation for well-endowed rings and space-bounded probabilistic machines

A Borodin;S Cook;N Pippenger

202
Citations
Resource allocation with immunity to limited process failure

Michael J. Fischer;Nancy A. Lynch;James E. Burns;Allan Borodin

188
Citations
Adversarial queueing theory

Allan Borodin;Jon Kleinberg;Prabhakar Raghavan;Madhu Sudan

186
Citations
Two applications of inductive counting for complementation problems

A. Borodin;S. A. Cook;P. W. Dymond;W. L. Ruzzo

180
Citations
A new measure for the study of on-line algorithms

Shai Ben-David;Allan Borodin

178
Citations
Competitive paging with locality of reference

Allan Borodin;Prabhakar Raghavan;Sandy Irani;Baruch Schieber

148
Citations
On the Power of Randomization in Online Algorithms (Extended Abstract)

Shai Ben-David;Allan Borodin;Richard M. Karp;Gábor Tardos

1
Citations

Frequent Co-Authors

Martin Tompa University of Washington

Prabhakar Raghavan Google (United States)

Walter L. Ruzzo University of Washington

Ran El-Yaniv Technion – Israel Institute of Technology

Stephen A. Cook University of Toronto

John E. Hopcroft Cornell University

Nancy Lynch MIT

Michael J. Fischer Yale University

Yuval Rabani Hebrew University of Jerusalem

Avi Wigderson Institute for Advanced Study

External Links

Wikipedia of Allan Borodin Personal website of Allan Borodin Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring data science degrees is a smart move for Computer Science students thinking about jobs in analytics, AI, or machine learning. These degrees are increasingly offered online, making them flexible and affordable for students worldwide.

Many universities now provide accredited online electrical engineering programs, which pair well with computer science skills and open doors to careers in hardware, robotics, and embedded systems.

For students seeking quick career advancement, consider easy certifications to get that can lead to high-paying tech roles. These certifications can be completed in a short time and signal specialized skills to employers.

Additionally, earning a graduate degree doesn’t have to be time-consuming. Check the quickest cheapest masters degree options online to boost your qualifications and stand out in the job market without long waits or high costs.

Each of these alternatives offers flexible, respected ways to enhance your skills and diversify your career pathway in technology.