| Online computation and competitive analysis A Borodin, R El-Yaniv cambridge university press, 2005 | 3207 | 2005 |
| 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 | 631 | 1982 |
| The computational complexity of algebraic and numeric problems. A Borodin | 604 | 1975 |
| 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 | 579 | 1992 |
| 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 | 567 | 1994 |
| On relating time and space to size and depth A Borodin SIAM journal on computing 6 (4), 733-744, 1977 | 471 | 1977 |
| 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 | 405 | 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 | 383 | 2001 |
| Threshold models for competitive influence in social networks A Borodin, Y Filmus, J Oren International workshop on internet and network economics, 539-550, 2010 | 376 | 2010 |
| 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 | 338 | 1982 |
| Adversarial queuing theory A Borodin, J Kleinberg, P Raghavan, M Sudan, DP Williamson Journal of the ACM (JACM) 48 (1), 13-38, 2001 | 285 | 2001 |
| Can we learn to beat the best stock A Borodin, R El-Yaniv, V Gogan Advances in Neural Information Processing Systems 16, 2003 | 235 | 2003 |
| 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 | 199 | 1995 |
| On lower bounds for read-k-times branching programs A Borodin, A Razborov, R Smolensky Computational Complexity 3 (1), 1-18, 1993 | 194 | 1993 |
| A time-space tradeoff for sorting on a general sequential model of computation A Borodin, S Cook Proceedings of the twelfth annual ACM symposium on Theory of computing, 294-301, 1980 | 193 | 1980 |
| 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 | 192 | 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 | 184 | 1979 |
| 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 | 169 | 1989 |
| A new measure for the study of on-line algorithms S Ben-David, A Borodin Algorithmica 11 (1), 73-91, 1994 | 162 | 1994 |
| Adversarial queueing theory A Borodin, J Kleinberg, P Raghavan, M Sudan, DP Williamson Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 156 | 1996 |
