Baruch Schieber
Baruch Schieber
Verified email at njit.edu
Title
Cited by
Cited by
Year
On finding lowest common ancestors: Simplification and parallelization
B Schieber, U Vishkin
SIAM Journal on Computing 17 (6), 1253-1262, 1988
7021988
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
4872001
Approximating minimum feedback sets and multicuts in directed graphs
G Even, JS Naor, B Schieber, M Sudan
Algorithmica 20 (2), 151-174, 1998
3341998
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
2752002
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
2752002
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
2682000
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
2622004
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
2522001
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
2522001
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
2341994
Parallel construction of a suffix tree with applications
A Apostolico, C Iliopoulos, GM Landau, B Schieber, U Vishkin
Algorithmica 3 (1), 347-365, 1988
2041988
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
1971995
Parallel ear decomposition search (EDS) and st-numbering in graphs
Y Maon, B Schieber, U Vishkin
Theoretical Computer Science 47, 277-298, 1986
1901986
Fast approximate graph partitioning algorithms
G Even, J Naor, S Rao, B Schieber
SIAM Journal on Computing 28 (6), 2187-2214, 1999
1891999
Navigating in unfamiliar geometric terrain
A Blum, P Raghavan, B Schieber
Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991
1651991
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
1521989
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
1491987
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
1331994
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
1261993
The canadian traveller problem
A Bar-Noy, B Schieber
Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991
1251991
The system can't perform the operation now. Try again later.
Articles 1–20