Follow
Allan Borodin
Allan Borodin
Professor of Computer Science, University of Toronto
Verified email at cs.toronto.edu - Homepage
Title
Cited by
Cited by
Year
Online computation and competitive analysis
A Borodin, R El-Yaniv
cambridge university press, 2005
33822005
Routing, merging and sorting on parallel models of computation
A Borodin, JE Hopcroft
Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982
6561982
The computational complexity of algebraic and numeric problems.
A Borodin, I Munro
6471975
An optimal on-line algorithm for metrical task system
A Borodin, N Linial, ME Saks
Journal of the ACM (JACM) 39 (4), 745-763, 1992
6201992
On the power of randomization in on-line algorithms
S Ben-David, A Borodin, R Karp, G Tardos, A Wigderson
Algorithmica 11, 2-14, 1994
5841994
On relating time and space to size and depth
A Borodin
SIAM journal on computing 6 (4), 733-744, 1977
4791977
Link analysis ranking: algorithms, theory, and experiments
A Borodin, GO Roberts, JS Rosenthal, P Tsaparas
ACM Transactions on Internet Technology (TOIT) 5 (1), 231-297, 2005
4192005
Threshold models for competitive influence in social networks
A Borodin, Y Filmus, J Oren
Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010
4142010
Finding authorities and hubs from link structures on the world wide web
A Borodin, GO Roberts, JS Rosenthal, P Tsaparas
Proceedings of the 10th international conference on World Wide Web, 415-429, 2001
3902001
Fast parallel matrix and GCD computations
A Borodin, J von zur Gathem, J Hopcroft
23rd annual symposium on foundations of computer science (sfcs 1982), 65-71, 1982
3541982
Adversarial queuing theory
A Borodin, J Kleinberg, P Raghavan, M Sudan, DP Williamson
Journal of the ACM (JACM) 48 (1), 13-38, 2001
2912001
Can we learn to beat the best stock
A Borodin, R El-Yaniv, V Gogan
Advances in Neural Information Processing Systems 16, 2003
2842003
A time-space tradeoff for sorting on a general sequential model of computation
A Borodin, S Cook
Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook …, 2023
2142023
On lower bounds for read-k-times branching programs
A Borodin, A Razborov, R Smolensky
Computational Complexity 3, 1-18, 1993
2091993
Parallel computation for well-endowed rings and space-bounded probabilistic machines
A Borodin, S Cook, N Pippenger
Information and control 58 (1-3), 113-136, 1983
2051983
Competitive paging with locality of reference
A Borodin, S Irani, P Raghavan, B Schieber
Journal of Computer and System Sciences 50 (2), 244-258, 1995
1991995
Resource allocation with immunity to limited process failure
MJ Fischer, NA Lynch, JE Burns, A Borodin
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 234-254, 1979
1871979
Two applications of inductive counting for complementation problems
A Borodin, SA Cook, PW Dymond, WL Ruzzo, M Tompa
SIAM Journal on computing 18 (3), 559-578, 1989
1691989
A new measure for the study of on-line algorithms
S Ben-David, A Borodin
Algorithmica 11, 73-91, 1994
1621994
Max-sum diversification, monotone submodular functions and dynamic updates
A Borodin, HC Lee, Y Ye
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
1602012
The system can't perform the operation now. Try again later.
Articles 1–20