| Online computation and competitive analysis A Borodin, R El-Yaniv cambridge university press, 2005 | 2931 | 2005 |
| The computational complexity of algebraic and numeric problems. A Borodin | 583 | 1975 |
| On the power of randomization in on-line algorithms S Ben-David, A Borodin, R Karp, G Tardos, A Wigderson Algorithmica 11 (1), 2-14, 1994 | 527 | 1994 |
| 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 | 523 | 1992 |
| On relating time and space to size and depth A Borodin SIAM journal on computing 6 (4), 733-744, 1977 | 447 | 1977 |
| Routing, merging, and sorting on parallel models of computation A Borodin, JE Hopcroft Journal of computer and system sciences 30 (1), 130-145, 1985 | 404 | 1985 |
| 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 | 373 | 2005 |
| 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 | 371 | 2001 |
| 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 | 324 | 1982 |
| Threshold models for competitive influence in social networks A Borodin, Y Filmus, J Oren International workshop on internet and network economics, 539-550, 2010 | 312 | 2010 |
| Adversarial queuing theory A Borodin, J Kleinberg, P Raghavan, M Sudan, DP Williamson Journal of the ACM (JACM) 48 (1), 13-38, 2001 | 270 | 2001 |
| Can we learn to beat the best stock A Borodin, R El-Yaniv, V Gogan Journal of Artificial Intelligence Research 21, 579-594, 2004 | 191 | 2004 |
| 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 | 190 | 1995 |
| 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 | 187 | 1982 |
| On lower bounds for read-k-times branching programs A Borodin, A Razborov, R Smolensky Computational Complexity 3 (1), 1-18, 1993 | 186 | 1993 |
| A time-space tradeoff for sorting on a general sequential model of computation A Borodin, S Cook SIAM Journal on Computing 11 (2), 287-297, 1982 | 182 | 1982 |
| 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 | 181 | 1983 |
| 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 | 173 | 1979 |
| A new measure for the study of on-line algorithms S Ben-David, A Borodin Algorithmica 11 (1), 73-91, 1994 | 161 | 1994 |
| 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 | 160 | 1989 |
