| On finding lowest common ancestors: Simplification and parallelization B Schieber, U Vishkin SIAM Journal on Computing 17 (6), 1253-1262, 1988 | 680 | 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 | 464 | 2001 |
| Approximating minimum feedback sets and multicuts in directed graphs G Even, JS Naor, B Schieber, M Sudan Algorithmica 20 (2), 151-174, 1998 | 314 | 1998 |
| 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 | 264 | 2002 |
| 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 | 264 | 2002 |
| 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 | 262 | 2000 |
| Buffer overflow management in QoS switches A Kesselman, Z Lotker, Y Mansour, B Patt-Shamir, B Schieber, ... SIAM Journal on Computing 33 (3), 563-583, 2004 | 252 | 2004 |
| Approximating the throughput of multiple machines in real-time scheduling A Bar-Noy, S Guha, J Naor, B Schieber SIAM Journal on Computing 31 (2), 331-352, 2001 | 240 | 2001 |
| Approximating the throughput of multiple machines in real-time scheduling A Bar-Noy, S Guha, J Naor, B Schieber SIAM Journal on Computing 31 (2), 331-352, 2001 | 240 | 2001 |
| E cient routing and scheduling algorithms for optical networks A Aggarwal, A Bar-Noy, D Coppersmith, R Ramaswami, B Schieber, ... Proc. of SODA 93, 1994 | 230 | 1994 |
| Parallel construction of a suffix tree with applications A Apostolico, C Iliopoulos, GM Landau, B Schieber, U Vishkin Algorithmica 3 (1), 347-365, 1988 | 195 | 1988 |
| 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 |
| Fast approximate graph partitioning algorithms G Even, J Naor, S Rao, B Schieber SIAM Journal on Computing 28 (6), 2187-2214, 1999 | 182 | 1999 |
| Parallel ear decomposition search (EDS) and st-numbering in graphs Y Maon, B Schieber, U Vishkin Theoretical Computer Science 47, 277-298, 1986 | 180 | 1986 |
| Navigating in unfamiliar geometric terrain A Blum, P Raghavan, B Schieber Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 158 | 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 | 146 | 1989 |
| Optimal preprocessing for answering on-line product queries N Alon, B Schieber Tel-Aviv University. The Moise and Frida Eskenasy Institute of Computer Sciences, 1987 | 144 | 1987 |
| Finding a minimum-weightk-link path in graphs with the concave Monge property and applications A Aggarwal, B Schieber, T Tokuyama Discrete & Computational Geometry 12 (3), 263-280, 1994 | 129 | 1994 |
| 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 | 123 | 1996 |
| 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 | 122 | 1993 |
