| On finding lowest common ancestors: Simplification and parallelization B Schieber, U Vishkin SIAM Journal on Computing 17 (6), 1253-1262, 1988 | 746 | 1988 |
| A unified approach to approximating resource allocation and scheduling A Bar-Noy, R Bar-Yehuda, A Freund, J Naor, B Schieber Journal of the ACM (JACM) 48 (5), 1069-1090, 2001 | 544 | 2001 |
| Approximating minimum feedback sets and multicuts in directed graphs G Even, J Naor, B Schieber, M Sudan Algorithmica 20, 151-174, 1998 | 375 | 1998 |
| Efficient routing in optical networks A Aggarwal, A Bar-Noy, D Coppersmith, R Ramaswami, B Schieber, ... Journal of the ACM (JACM) 43 (6), 973-1001, 1996 | 358 | 1996 |
| Divide-and-conquer approximation algorithms via spreading metrics G Even, JS Naor, S Rao, B Schieber Journal of the ACM (JACM) 47 (4), 585-616, 2000 | 287 | 2000 |
| Minimizing service and operation costs of periodic scheduling A Bar-Noy, R Bhatia, J Naor, B Schieber Mathematics of Operations Research 27 (3), 518-544, 2002 | 284 | 2002 |
| Approximating the throughput of multiple machines under real-time scheduling A Bar-Noy, S Guha, J Naor, B Schieber Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999 | 268 | 1999 |
| Buffer overflow management in QoS switches A Kesselman, Z Lotker, Y Mansour, B Patt-Shamir, B Schieber, ... Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 263 | 2001 |
| Scalable fair clustering A Backurs, P Indyk, K Onak, B Schieber, A Vakilian, T Wagner International Conference on Machine Learning, 405-413, 2019 | 244 | 2019 |
| Parallel construction of a suffix tree with applications A Apostolico, C Iliopoulos, GM Landau, B Schieber, U Vishkin Algorithmica 3, 347-365, 1988 | 213 | 1988 |
| Fast approximate graph partitioning algorithms G Even, J Naor, S Rao, B Schieber SIAM Journal on Computing 28 (6), 2187-2214, 1999 | 211 | 1999 |
| 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 |
| Parallel ear decomposition search (EDS) and st-numbering in graphs Y Maon, B Schieber, U Vishkin Theoretical Computer Science 47, 277-298, 1986 | 198 | 1986 |
| Optimal preprocessing for answering on-line product queries N Alon, B Schieber arXiv preprint arXiv:2406.06321, 2024 | 172 | 2024 |
| Navigating in unfamiliar geometric terrain A Blum, P Raghavan, B Schieber Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 168 | 1991 |
| Highly parallelizable problems O Berkman, D Breslauer, Z Galil, B Schieber, U Vishkin Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 154 | 1989 |
| Finding a minimum weight K-link path in graphs with Monge property and applications A Aggarwal, B Schieber, T Tokuyama Proceedings of the ninth annual symposium on Computational geometry, 189-197, 1993 | 151 | 1993 |
| The canadian traveller problem A Bar-Noy, B Schieber Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991 | 149 | 1991 |
| Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values O Berkman, B Schieber, U Vishkin Journal of Algorithms 14 (3), 344-370, 1993 | 142 | 1993 |
| Competitive paging with locality of reference A Borodin, P Raghavan, S Irani, B Schieber Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 129 | 1991 |
