Baruch Schieber
About Contact Publications
NJIT

Baruch Schieber NJIT

About

Photo of Me

Baruch Schieber
Professor, Department of Computer Science, and Director, Insitute for Future Technologies
New Jersey Institute of Technology (NJIT)

Welcome to my website. I am a professor in the Department of Computer Science, Ying Wu College of Computing, at New Jersey Institute of Technology (NJIT).
Currently, I serve as the director of the Institute for Future technologies, a joint Ben Gurion University - NJIT institute.
Previous to NJIT I was at IBM Research. My last role at IBM Research was Manager, Mathematics of AI.

Ph.D., Computer Science, Tel-Aviv University
M.Sc., Computer Science, Technion
B.Sc., Computer Science (summa cum laude), Technion

CV

Contact

GITC 4207, NJIT, University Heights, Newark, NJ 07102
Phone: +1-973-596-5497
Email: sbar "at" njit.edu

Publications

Journal papers

[J75] K.K. Sarpatwar, B. Schieber, and H. Shachnai.
The Preemptive Resource Allocation Problem. Journal of Scheduling, 27(1):103—118, 2024. 
@article{J75,
  author = {K.K. Sarpatwar and B. Schieber and H. Shachnai},
  year = {2024},
  journal = {Journal of Scheduling},
  pages = {103--118},
  title = {The Preemptive Resource Allocation Problem},
  volume = {45},
  number = {1}
}
[J74] V. Nagarajan, B. Schieber, and H. Shachnai.
The Euclidean k -supplier problem. Mathematics of Operations Research, 45:1—14, 2020. 
@article{J74,
  author = {V. Nagarajan and B. Schieber and H. Shachnai},
  year = {2020},
  journal = {Mathematics of Operations Research},
  pages = {1--14},
  title = {The Euclidean $k$-Supplier Problem},
  volume = {45}
}
[J73] K. Onak, B. Schieber, S. Solomon, and N. Wein.
Fully dynamic MIS in uniformly sparse graphs. ACM Transactions on Algorithms, 16:26:1—26:19, 2020. 
@article{J73,
  author = {K. Onak and B. Schieber and S. Solomon and N. Wein},
  year = {2020},
  journal = {ACM Transactions on Algorithms},
  pages = {26:1--26:19},
  title = {Fully Dynamic {MIS} in Uniformly Sparse Graphs},
  volume = {16}
}
[J72] D. Katz, B. Schieber, and H. Shachnai.
Flexible resource allocation to interval jobs. Algorithmica, 81:3217—3244, 2019. 
@article{J72,
  author = {D. Katz and B. Schieber and H. Shachnai},
  year = {2019},
  journal = {Algorithmica},
  pages = {3217--3244},
  title = {Flexible Resource Allocation to Interval Jobs},
  volume = {81}
}
[J71] K.K. Sarpatwar, B. Schieber, and H. Shachnai.
Constrained submodular maximization via greedy local search. Operations Research Letters, 47:1—6, 2019. 
@article{J71,
  author = {K.K. Sarpatwar and B. Schieber and H. Shachnai},
  year = {2019},
  journal = {Operations Research Letters},
  pages = {1--6},
  title = {Constrained Submodular Maximization via Greedy Local Search},
  volume = {47}
}
[J70] S. Toubaline, C. D'Ambrosio, L. Liberti, P-L. Poirion, B. Schieber, and H. Shachnai.
Complexity and inapproximability results for the power edge set problem. Journal of Combinatorial Optimization, 35:895—905, 2018. 
@article{J70,
  author = {S. Toubaline and D'Ambrosio, C. and L. Liberti and P-L. Poirion and B. Schieber and H. Shachnai},
  year = {2018},
  journal = {Journal of Combinatorial Optimization},
  pages = {895--905},
  title = {Complexity and inapproximability results for the Power Edge Set problem},
  volume = {35}
}
[J69] B. Schieber, H. Shachnai, G. Tamir, and T. Tamir.
A theory and algorithms for combinatorial reoptimization. Algorithmica, 80:576—607, 2018. 
@article{J69,
  author = {B. Schieber and H. Shachnai and G. Tamir and T. Tamir},
  year = {2018},
  journal = {Algorithmica},
  pages = {576--607},
  title = {A Theory and Algorithms for Combinatorial Reoptimization},
  volume = {80}
}
[J68] R. Adany, M. Feldman, E. Haramaty, R. Khandekar, B. Schieber, R. Schwartz, H. Shachnai, and T. Tamir.
All-or-nothing generalized assignment with applications to scheduling advertising campaigns. ACM Transactions on Algorithms, 12:38:1—38:25, 2016. 
@article{J68,
  author = {R. Adany and M. Feldman and E. Haramaty and R. Khandekar and B. Schieber and R. Schwartz and H. Shachnai and T. Tamir},
  year = {2016},
  journal = {ACM Transactions on Algorithms},
  pages = {38:1--38:25},
  title = {All-or-Nothing Generalized Assignment with Applications to Scheduling Advertising Campaigns},
  volume = {12}
}
[J67] R. Khandekar, B. Schieber, H. Shachnai, and T. Tamir.
Real-time scheduling to minimize machine busy times. Journal of Scheduling, 18:561—573, 2015. 
@article{J67,
  author = {R. Khandekar and B. Schieber and H. Shachnai and T. Tamir},
  year = {2015},
  journal = {Journal of Scheduling},
  pages = {561--573},
  title = {Real-time Scheduling to Minimize Machine Busy Times},
  volume = {18}
}
[J66] N. Bansal, D. Chen Z., D. Coppersmith, X. Hu S., S. Luan, E. Misiolek, B. Schieber, and C. Wang.
Shape rectangularization problems in intensity-modulated radiation therapy. Algorithmica, 60:421—450, 2011. 
@article{J66,
  author = {N. Bansal and D. Chen Z. and D. Coppersmith and X. Hu S. and S. Luan and E. Misiolek and B. Schieber and C. Wang},
  year = {2011},
  journal = {Algorithmica},
  pages = {421--450},
  title = {Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy},
  volume = {60}
}
[J65] N. Bansal, N. Chen, N. Cherniavsky, A. Rudra, B. Schieber, and M. Sviridenko.
Dynamic pricing for impatient bidders. ACM Transactions on Algorithms, 6:35:1—35:21, 2010. 
@article{J65,
  author = {N. Bansal and N. Chen and N. Cherniavsky and A. Rudra and B. Schieber and M. Sviridenko},
  year = {2010},
  journal = {ACM Transactions on Algorithms},
  pages = {35:1--35:21},
  title = {Dynamic Pricing for Impatient Bidders},
  volume = {6}
}
[J64] A. Bar-Noy, S. Guha, Y. Katz, J. Naor, B. Schieber, and H. Shachnai.
Throughput maximization of real-time scheduling with batching. ACM Transactions on Algorithms, 5:18:1—18:17, 2009. 
@article{J64,
  author = {Bar-Noy, A. and S. Guha and Y. Katz and J. Naor and B. Schieber and H. Shachnai},
  year = {2009},
  journal = {ACM Transactions on Algorithms},
  pages = {18:1--18:17},
  title = {Throughput Maximization of Real-Time Scheduling with Batching},
  volume = {5}
}
[J63] R. Bahtia, N. Immorlica, T. Kimbrel, V. Mirrokni, J. Naor, and B. Schieber.
Traffic engineering of management flow by link augmentations on confluent trees. Theory of Computing Systems, 42(1):2—26, 2008. 
@article{J63,
  author = {R. Bahtia and N. Immorlica and T. Kimbrel and V. Mirrokni and J. Naor and B. Schieber},
  year = {2008},
  journal = {Theory of Computing Systems},
  number = {1},
  pages = {2--26},
  title = {Traffic Engineering of Management Flow by Link Augmentations on Confluent Trees},
  volume = {42}
}
[J62] G. Even, R. Levi, D. Rawitz, B. Schieber, S. Shahar, and M. Sviridenko.
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Transactions on Algorithms, 4:34:1—34:17, 2008. 
@article{J62,
  author = {G. Even and R. Levi and D. Rawitz and B. Schieber and S. Shahar and M. Sviridenko},
  year = {2008},
  journal = {ACM Transactions on Algorithms},
  pages = {34:1--34:17},
  title = {Algorithms for Capacitated Rectangle Stabbing and Lot Sizing with Joint Set-Up Costs},
  volume = {4}
}
[J61] F. Barahona, P. Chowdhary, M. Ettl, P. Huang, T. Kimbrel, L. Ladanyi, Y. Lee M., B. Schieber, K. Sourirajan, M. Sviridenko I., and G. Swirszcz M.
Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM Journal of Research and Development, 51:391—408, 2007. 
@article{J61,
  author = {F. Barahona and P. Chowdhary and M. Ettl and P. Huang and T. Kimbrel and L. Ladanyi and Y. Lee M. and B. Schieber and K. Sourirajan and M. Sviridenko I. and G. Swirszcz M.},
  year = {2007},
  journal = {IBM Journal of Research and Development},
  pages = {391--408},
  title = {Inventory allocation and transportation scheduling for logistics of network-centric military operations},
  volume = {51}
}
[J60] O. Gunluk, T. Kimbrel, L. Ladanyi, B. Schieber, and G. Sorkin.
Vehicle routing and staffing for sedan service. Transportation Science, 40:313—326, 2006. 
@article{J60,
  author = {O. Gunluk and T. Kimbrel and L. Ladanyi and B. Schieber and G. Sorkin},
  year = {2006},
  journal = {Transportation Science},
  pages = {313--326},
  title = {Vehicle routing and staffing for sedan service},
  volume = {40}
}
[J59] T. Kimbrel, B. Schieber, and M. Sviridenko.
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. Journal of Scheduling, 9:365—379, 2006. 
@article{J59,
  author = {T. Kimbrel and B. Schieber and M. Sviridenko},
  year = {2006},
  journal = {Journal of Scheduling},
  pages = {365--379},
  title = {Minimizing Migrations in Fair Multiprocessor Scheduling of Persistent Tasks},
  volume = {9}
}
[J58] B. Schieber, D. Geist, and A. Zaks.
Computing the minimum dnf representation of boolean functions defined by intervals. Discrete Applied Mathematics, 149:154—173, 2005. 
@article{J58,
  author = {B. Schieber and D. Geist and A. Zaks},
  year = {2005},
  journal = {Discrete Applied Mathematics},
  pages = {154--173},
  title = {Computing the minimum DNF representation of Boolean functions defined by intervals},
  volume = {149}
}
[J57] A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko.
Buffer overflow management in QoS switches. SIAM Journal on Computing, 33:563—583, 2004. 
@article{J57,
  author = {A. Kesselman and Z. Lotker and Y. Mansour and Patt-Shamir, B. and B. Schieber and M. Sviridenko},
  year = {2004},
  journal = {SIAM Journal on Computing},
  pages = {563--583},
  title = {Buffer Overflow management in {QoS} Switches},
  volume = {33}
}
[J56] M. Charikar, J. Naor, and B. Schieber.
Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Transactions on Networking, 12:340—348, 2004. 
@article{J56,
  author = {M. Charikar and J. Naor and B. Schieber},
  year = {2004},
  journal = {IEEE/ACM Transactions on Networking},
  pages = {340--348},
  title = {Resource optimization in {QoS} multicast routing of real-time multimedia},
  volume = {12}
}
[J55] G.M. Landau, B. Schieber, and M. Ziv-Ukelson.
Sparse LCS common substring alignment. Information Processing Letters, 88:259—270, 2003. 
@article{J55,
  author = {G.M. Landau and B. Schieber and Ziv-Ukelson, M.},
  year = {2003},
  journal = {Information Processing Letters},
  pages = {259--270},
  title = {Sparse {LCS} Common Substring Alignment},
  volume = {88}
}
[J54] G. Even, S. Guha, and B. Schieber.
Improved approximations of crossings in graph drawings. SIAM Journal on Computing, 32:231—252, 2003. 
@article{J54,
  author = {G. Even and S. Guha and B. Schieber},
  year = {2003},
  journal = {SIAM Journal on Computing},
  pages = {231--252},
  title = {Improved approximations of crossings in graph drawings},
  volume = {32}
}
[J53] A. Bar-Noy, J. Naor, and B. Schieber.
Publishing dependent data in clients-providers-servers systems. Wireless Networks, 9:421—430, 2003. 
@article{J53,
  author = {Bar-Noy, A. and J. Naor and B. Schieber},
  year = {2003},
  journal = {Wireless Networks},
  pages = {421--430},
  title = {Publishing dependent data in clients-providers-servers systems},
  volume = {9}
}
[J52] P. Batiste and B. Schieber.
Scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness. Journal of Scheduling, 6:295—404, 2003. 
@article{J52,
  author = {P. Batiste and B. Schieber},
  year = {2003},
  journal = {Journal of Scheduling},
  pages = {295--404},
  title = {Scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness},
  volume = {6}
}
[J51] A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber.
Minimizing service and operation costs of periodic scheduling. Mathematics of Operations Research, 27:518—544, 2002. 
@article{J51,
  author = {Bar-Noy, A. and R. Bhatia and J. Naor and B. Schieber},
  year = {2002},
  journal = {Mathematics of Operations Research},
  pages = {518--544},
  title = {Minimizing service and operation costs of periodic scheduling},
  volume = {27}
}
[J50] A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber.
A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48:1069—1090, 2001. 
@article{J50,
  author = {Bar-Noy, A. and Bar-Yehuda, R. and A. Freund and J. Naor and B. Schieber},
  year = {2001},
  journal = {Journal of the ACM},
  pages = {1069--1090},
  title = {A unified approach to approximating resource allocation and scheduling},
  volume = {48}
}
[J49] A. Bar-Noy, S. Guha, J. Naor, and B. Schieber.
Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31:331—352, 2001. 
@article{J49,
  author = {Bar-Noy, A. and S. Guha and J. Naor and B. Schieber},
  year = {2001},
  journal = {SIAM Journal on Computing},
  pages = {331--352},
  title = {Approximating the throughput of multiple machines in real-time scheduling},
  volume = {31}
}
[J48] A.J. Hoffman and B. Schieber.
The edge versus path incidence matrix of series parallel graphs and greedy packing. Discrete Mathematics, 113:275—284, 2001. 
@article{J48,
  author = {A.J. Hoffman and B. Schieber},
  year = {2001},
  journal = {Discrete Mathematics},
  pages = {275--284},
  title = {The edge versus path incidence matrix of series parallel graphs and greedy packing},
  volume = {113}
}
[J47] A. Bar-Noy, S. Guha, J. Naor, and B. Schieber.
Message multicasting in heterogeneous networks. SIAM Journal on Computing, 30:347—358, 2000. 
@article{J47,
  author = {Bar-Noy, A. and S. Guha and J. Naor and B. Schieber},
  year = {2000},
  journal = {SIAM Journal on Computing},
  pages = {347--358},
  title = {Message multicasting in heterogeneous networks},
  volume = {30}
}
[J46] A. Bar-Noy, S. Kipnis, and B. Schieber.
Optimal multiple message broadcasting in telephone-like communication systems. Discrete Applied Mathematics, 100:1—15, 2000. 
@article{J46,
  author = {Bar-Noy, A. and S. Kipnis and B. Schieber},
  year = {2000},
  journal = {Discrete Applied Mathematics},
  pages = {1--15},
  title = {Optimal Multiple Message Broadcasting in Telephone-Like Communication Systems},
  volume = {100}
}
[J45] G. Even, J. Naor, S. Rao, and B. Schieber.
Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM, 47:585—616, 2000. 
@article{J45,
  author = {G. Even and J. Naor and S. Rao and B. Schieber},
  year = {2000},
  journal = {Journal of the ACM},
  pages = {585--616},
  title = {Divide-and-conquer approximation algorithms via spreading metrics},
  volume = {47}
}
[J44] G. Even, J. Naor, B. Schieber, and L. Zosin.
Approximating minimum subset feedback sets in undirected graphs with applications. SIAM Journal on Discrete Mathematics, 13:255—267, 2000. 
@article{J44,
  author = {G. Even and J. Naor and B. Schieber and L. Zosin},
  year = {2000},
  journal = {SIAM Journal on Discrete Mathematics},
  pages = {255--267},
  title = {Approximating minimum subset feedback sets in undirected graphs with applications},
  volume = {13}
}
[J43] A. Aggarwal, D. Coppersmith, S. Khanna, R. Motwani, and B. Schieber.
The angular-metric traveling salesman problem. SIAM Journal on Computing, 29:697—711, 1999. 
@article{J43,
  author = {A. Aggarwal and D. Coppersmith and S. Khanna and R. Motwani and B. Schieber},
  year = {1999},
  journal = {SIAM Journal on Computing},
  pages = {697--711},
  title = {The angular-metric traveling salesman problem},
  volume = {29}
}
[J42] G. Even, J. Naor, S. Rao, and B. Schieber.
Approximate graph partitioning algorithms. SIAM Journal on Computing, 28:2187—2214, 1999. 
@article{J42,
  author = {G. Even and J. Naor and S. Rao and B. Schieber},
  year = {1999},
  journal = {SIAM Journal on Computing},
  pages = {2187--2214},
  title = {Approximate Graph Partitioning Algorithms},
  volume = {28}
}
[J41] A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber.
Bandwidth allocation with preemption. SIAM Journal on Computing, 28:1806—1828, 1999. 
@article{J41,
  author = {Bar-Noy, A. and R. Canetti and S. Kutten and Y. Mansour and B. Schieber},
  year = {1999},
  journal = {SIAM Journal on Computing},
  pages = {1806--1828},
  title = {Bandwidth allocation with preemption},
  volume = {28}
}
[J40] D. Coppersmith and B. Schieber.
Lower bounds on the depth of monotone arithmetic computations. Journal of Complexity, 15:17—29, 1999. 
@article{J40,
  author = {D. Coppersmith and B. Schieber},
  year = {1999},
  journal = {Journal of Complexity},
  pages = {17--29},
  title = {Lower bounds on the depth of monotone arithmetic computations},
  volume = {15}
}
[J39] B. Schieber.
Computing a minimum weight k -link path in graphs with the concave monge property. Journal of Algorithms, 29:204—222, 1998. Special Issue SODA 1995 papers. 
@article{J39,
  author = {B. Schieber},
  year = {1998},
  journal = {Journal of Algorithms},
  note = {Special Issue SODA 1995 papers},
  pages = {204--222},
  title = {Computing a minimum weight $K\ $-link path in graphs with the concave Monge property},
  volume = {29}
}
[J38] A. Bar-Noy, A. Mayer, B. Schieber, and M. Sudan.
Guaranteeing fair service to persistent dependent tasks. SIAM Journal on Computing, 24:1168—1189, 1998. 
@article{J38,
  author = {Bar-Noy, A. and A. Mayer and B. Schieber and M. Sudan},
  year = {1998},
  journal = {SIAM Journal on Computing},
  pages = {1168--1189},
  title = {Guaranteeing fair service to persistent dependent tasks},
  volume = {24}
}
[J37] G. Barnes, J. Buss, W.L. Ruzzo, and B. Schieber.
A sub-linear space, polynomial time algorithm for directed s -t connectivity. SIAM Journal on Computing, 27:1273—1282, 1998. 
@article{J37,
  author = {G. Barnes and J. Buss and W.L. Ruzzo and B. Schieber},
  year = {1998},
  journal = {SIAM Journal on Computing},
  pages = {1273--1282},
  title = {A sub-linear space, polynomial time algorithm for directed $s\ -t$ connectivity},
  volume = {27}
}
[J36] G. Even, J. Naor, B. Schieber, and M. Sudan.
Approximating minimum feedback sets and multi-cuts in directed graphs. Algorithmica, 20:151—174, 1998. 
@article{J36,
  author = {G. Even and J. Naor and B. Schieber and M. Sudan},
  year = {1998},
  journal = {Algorithmica},
  pages = {151--174},
  title = {Approximating minimum feedback sets and multi-cuts in directed graphs},
  volume = {20}
}
[J35] A. Borodin, P. Raghavan, B. Schieber, and E. Upfal.
How much can hardware help routing? Journal of the ACM, 44(5):726—741, 1997. 
@article{J35,
  author = {A. Borodin and P. Raghavan and B. Schieber and E. Upfal},
  year = {1997},
  journal = {Journal of the ACM},
  number = {5},
  pages = {726--741},
  title = {How much can hardware help routing?},
  volume = {44}
}
[J34] N. Bshouty, Y. Mansour, B. Schieber, and P. Tiwari.
A tight bound for approximating the square root. Information Processing Letters, 63:211—213, 1997. 
@article{J34,
  author = {N. Bshouty and Y. Mansour and B. Schieber and P. Tiwari},
  year = {1997},
  journal = {Information Processing Letters},
  pages = {211--213},
  title = {A tight bound for approximating the square root},
  volume = {63}
}
[J33] A. Borodin, Y. Rabani, and B. Schieber.
Deterministic many-to-many hot potato routing. IEEE Trans. on Parallel and Distributed Systems, 8(6):587—596, 1997. 
@article{J33,
  author = {A. Borodin and Y. Rabani and B. Schieber},
  year = {1997},
  journal = {IEEE Trans. on Parallel and Distributed Systems},
  number = {6},
  pages = {587--596},
  title = {Deterministic many-to-many hot potato routing},
  volume = {8}
}
[J32] A. Blum, P. Raghavan, and B. Schieber.
Navigating in unfamiliar geometric terrain. SIAM Journal on Computing, 26(1):110—137, 1997. 
@article{J32,
  author = {A. Blum and P. Raghavan and B. Schieber},
  year = {1997},
  journal = {SIAM Journal on Computing},
  number = {1},
  pages = {110--137},
  title = {Navigating in unfamiliar geometric terrain},
  volume = {26}
}
[J31] L. Cai and B. Schieber.
A linear-time algorithm for computing the intersection of all odd cycles in a graph. Discrete Applied Mathematics, 73(1):27—34, 1997. 
@article{J31,
  author = {L. Cai and B. Schieber},
  year = {1997},
  journal = {Discrete Applied Mathematics},
  number = {1},
  pages = {27--34},
  title = {A linear-time algorithm for computing the intersection of all odd cycles in a graph},
  volume = {73}
}
[J30] A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan.
Efficient routing in optical networks. Journal of the ACM, 43(6):973—1001, 1996. 
@article{J30,
  author = {A. Aggarwal and Bar-Noy, A. and D. Coppersmith and R. Ramaswami and B. Schieber and M. Sudan},
  year = {1996},
  journal = {Journal of the ACM},
  number = {6},
  pages = {973--1001},
  title = {Efficient routing in optical networks},
  volume = {43}
}
[J29] O. Berkman, B. Schieber, and U. Vishkin.
A fast parallel algorithm for finding the convex hull of a sorted point set. International Journal of Computational Geometry and Applications, 6:231—241, 1996. 
@article{J29,
  author = {O. Berkman and B. Schieber and U. Vishkin},
  year = {1996},
  journal = {International Journal of Computational Geometry and Applications},
  pages = {231--241},
  title = {A fast parallel algorithm for finding the convex hull of a sorted point set},
  volume = {6}
}
[J28] A. Bar-Noy, S. Kipnis, and B. Schieber.
Optimal computation of census functions in the postal model. Discrete Applied Mathematics, 58:213—222, 1995. 
@article{J28,
  author = {Bar-Noy, A. and S. Kipnis and B. Schieber},
  year = {1995},
  journal = {Discrete Applied Mathematics},
  pages = {213--222},
  title = {Optimal computation of census functions in the Postal Model},
  volume = {58}
}
[J27] A. Bar-Noy, J. Bruck, C-T. Ho, S. Kipnis, and B. Schieber.
Computing global combine operations in the multi-port postal model. IEEE Trans. on Parallel and Distributed Systems, 6:896—900, 1995. 
@article{J27,
  author = {Bar-Noy, A. and J. Bruck and C-T. Ho and S. Kipnis and B. Schieber},
  year = {1995},
  journal = {IEEE Trans. on Parallel and Distributed Systems},
  pages = {896--900},
  title = {Computing global combine operations in the Multi-Port Postal Model},
  volume = {6}
}
[J26] A. Aggarwal, A. Bar-Noy, D. Kravets, S. Khuller, and B. Schieber.
Efficient minimum cost matching using the quadrangle inequality. Journal of Algorithms, 19:116—143, 1995. 
@article{J26,
  author = {A. Aggarwal and Bar-Noy, A. and D. Kravets and S. Khuller and B. Schieber},
  year = {1995},
  journal = {Journal of Algorithms},
  pages = {116--143},
  title = {Efficient minimum cost matching using the quadrangle inequality},
  volume = {19}
}
[J25] A. Borodin, S. Irani, P. Raghavan, and B. Schieber.
Competitive paging with locality of reference. Journal of Computer and System Sciences, 50:244—258, 1995. 
@article{J25,
  author = {A. Borodin and S. Irani and P. Raghavan and B. Schieber},
  year = {1995},
  journal = {Journal of Computer and System Sciences},
  pages = {244--258},
  title = {Competitive paging with locality of reference},
  volume = {50}
}
[J24] A. Aggarwal, B. Schieber, and T. Tokuyama.
Finding a minimum weight k -link path in graphs with monge property and applications. Journal of Discrete and Computational Geometry, 12:263—280, 1994. 
@article{J24,
  author = {A. Aggarwal and B. Schieber and T. Tokuyama},
  year = {1994},
  journal = {Journal of Discrete and Computational Geometry},
  pages = {263--280},
  title = {Finding a minimum weight $K\ $-link path in graphs with Monge property and applications},
  volume = {12}
}
[J23] B. Schieber and M. Snir.
Calling names on nameless networks. Information and Computation, 113:80—101, 1994. 
@article{J23,
  author = {B. Schieber and M. Snir},
  year = {1994},
  journal = {Information and Computation},
  pages = {80--101},
  title = {Calling names on nameless networks},
  volume = {113}
}
[J22] A. Fiat, Y. Rabani, Y. Ravid, and B. Schieber.
A deterministic o(k3) competitive k -server algorithm for the circle. Algorithmica, 11:572—578, 1994. 
@article{J22,
  author = {A. Fiat and Y. Rabani and Y. Ravid and B. Schieber},
  year = {1994},
  journal = {Algorithmica},
  pages = {572--578},
  title = {A deterministic $O(k{^3})$ competitive $k\ $-server algorithm for the circle},
  volume = {11}
}
[J21] A. Bar-Noy, S. Kipnis, and B. Schieber.
An optimal algorithm for computing census functions in message-passing systems. Parallel Processing Letters, 3:19—23, 1993. 
@article{J21,
  author = {Bar-Noy, A. and S. Kipnis and B. Schieber},
  year = {1993},
  journal = {Parallel Processing Letters},
  pages = {19--23},
  title = {An optimal algorithm for computing census functions in message-passing systems},
  volume = {3}
}
[J20] Y. Mansour, J.K. Park, B. Schieber, and S. Sen.
Improved selection in totally monotone arrays. International Journal of Computational Geometry and Applications, 3:115—132, 1993. 
@article{J20,
  author = {Y. Mansour and J.K. Park and B. Schieber and S. Sen},
  year = {1993},
  journal = {International Journal of Computational Geometry and Applications},
  pages = {115--132},
  title = {Improved selection in totally monotone arrays},
  volume = {3}
}
[J19] O. Berkman, B. Schieber, and U. Vishkin.
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. Journal of Algorithms, 14:344—370, 1993. 
@article{J19,
  author = {O. Berkman and B. Schieber and U. Vishkin},
  year = {1993},
  journal = {Journal of Algorithms},
  pages = {344--370},
  title = {Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values},
  volume = {14}
}
[J18] N.H. Bshouty, Y. Mansour, B. Schieber, and P. Tiwari.
Fast exponentiation using the truncation operation. Computational Complexity, 2:244—255, 1992. 
@article{J18,
  author = {N.H. Bshouty and Y. Mansour and B. Schieber and P. Tiwari},
  year = {1992},
  journal = {Computational Complexity},
  pages = {244--255},
  title = {Fast exponentiation using the truncation operation},
  volume = {2}
}
[J17] M.W. Bern, H.J. Karloff, P. Raghavan, and B. Schieber.
Fast approximation techniques and geometric embedding problems. Theoretical Computer Science, 106:265—281, 1992. 
@article{J17,
  author = {M.W. Bern and H.J. Karloff and P. Raghavan and B. Schieber},
  year = {1992},
  journal = {Theoretical Computer Science},
  pages = {265--281},
  title = {Fast approximation techniques and geometric embedding problems},
  volume = {106}
}
[J16] Y. Mansour and B. Schieber.
The intractability of bounded protocols for non-FIFO channels. Journal of the ACM, 39:783—799, 1992. 
@article{J16,
  author = {Y. Mansour and B. Schieber},
  year = {1992},
  journal = {Journal of the ACM},
  pages = {783--799},
  title = {The intractability of bounded protocols for non-{FIFO} channels},
  volume = {39}
}
[J15] S. Khuller and B. Schieber.
On independent spanning trees. Information Processing Letters, 42:321—323, 1992. 
@article{J15,
  author = {S. Khuller and B. Schieber},
  year = {1992},
  journal = {Information Processing Letters},
  pages = {321--323},
  title = {On independent spanning trees},
  volume = {42}
}
[J14] D. Gusfield, G.M. Landau, and B. Schieber.
An efficient algorithm for the all pairs suffix-prefix problem. Information Processing Letters, 41:181—185, 1992. 
@article{J14,
  author = {D. Gusfield and G.M. Landau and B. Schieber},
  year = {1992},
  journal = {Information Processing Letters},
  pages = {181--185},
  title = {An efficient algorithm for the all pairs Suffix-Prefix problem},
  volume = {41}
}
[J13] L.L. Larmore and B. Schieber.
On-line dynamic programming with applications to the prediction of RNA secondary structure. Journal of Algorithms, 12:490—515, 1991. 
@article{J13,
  author = {L.L. Larmore and B. Schieber},
  year = {1991},
  journal = {Journal of Algorithms},
  pages = {490--515},
  title = {On-line dynamic programming with applications to the prediction of {RNA} secondary structure},
  volume = {12}
}
[J12] Y. Mansour, B. Schieber, and P. Tiwari.
A lower bound for integer greatest common divisor computations. Journal of the ACM, 38:453—471, 1991. 
@article{J12,
  author = {Y. Mansour and B. Schieber and P. Tiwari},
  year = {1991},
  journal = {Journal of the ACM},
  pages = {453--471},
  title = {A lower bound for integer greatest common divisor computations},
  volume = {38}
}
[J11] P.K. Agarwal, A. Aggarwal, B. Aronov, S.R. Kosaraju, B. Schieber, and S. Suri.
Computing external farthest neighbors for a simple polygon. Discrete Applied Mathematics, 31:97—111, 1991. 
@article{J11,
  author = {P.K. Agarwal and A. Aggarwal and B. Aronov and S.R. Kosaraju and B. Schieber and S. Suri},
  year = {1991},
  journal = {Discrete Applied Mathematics},
  pages = {97--111},
  title = {Computing external farthest neighbors for a simple polygon},
  volume = {31}
}
[J10] S. Khuller and B. Schieber.
Efficient parallel algorithms for testing connectivity and finding disjoint s -t paths in graphs. SIAM Journal on Computing, 20:352—375, 1991. 
@article{J10,
  author = {S. Khuller and B. Schieber},
  year = {1991},
  journal = {SIAM Journal on Computing},
  pages = {352--375},
  title = {Efficient parallel algorithms for testing connectivity and finding disjoint $s\ -t$ paths in graphs},
  volume = {20}
}
[J9] Y. Mansour, B. Schieber, and P. Tiwari.
Lower bounds for computations with the floor operation. SIAM Journal on Computing, 20:315—327, 1991. 
@article{J9,
  author = {Y. Mansour and B. Schieber and P. Tiwari},
  year = {1991},
  journal = {SIAM Journal on Computing},
  pages = {315--327},
  title = {Lower bounds for computations with the floor operation},
  volume = {20}
}
[J8] B. Schieber and U. Vishkin.
Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics, 29:97—111, 1990. 
@article{J8,
  author = {B. Schieber and U. Vishkin},
  year = {1990},
  journal = {Discrete Applied Mathematics},
  pages = {97--111},
  title = {Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm},
  volume = {29}
}
[J7] Y. Afek, G.M. Landau, B. Schieber, and M. Yung.
The power of multimedia: combining point-to-point and multiaccess networks. Information and Computation, 84:97—118, 1990. 
@article{J7,
  author = {Y. Afek and G.M. Landau  and B. Schieber and M. Yung},
  year = {1990},
  journal = {Information and Computation},
  pages = {97--118},
  title = {The power of multimedia: combining point-to-point and multiaccess networks},
  volume = {84}
}
[J6] Y. Mansour and B. Schieber.
Finding the edge connectivity of directed graphs. Journal of Algorithms, 10:76—85, 1989. 
@article{J6,
  author = {Y. Mansour and B. Schieber},
  year = {1989},
  journal = {Journal of Algorithms},
  pages = {76--85},
  title = {Finding the edge connectivity of directed graphs},
  volume = {10}
}
[J5] B. Schieber and S. Moran.
Parallel algorithms for maximum bipartite matchings and maximum 0-1 flows. Journal of Parallel and Distributed Computing, 6:20—38, 1989. 
@article{J5,
  author = {B. Schieber and S. Moran},
  year = {1989},
  journal = {Journal of Parallel and Distributed Computing},
  pages = {20--38},
  title = {Parallel algorithms for maximum bipartite matchings and maximum $0-1$ flows},
  volume = {6}
}
[J4] B. Schieber and U. Vishkin.
On finding lowest common ancestors: simplification and parallelization. SIAM Journal on Computing, 17:1253—1262, 1988. 
@article{J4,
  author = {B. Schieber and U. Vishkin},
  year = {1988},
  journal = {SIAM Journal on Computing},
  pages = {1253--1262},
  title = {On finding lowest common ancestors: simplification and parallelization},
  volume = {17}
}
[J3] Z. Galil and B. Schieber.
On finding most uniform trees (a note). Discrete Applied Mathematics, 20:173—175, 1988. 
@article{J3,
  author = {Z. Galil and B. Schieber},
  year = {1988},
  journal = {Discrete Applied Mathematics},
  pages = {173--175},
  title = {On finding most uniform trees (a note)},
  volume = {20}
}
[J2] A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber, and U. Vishkin.
Parallel construction of a suffix tree with applications. Algorithmica, 3:347—365, 1988. 
@article{J2,
  author = {A. Apostolico and C. Iliopoulos and G.M. Landau  and B. Schieber and U. Vishkin},
  year = {1988},
  journal = {Algorithmica},
  pages = {347--365},
  title = {Parallel construction of a suffix tree with applications},
  volume = {3}
}
[J1] Y. Maon, B. Schieber, and U. Vishkin.
Parallel ear decomposition search (EDS) and st -numbering in graphs. Theoretical Computer Science, 47:277—298, 1986. 
@article{J1,
  author = {Y. Maon and B. Schieber and U. Vishkin},
  year = {1986},
  journal = {Theoretical Computer Science},
  pages = {277--298},
  title = {Parallel Ear Decomposition Search ({EDS}) and $st\ $-numbering in graphs},
  volume = {47}
}

Conference papers

[C88] S. Dolev, K. Kumari, S. Mehrotra, B. Schieber, and S. Sharma.
Brief Announcement: Make Master Private-Keys Secure by Keeping It Public. In Proc. Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science 14931, Springer Nature Switzerland , pages 338—343, 2024. 
@inproceedings{C88,
  author = {S. Dolev and K. Kumari and S. Mehrotra and B. Schieber and S. Sharma},
  booktitle = {Proc. Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science 14931},
  publisher = {Springer Nature Switzerland},
  year = {2024},
  pages = {1199--1210},
  title = {Brief Announcement: Make Master Private-Keys Secure by Keeping It Public}
}
[C87] B. Schieber.
Brief Announcement: Towards Proportionate Fair Assignment. In Proc. Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science 14931, Springer Nature Switzerland , pages 255—259, 2024. 
@inproceedings{C87,
  author = {B. Schieber},
  booktitle = {Proc. Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science 14931},
  publisher = {Springer Nature Switzerland},
  year = {2024},
  pages = {255--259},
  title = {Brief Announcement: Towards Proportionate Fair Assignment}
}
[C86] Y. Dinitz, S. Dolev, M. Kumar, and B. Schieber.
Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. In Proc. Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science 14931, Springer Nature Switzerland , pages 255—259, 2024. 
@inproceedings{C86,
  author = {Y. Dinitz and S. Dolev and M. Kumar and B. Schieber},
  booktitle = {Proc. Stabilization, Safety, and Security of Distributed Systems (SSS), Lecture Notes in Computer Science 14931},
  publisher = {Springer Nature Switzerland},
  year = {2024},
  pages = {255--259},
  title = {Partially Disjoint Shortest Paths and Near-Shortest Paths Trees}
}
[C85] M.M. Isalm, S. Vahidi, B. Schieber, and S. Basu Roy.
Promoting Fairness and Priority in Selecting k-Winners Using IRV. In Proc. 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) , pages 1199—1210, 2024. 
@inproceedings{C85,
  author = {M.M. Islam and S. Vahidi and B. Schieber and S. Basu Roy},
  booktitle = {Proc. 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)},
  year = {2024},
  pages = {1199--1210},
  title = {Promoting Fairness and Priority in Selecting $k$-Winners Using IRV}
}
[C84] I. Doron-Arad, G. Kortsarz, J. Naor, B. Schieber, and H.  Shachnai.
Approximations and Hardness of Packing Partially Ordered Items. In Proc. 50th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG) , 2024. 
@inproceedings{C84,
  author = {I. Doron-Arad and G. Kortsarz and J. Naor and B. Schieber and H. Shachnai},
  booktitle = {Proc. 50th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
  year = {2024},
  title = {Approximations and Hardness of Packing Partially Ordered Items}
}
[C83] S. Vahidi, B. Schieber, Z. Du, and David A. Bader.
Parallel Longest Common SubSequence Analysis in Chapel. In Proc. IEEE High Performance Extreme Computing Conference (HPEC) , pages 1—6, 2023. 
@inproceedings{C83,
  author = {S. Vahidi and B. Schieber and Z. Du and David A. Bader},
  booktitle = {Proc. IEEE High Performance Extreme Computing Conference (HPEC)},
  year = {2023},
  pages = {1--6},
  title = {Parallel Longest Common Sub{S}equence Analysis in Chapel}
}
[C82] B. Schieber and S. Vahidi.
Approximating Connected Maximum Cuts via Local Search. In Proc. European Symposium on Algorithms (ESA) , pages 93:1—93:17, 2023. 
@inproceedings{C82,
  author = {B. Schieber and S. Vahidi},
  booktitle = {Proc. European Symposium on Algorithms (ESA)},
  year = {2023},
  pages = {93:1--93:17},
  title = {Approximating Connected Maximum Cuts via Local Search}
}
[C81] B. Schieber and P. Sitaraman.
Quick Minimization of Tardy Processing Time on a Single Machine. In Proc. 18th Algorithms and Data Structures Symposium (WADS) , pages 637—643, 2023. 
@inproceedings{C81,
  author = {B. Schieber and P. Sitaraman},
  booktitle = {Proc. 18th Algorithms and Data Structures Symposium (WADS)},
  year = {2023},
  pages = {637--643},
  title = {Quick Minimization of Tardy Processing Time on a Single Machine}
}
[C80] B. Schieber, B. Samineni, and S. Vahidi.
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. In Proc. 17th Int. Conference and Workshops on Algorithms and Computation (WALCOM) , pages 305—316, 2023. 
@inproceedings{C80,
  author = {B. Schieber and B. Samineni and S. Vahidi},
  booktitle = {Proc. 17th Int. Conference and Workshops on Algorithms and Computation (WALCOM)},
  year = {2023},
  pages = {305--316},
  title = {Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput}
}
[C79] M.M. Isalm, D. Wei, B. Schieber, and S. Basu Roy.
Satisfying Complex Top-k Fairness Constraints by Preference Substitutions. In Proc. VLDB Endowment , pages 16(2):317—329, 2022. 
@inproceedings{C79,
  author = {M.M. Isalm and D. Wei and B. Schieber and S. {Basu Roy}},
  booktitle = {Proc. VLDB Endowment},
  year = {2022},
  pages = {317--329},
  title = {Satisfying Complex Top-$k$ Fairness Constraints by Preference Substitutions},
  volume = {16},
  number = {2}
}
[C78] D. Wei, M.M. Isalm, B. Schieber, and S. Basu Roy.
Rank aggregation with proportionate fairness. In Proc. International Conference on Management of Data (SIGMOD), pages 262—275, 2022. 
@inproceedings{C78,
  author = {D. Wei and M.M. Isalm and B. Schieber and S. {Basu Roy}},
  booktitle = {Proc. International Conference on Management of Data (SIGMOD)},
  year = {2022},
  pages = {262--275},
  title = {Rank Aggregation with Proportionate Fairness}
}
[C77] L. Ben Yamin, J. Li, K.K. Sarpatwar, B. Schieber, and H. Shachnai.
Maximizing throughput in flow shop real-time scheduling. In Proc. 23rd Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 48:1—48:18, 2020. 
@inproceedings{C77,
  author = {L. {Ben Yamin} and J. Li and K.K. Sarpatwar and B. Schieber and H. Shachnai},
  booktitle = {Proc. 23rd Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)},
  year = {2020},
  pages = {48:1--48:18},
  title = {Maximizing Throughput in Flow Shop Real-Time Scheduling}
}
[C76] K.K. Sarpatwar, B. Schieber, and H. Shachnai.
The preemptive resource allocation problem. In Proc. 39th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 26:1—26:15, 2019. 
@inproceedings{C76,
  author = {K.K. Sarpatwar and B. Schieber and H. Shachnai},
  booktitle = {Proc. 39th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)},
  year = {2019},
  pages = {26:1--26:15},
  title = {The Preemptive Resource Allocation Problem}
}
[C75] A. Kulik, K.K. Sarpatwar, B. Schieber, and H. Shachnai.
Generalized assignment via submodular optimization with reserved capacity. In Proc. 27th European Symp. on Algorithms (ESA), pages 69:1—69:15, 2019. 
@inproceedings{C75,
  author = {A. Kulik and K.K. Sarpatwar and B. Schieber and H. Shachnai},
  booktitle = {Proc. 27th European Symp. on Algorithms (ESA)},
  year = {2019},
  pages = {69:1--69:15},
  title = {Generalized Assignment via Submodular Optimization with Reserved Capacity}
}
[C74] A. Backurs, P. Indyk, K. Onak, B. Schieber, A. Vakilian, and T. Wagner.
Scalable fair clustering. In Proc. 36th Int. Conf. on Machine Learning (ICML), pages 405—413, 2019. 
@inproceedings{C74,
  author = {A. Backurs and P. Indyk and K. Onak and B. Schieber and A. Vakilian and T. Wagner},
  booktitle = {Proc. 36th Int. Conf. on Machine Learning (ICML)},
  year = {2019},
  pages = {405--413},
  title = {Scalable Fair Clustering}
}
[C73] S. Assadi, K. Onak, B. Schieber, and S. Solomon.
Fully dynamic maximal independent set with sublinear in n update time. In Proc. 30th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 1919—1936, 2019. 
@inproceedings{C73,
  author = {S. Assadi and K. Onak and B. Schieber and S. Solomon},
  booktitle = {Proc. 30th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {2019},
  pages = {1919--1936},
  title = {Fully Dynamic Maximal Independent Set with Sublinear in $n$ Update Time}
}
[C72] K.K. Sarpatwar, B. Schieber, and H. Shachnai.
Generalized assignment of time-sensitive item groups. In Proc. 21st Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 24:1—24:18, 2018. 
@inproceedings{C72,
  author = {K.K. Sarpatwar and B. Schieber and H. Shachnai},
  booktitle = {Proc. 21st Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)},
  year = {2018},
  pages = {24:1--24:18},
  title = {Generalized Assignment of Time-Sensitive Item Groups}
}
[C71] K. Onak, B. Schieber, S. Solomon, and N. Wein.
Fully dynamic mis in uniformly sparse graphs. In Proc. 45th Int. Colloq. on Automata Lang. and Prog. (ICALP), pages 92:1—92:14, 2018. 
@inproceedings{C71,
  author = {K. Onak and B. Schieber and S. Solomon and N. Wein},
  booktitle = {Proc. 45th Int. Colloq. on Automata Lang. and Prog. (ICALP)},
  year = {2018},
  pages = {92:1--92:14},
  title = {Fully Dynamic MIS in Uniformly Sparse Graphs}
}
[C70] K.K. Sarpatwar, B. Schieber, and H. Shachnai.
Brief announcement: Approximation algorithms for preemptive resource allocation. In Proc. 30th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 343—345, 2018. 
@inproceedings{C70,
  author = {K.K. Sarpatwar and B. Schieber and H. Shachnai},
  booktitle = {Proc. 30th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA)},
  year = {2018},
  pages = {343--345},
  title = {Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation}
}
[C69] S. Assadi, K. Onak, B. Schieber, and S. Solomon.
Fully dynamic maximal independent set with sublinear update time. In Proc. 50th ACM Symp. on Theory of Computing (STOC), pages 815—826, 2018. 
@inproceedings{C69,
  author = {S. Assadi and K. Onak and B. Schieber and S. Solomon},
  booktitle = {Proc. 50th ACM Symp. on Theory of Computing (STOC)},
  year = {2018},
  pages = {815--826},
  title = {Fully Dynamic Maximal Independent Set with Sublinear Update Time}
}
[C68] V. Austel, S. Dash, O. Gunluk, L. Horesh, L. Liberti, G. Nannicini, and B. Schieber.
Globally optimal symbolic regression. In Interpretable ML Symposium, NIPS, 2017. 
@inproceedings{C68,
  author = {V. Austel and S. Dash and O. Gunluk and L. Horesh and L. Liberti and G. Nannicini and B. Schieber},
  booktitle = {Interpretable ML Symposium, NIPS},
  year = {2017},
  title = {Globally Optimal Symbolic Regression}
}
[C67] D. Katz, B. Schieber, and H. Shachnai.
Brief announcement: Flexible resource allocation for clouds and all-optical networks. In Proc. 28th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 225—226, 2016. 
@inproceedings{C67,
  author = {D. Katz and B. Schieber and H. Shachnai},
  booktitle = {Proc. 28th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA)},
  year = {2016},
  pages = {225--226},
  title = {Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks}
}
[C66] S. Toubaline, C. D'Ambrosio, P-L. Poirion L. Liberti, B. Schieber, and H. Shachnai.
Complexité du problème power edge set. In Proc. 17th Congress of the French Operations Research and Decision-Aid Society (ROADEF), 2016. 
@inproceedings{C66,
  author = {S. Toubaline and D'Ambrosio, C. and L. Liberti, P-L. Poirion and B. Schieber and H. Shachnai},
  booktitle = {Proc. 17th Congress of the French Operations Research and Decision-Aid Society (ROADEF)},
  year = {2016},
  title = {Complexit\'{e} du Probl\`{e}me Power Edge Set}
}
[C65] V.T. Chakaravarthy, M. Kapralov, P. Murali, F. Petrini, X. Que, Y. Sabharwal, and B. Schieber.
Subgraph counting: Color coding beyond trees. In Proc. 30th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016. 
@inproceedings{C65,
  author = {V.T. Chakaravarthy and M. Kapralov and P. Murali and F. Petrini and X. Que and Y. Sabharwal and B. Schieber},
  booktitle = {Proc. 30th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
  year = {2016},
  title = {Subgraph Counting: Color Coding Beyond Trees}
}
[C64] B. Schieber, S. Albagli-Kim, H. Shachnai, and T. Tamir.
Real-time k -bounded preemptive scheduling. In Proc. 18th Workshop on Algorithm Engineering and Experimentation (ALENEX), 2016. 
@inproceedings{C64,
  author = {B. Schieber and Albagli-Kim, S. and H. Shachnai and T. Tamir},
  booktitle = {Proc. 18th Workshop on Algorithm Engineering and Experimentation (ALENEX)},
  year = {2016},
  title = {Real-Time $k\ $-Bounded Preemptive Scheduling}
}
[C63] V. Nagarajan, K.K. Sarpatwar, B. Schieber, H. Shachnai, and J.L. Wolf.
The container selection problem. In Proc. 18th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2015. 
@inproceedings{C63,
  author = {V. Nagarajan and K.K. Sarpatwar and B. Schieber and H. Shachnai and J.L. Wolf},
  booktitle = {Proc. 18th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)},
  year = {2015},
  title = {The Container Selection Problem}
}
[C62] A. Gupta, S. Kale, V. Nagarajan, R. Saket, and B. Schieber.
The approximability of the binary paintshop problem. In Proc. 16th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2013. 
@inproceedings{C62,
  author = {A. Gupta and S. Kale and V. Nagarajan and R. Saket and B. Schieber},
  booktitle = {Proc. 16th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)},
  year = {2013},
  title = {The Approximability of the Binary Paintshop Problem}
}
[C61] V. Nagarajan, B. Schieber, and H. Shachnai.
The euclidean k -supplier problem. In Proc. 16th Conf. on Integer Prog. and Combinatorial Optimization (IPCO), 2013. 
@inproceedings{C61,
  author = {V. Nagarajan and B. Schieber and H. Shachnai},
  booktitle = {Proc. 16th Conf. on Integer Prog. and Combinatorial Optimization (IPCO)},
  year = {2013},
  title = {The Euclidean $k\ $-Supplier Problem}
}
[C60] R. Adany, M. Feldman, E. Haramaty, R. Khandekar, B. Schieber, R. Schwartz, H. Shachnai, and T. Tamir.
All-or-nothing generalized assignment with application to scheduling advertising campaigns. In Proc. 16th Conf. on Integer Prog. and Combinatorial Optimization (IPCO), 2013. 
@inproceedings{C60,
  author = {R. Adany and M. Feldman and E. Haramaty and R. Khandekar and B. Schieber and R. Schwartz and H. Shachnai and T. Tamir},
  booktitle = {Proc. 16th Conf. on Integer Prog. and Combinatorial Optimization (IPCO)},
  year = {2013},
  title = {All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns}
}
[C59] R. Khandekar, B. Schieber, H. Shachnai, and T. Tamir.
Minimizing busy time in multiple machine real-time scheduling. In Proc. 30th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2010. 
@inproceedings{C59,
  author = {R. Khandekar and B. Schieber and H. Shachnai and T. Tamir},
  booktitle = {Proc. 30th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)},
  year = {2010},
  title = {Minimizing Busy Time in Multiple Machine Real-time Scheduling}
}
[C58] N. Bansal, H-L. Chan, R. Khandekar, K. Pruhs, B. Schieber, and C. Stein.
Non-preemptive min-sum scheduling with resource augmentation. In Proc. 48th Symp. on Foundations of Computer Science (FOCS), 2007. 
@inproceedings{C58,
  author = {N. Bansal and H-L. Chan and R. Khandekar and K. Pruhs and B. Schieber and C. Stein},
  booktitle = {Proc. 48th Symp. on Foundations of Computer Science (FOCS)},
  year = {2007},
  title = {Non-Preemptive Min-Sum Scheduling with Resource Augmentation}
}
[C57] N. Bansal, N. Chen, N. Cherniavsky, A. Rudra, B. Schieber, and M. Sviridenko.
Dynamic pricing for impatient bidders. In Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007. 
@inproceedings{C57,
  author = {N. Bansal and N. Chen and N. Cherniavsky and A. Rudra and B. Schieber and M. Sviridenko},
  booktitle = {Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {2007},
  title = {Dynamic Pricing for Impatient Bidders}
}
[C56] N. Bansal, D. Coppersmith, and B. Schieber.
Minimizing setup and beam-on times in radiation therapy. In Proc. 9th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2006. 
@inproceedings{C56,
  author = {N. Bansal and D. Coppersmith and B. Schieber},
  booktitle = {Proc. 9th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)},
  year = {2006},
  title = {Minimizing Setup and Beam-On Times in Radiation Therapy}
}
[C55] N. Bansal, A. Chakrabarti, A. Epstein, and B. Schieber.
A quasi-ptas for unsplittable flow on line graphs. In Proc. 38th ACM Symp. on Theory of Computing (STOC), pages 721—729, 2006. 
@inproceedings{C55,
  author = {N. Bansal and A. Chakrabarti and A. Epstein and B. Schieber},
  booktitle = {Proc. 38th ACM Symp. on Theory of Computing (STOC)},
  year = {2006},
  pages = {721--729},
  title = {A Quasi-PTAS for Unsplittable Flow on Line Graphs}
}
[C54] R. Bahtia, N. Immorlica, T. Kimbrel, V. Mirrokni, J. Naor, and B. Schieber.
Traffic engineering of data networks for management data. In Proc. 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 289—298, 2005. 
@inproceedings{C54,
  author = {R. Bahtia and N. Immorlica and T. Kimbrel and V. Mirrokni and J. Naor and B. Schieber},
  booktitle = {Proc. 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA)},
  year = {2005},
  pages = {289--298},
  title = {Traffic Engineering of Data Networks for Management Data}
}
[C53] N. Bansal, L. Fleischer, T. Kimbrel, M. Mahdian, B. Schieber, and M. Sviridenko.
Further improvements in competitive guarantees for QoS buffering. In Proc. 31st Int. Colloq. on Automata Lang. and Prog. (ICALP), 2004. 
@inproceedings{C53,
  author = {N. Bansal and L. Fleischer and T. Kimbrel and M. Mahdian and B. Schieber and M. Sviridenko},
  booktitle = {Proc. 31st Int. Colloq. on Automata Lang. and Prog. (ICALP)},
  year = {2004},
  title = {Further Improvements in Competitive Guarantees for {QoS} Buffering}
}
[C52] T. Kimbrel, B. Schieber, and M. Sviridenko.
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. In Proc. 15th ACM-SIAM Symp. On Descrete Algorithms (SODA), 2004. 
@inproceedings{C52,
  author = {T. Kimbrel and B. Schieber and M. Sviridenko},
  booktitle = {Proc. 15th ACM-SIAM Symp. On Descrete Algorithms (SODA)},
  year = {2004},
  title = {Minimizing migrations in fair multiprocessor scheduling of persistent tasks}
}
[C51] G.M. Landau, B. Schieber, and M. Ziv-Ukelson.
Sparse LCS common substring alignment. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching (CPM),, pages 225—236, 2003. 
@inproceedings{C51,
  author = {G.M. Landau and B. Schieber and Ziv-Ukelson, M.},
  booktitle = {Proc. 14th Annual Symposium on Combinatorial Pattern Matching (CPM),},
  year = {2003},
  pages = {225--236},
  title = {Sparse {LCS} Common Substring Alignment}
}
[C50] P. Baptiste and B. Schieber.
Scheduling tall/small microprocessor tasks with unit processing time to minimize maximum tardiness. In Proc. 8th Int. Workshop on Project Management and Scheduling, pages 55—58, 2002. 
@inproceedings{C50,
  author = {P. Baptiste and B. Schieber},
  booktitle = {Proc. 8th Int. Workshop on Project Management and Scheduling},
  year = {2002},
  pages = {55--58},
  title = {Scheduling tall/small microprocessor tasks with unit processing time to minimize maximum tardiness}
}
[C49] A. Bar-Noy, S. Guha, Y. Katz, J. Naor, B. Schieber, and H. Shachnai.
Throughput maximization of real-time scheduling with batching. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2002. 
@inproceedings{C49,
  author = {Bar-Noy, A. and S. Guha and Y. Katz and J. Naor and B. Schieber and H. Shachnai},
  booktitle = {Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {2002},
  title = {Throughput maximization of real-time scheduling with batching}
}
[C48] A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko.
Buffer overflow management in QoS switches. In Proc. 33rd ACM Symp. on Theory of Computing (STOC), pages 520—529, 2001. 
@inproceedings{C48,
  author = {A. Kesselman and Z. Lotker and Y. Mansour and Patt-Shamir, B. and B. Schieber and M. Sviridenko},
  booktitle = {Proc. 33rd ACM Symp. on Theory of Computing (STOC)},
  year = {2001},
  pages = {520--529},
  title = {Buffer overflow management in {QoS} switches}
}
[C47] T.S. Jayram, T. Kimbrel, R. Krauthgamer, B. Schieber, and M. Sviridenko.
Online server allocation in a server farm via benefit task systems. In Proc. 33rd ACM Symp. on Theory of Computing (STOC), pages 540—549, 2001. 
@inproceedings{C47,
  author = {T.S. Jayram and T. Kimbrel and R. Krauthgamer and B. Schieber and M. Sviridenko},
  booktitle = {Proc. 33rd ACM Symp. on Theory of Computing (STOC)},
  year = {2001},
  pages = {540--549},
  title = {Online server allocation in a server farm via benefit task systems}
}
[C46] A. Bar-Noy, J. Naor, and B. Schieber.
Pushing dependent data in clients-providers-servers systems. In Proc. 6th Int. Conf. on Mobile Computing and Networking (MOBICOM), 2000. 
@inproceedings{C46,
  author = {Bar-Noy, A. and J. Naor and B. Schieber},
  booktitle = {Proc. 6th Int. Conf. on Mobile Computing and Networking (MOBICOM)},
  year = {2000},
  title = {Pushing dependent data in clients-providers-servers systems}
}
[C45] A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber.
A unified approach to approximating resource allocation and scheduling. In Proc. 32nd ACM Symp. on Theory of Computing (STOC), pages 735—744, 2000. 
@inproceedings{C45,
  author = {Bar-Noy, A. and Bar-Yehuda, R. and A. Freund and J. Naor and B. Schieber},
  booktitle = {Proc. 32nd ACM Symp. on Theory of Computing (STOC)},
  year = {2000},
  pages = {735--744},
  title = {A unified approach to approximating resource allocation and scheduling}
}
[C44] G. Even, S. Guha, and B. Schieber.
Improved approximations of crossings in graph drawings. In Proc. 32nd ACM Symp. on Theory of Computing (STOC), pages 296—305, 2000. 
@inproceedings{C44,
  author = {G. Even and S. Guha and B. Schieber},
  booktitle = {Proc. 32nd ACM Symp. on Theory of Computing (STOC)},
  year = {2000},
  pages = {296--305},
  title = {Improved approximations of crossings in graph drawings}
}
[C43] M. Charikar, J. Naor, and B. Schieber.
Resource optimization in QoS multicast routing of real-time multimedia. In Proc. IEEE INFOCOM 2000, pages 1518—1527, 2000. 
@inproceedings{C43,
  author = {M. Charikar and J. Naor and B. Schieber},
  booktitle = {Proc. IEEE INFOCOM 2000},
  year = {2000},
  pages = {1518--1527},
  title = {Resource optimization in {QoS} multicast routing of real-time multimedia}
}
[C42] A. Bar-Noy, S. Guha, J. Naor, and B. Schieber.
Approximating the throughput of multiple machines under real-time scheduling. In Proc. 31st ACM Symp. on Theory of Computing (STOC), pages 622—631, 1999. 
@inproceedings{C42,
  author = {Bar-Noy, A. and S. Guha and J. Naor and B. Schieber},
  booktitle = {Proc. 31st ACM Symp. on Theory of Computing (STOC)},
  year = {1999},
  pages = {622--631},
  title = {Approximating the throughput of multiple machines under real-time scheduling}
}
[C41] S. Guha, A. Moss, J. Naor, and B. Schieber.
Efficient recovery from power outage. In Proc. 31st ACM Symp. on Theory of Computing (STOC), pages 574—582, 1999. 
@inproceedings{C41,
  author = {S. Guha and A. Moss and J. Naor and B. Schieber},
  booktitle = {Proc. 31st ACM Symp. on Theory of Computing (STOC)},
  year = {1999},
  pages = {574--582},
  title = {Efficient recovery from power outage}
}
[C40] A. Bar-Noy, Y. Mansour, and B. Schieber.
Competitive dynamic bandwidth allocation. In Proc. 17th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 31—39, 1998. 
@inproceedings{C40,
  author = {Bar-Noy, A. and Y. Mansour and B. Schieber},
  booktitle = {Proc. 17th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)},
  year = {1998},
  pages = {31--39},
  title = {Competitive dynamic bandwidth allocation}
}
[C39] A. Bar-Noy, S. Guha, J. Naor, and B. Schieber.
Multicasting in heterogeneous networks. In Proc. 30th ACM Symp. on Theory of Computing (STOC), pages 448—453, 1998. 
@inproceedings{C39,
  author = {Bar-Noy, A. and S. Guha and J. Naor and B. Schieber},
  booktitle = {Proc. 30th ACM Symp. on Theory of Computing (STOC)},
  year = {1998},
  pages = {448--453},
  title = {Multicasting in heterogeneous networks}
}
[C38] A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber.
Minimizing service and operation costs of periodic scheduling. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 11—20, 1998. 
@inproceedings{C38,
  author = {Bar-Noy, A. and R. Bhatia and J. Naor and B. Schieber},
  booktitle = {Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1998},
  pages = {11--20},
  title = {Minimizing service and operation costs of periodic scheduling}
}
[C37] G. Even, J. Naor, S. Rao, and B. Schieber.
Fast spreading metric based approximate graph partitioning algorithms. In Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 639—648, 1997. 
@inproceedings{C37,
  author = {G. Even and J. Naor and S. Rao and B. Schieber},
  booktitle = {Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1997},
  pages = {639--648},
  title = {Fast spreading metric based approximate graph partitioning algorithms}
}
[C36] A. Aggarwal, D. Coppersmith, S. Khanna, R. Motwani, and B. Schieber.
The angular-metric traveling salesman problem. In Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 221—229, 1997. 
@inproceedings{C36,
  author = {A. Aggarwal and D. Coppersmith and S. Khanna and R. Motwani and B. Schieber},
  booktitle = {Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1997},
  pages = {221--229},
  title = {The angular-metric traveling salesman problem}
}
[C35] G. Even, J. Naor, B. Schieber, and L. Zosin.
Approximating minimum subset feedback sets in undirected graphs with applications to multicuts. In Proc. 4th Israeli Symp. on Theory of Computing and Systems (ISTCS), pages 78—88, 1996. 
@inproceedings{C35,
  author = {G. Even and J. Naor and B. Schieber and L. Zosin},
  booktitle = {Proc. 4th Israeli Symp. on Theory of Computing and Systems (ISTCS)},
  year = {1996},
  pages = {78--88},
  title = {Approximating minimum subset feedback sets in undirected graphs with applications to multicuts}
}
[C34] G. Even, J. Naor, S. Rao, and B. Schieber.
Divide-and-conquer approximation algorithms via spreading metrics. In Proc. 36th Symp. on Foundations of Computer Science (FOCS), pages 62—71, 1995. 
@inproceedings{C34,
  author = {G. Even and J. Naor and S. Rao and B. Schieber},
  booktitle = {Proc. 36th Symp. on Foundations of Computer Science (FOCS)},
  year = {1995},
  pages = {62--71},
  title = {Divide-and-conquer approximation algorithms via spreading metrics}
}
[C33] G. Even, J. Naor, B. Schieber, and M. Sudan.
Approximating minimum feedback sets and multi-cuts in directed graphs. In Proc. 4th MPS Conf. on Integer Prog. and Combinatorial Optimization (IPCO), pages 14—28, 1995. 
@inproceedings{C33,
  author = {G. Even and J. Naor and B. Schieber and M. Sudan},
  booktitle = {Proc. 4th MPS Conf. on Integer Prog. and Combinatorial Optimization (IPCO)},
  year = {1995},
  pages = {14--28},
  title = {Approximating minimum feedback sets and multi-cuts in directed graphs}
}
[C32] A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber.
Bandwidth allocation with preemption. In Proc. 27th ACM Symp. On Theory of Computing (STOC), pages 616—625, 1995. 
@inproceedings{C32,
  author = {Bar-Noy, A. and R. Canetti and S. Kutten and Y. Mansour and B. Schieber},
  booktitle = {Proc. 27th ACM Symp. On Theory of Computing (STOC)},
  year = {1995},
  pages = {616--625},
  title = {Bandwidth allocation with preemption}
}
[C31] A. Bar-Noy, A. Mayer, B. Schieber, and M. Sudan.
Guaranteeing fair service to persistent dependent tasks. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 243—252, 1995. 
@inproceedings{C31,
  author = {Bar-Noy, A. and A. Mayer and B. Schieber and M. Sudan},
  booktitle = {Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1995},
  pages = {243--252},
  title = {Guaranteeing fair service to persistent dependent tasks}
}
[C30] B. Schieber.
Finding a minimum weight k -link path in graphs with the concave monge property. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 405—411, 1995. 
@inproceedings{C30,
  author = {B. Schieber},
  booktitle = {Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1995},
  pages = {405--411},
  title = {Finding a minimum weight $K\ $-link path in graphs with the concave Monge property}
}
[C29] A. Bar-Noy, S. Kipnis, and B. Schieber.
Optimal multiple message broadcasting in telephone-like communication systems. In Proc. 6th IEEE Symp. on Parallel and Distributed Processing (SPDP), pages 216—223, 1994. 
@inproceedings{C29,
  author = {Bar-Noy, A. and S. Kipnis and B. Schieber},
  booktitle = {Proc. 6th IEEE Symp. on Parallel and Distributed Processing (SPDP)},
  year = {1994},
  pages = {216--223},
  title = {Optimal multiple message broadcasting in telephone-like communication systems}
}
[C28] A. Bar-Noy, C-T. Ho J. Bruck, S. Kipnis, and B. Schieber.
Computing global combine operations in the multi-port postal model. In Proc. 5th IEEE Symp. on Parallel and Distributed Processing (SPDP), pages 336—343, 1993. 
@inproceedings{C28,
  author = {Bar-Noy, A. and J. Bruck, C-T. Ho and S. Kipnis and B. Schieber},
  booktitle = {Proc. 5th IEEE Symp. on Parallel and Distributed Processing (SPDP)},
  year = {1993},
  pages = {336--343},
  title = {Computing global combine operations in the Multi-Port Postal Model}
}
[C27] A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan.
Efficient routing and scheduling algorithms for optical networks. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 412—423, 1994. 
@inproceedings{C27,
  author = {A. Aggarwal and Bar-Noy, A. and D. Coppersmith and R. Ramaswami and B. Schieber and M. Sudan},
  booktitle = {Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1994},
  pages = {412--423},
  title = {Efficient routing and scheduling algorithms for optical networks}
}
[C26] A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki.
Fast deflection routing for packets and worms. In Proc. 12th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 75—86, 1993. 
@inproceedings{C26,
  author = {Bar-Noy, A. and P. Raghavan and B. Schieber and H. Tamaki},
  booktitle = {Proc. 12th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)},
  year = {1993},
  pages = {75--86},
  title = {Fast deflection routing for packets and worms}
}
[C25] A. Borodin, P. Raghavan, B. Schieber, and E. Upfal.
How much can hardware help routing? In Proc. 25th ACM Symp. on Theory of Computing (STOC), pages 573—582, 1993. 
@inproceedings{C25,
  author = {A. Borodin and P. Raghavan and B. Schieber and E. Upfal},
  booktitle = {Proc. 25th ACM Symp. on Theory of Computing (STOC)},
  year = {1993},
  pages = {573--582},
  title = {How much can hardware help routing?}
}
[C24] A. Aggarwal, B. Schieber, and T. Tokuyama.
Finding a minimum weight k -link path in graphs with monge property and applications. In Proc. 9th ACM Symp. on Computational Geometry, pages 189—197, 1993. 
@inproceedings{C24,
  author = {A. Aggarwal and B. Schieber and T. Tokuyama},
  booktitle = {Proc. 9th ACM Symp. on Computational Geometry},
  year = {1993},
  pages = {189--197},
  title = {Finding a minimum weight $K\ $-link path in graphs with Monge property and applications}
}
[C23] D. Coppersmith and B. Schieber.
Lower bounds on the depth of monotone arithmetic computations. In Proc. 33rd Symp. on Foundations of Computer Science (FOCS), pages 288—295, 1992. 
@inproceedings{C23,
  author = {D. Coppersmith and B. Schieber},
  booktitle = {Proc. 33rd Symp. on Foundations of Computer Science (FOCS)},
  year = {1992},
  pages = {288--295},
  title = {Lower bounds on the depth of monotone arithmetic computations}
}
[C22] A. Aggarwal, A. Bar-Noy, D. Kravets, S. Khuller, and B. Schieber.
Efficient minimum cost matching using quadrangle inequality. In Proc. 33rd Symp. on Foundations of Computer Science (FOCS), pages 583—592, 1992. 
@inproceedings{C22,
  author = {A. Aggarwal and Bar-Noy, A. and D. Kravets and S. Khuller and B. Schieber},
  booktitle = {Proc. 33rd Symp. on Foundations of Computer Science (FOCS)},
  year = {1992},
  pages = {583--592},
  title = {Efficient minimum cost matching using quadrangle inequality}
}
[C21] G. Barnes, J. Buss, W.L. Ruzzo, and B. Schieber.
A sub-linear space, polynomial time algorithm for directed s -t connectivity. In Proc. 7th Symp. on Structure in Complexity Theory, pages 27—33, 1992. 
@inproceedings{C21,
  author = {G. Barnes and J. Buss and W.L. Ruzzo and B. Schieber},
  booktitle = {Proc. 7th Symp. on Structure in Complexity Theory},
  year = {1992},
  pages = {27--33},
  title = {A sub-linear space, polynomial time algorithm for directed $s\ -t$ connectivity}
}
[C20] D. Gusfield, G.M. Landau, and B. Schieber.
An efficient algorithm for suffix-prefix matching. In R.M. Capocelli, A. De-Santis, and U. Vaccaro, editors, Proc. Sequences II: Methods in Communication, Security, and Computer Science, pages 218—224. Springer-Verlag, 1991. 
@inproceedings{C20,
  author = {D. Gusfield and G.M. Landau and B. Schieber},
  editor = {R.M. Capocelli and De-Santis, A. and U. Vaccaro},
  publisher = {Springer-Verlag},
  booktitle = {Proc. Sequences II: Methods in Communication, Security, and Computer Science},
  year = {1991},
  pages = {218--224},
  title = {An efficient algorithm for Suffix-Prefix matching}
}
[C19] Y. Mansour, J.K. Park, B. Schieber, and S. Sen.
Improved selection in totally monotone arrays. In S. Biswas and K.V. Nori, editors, Proc. 11th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTCS), number 590 in Lecture Notes in Computer Science, pages 347—359. Springer-Verlag, 1991. 
@inproceedings{C19,
  author = {Y. Mansour and J.K. Park and B. Schieber and S. Sen},
  editor = {S. Biswas and K.V. Nori},
  publisher = {Springer-Verlag},
  booktitle = {Proc. 11th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTCS)},
  year = {1991},
  number = {590},
  pages = {347--359},
  series = {Lecture Notes in Computer Science},
  title = {Improved selection in totally monotone arrays}
}
[C18] A. Borodin, S. Irani, P. Raghavan, and B. Schieber.
Competitive paging with locality of reference. In Proc. 23rd ACM Symp. on Theory of Computing (STOC), pages 249—259, 1991. 
@inproceedings{C18,
  author = {A. Borodin and S. Irani and P. Raghavan and B. Schieber},
  booktitle = {Proc. 23rd ACM Symp. on Theory of Computing (STOC)},
  year = {1991},
  pages = {249--259},
  title = {Competitive paging with locality of reference}
}
[C17] A. Blum, P. Raghavan, and B. Schieber.
Navigating in unfamiliar geometric terrain. In Proc. 23rd ACM Symp. on Theory of Computing (STOC), pages 494—504, 1991. 
@inproceedings{C17,
  author = {A. Blum and P. Raghavan and B. Schieber},
  booktitle = {Proc. 23rd ACM Symp. on Theory of Computing (STOC)},
  year = {1991},
  pages = {494--504},
  title = {Navigating in unfamiliar geometric terrain}
}
[C16] A. Bar-Noy and B. Schieber.
The Canadian traveler problem. In Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 261—270, 1991. 
@inproceedings{C16,
  author = {Bar-Noy, A. and B. Schieber},
  booktitle = {Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1991},
  pages = {261--270},
  title = {The {C}anadian traveler problem}
}
[C15] L.L. Larmore and B. Schieber.
On-line dynamic programming with applications to the prediction of RNA secondary structure. In Proc. 1st ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 503—512, 1990. 
@inproceedings{C15,
  author = {L.L. Larmore and B. Schieber},
  booktitle = {Proc. 1st ACM-SIAM Symp. on Discrete Algorithms (SODA)},
  year = {1990},
  pages = {503--512},
  title = {On-line dynamic programming with applications to the prediction of {RNA} secondary structure}
}
[C14] Y. Mansour, B. Schieber, and P. Tiwari.
The complexity of approximating the square root. In Proc. 30th Symp. on Foundations of Computer Science (FOCS), pages 325—330, 1989. 
@inproceedings{C14,
  author = {Y. Mansour and B. Schieber and P. Tiwari},
  booktitle = {Proc. 30th Symp. on Foundations of Computer Science (FOCS)},
  year = {1989},
  pages = {325--330},
  title = {The complexity of approximating the square root}
}
[C13] S. Khuller and B. Schieber.
Efficient parallel algorithms for testing connectivity and finding disjoint s -t paths in graphs. In Proc. 30th Symp. on Foundations of Computer Science (FOCS), pages 288—293, 1989. 
@inproceedings{C13,
  author = {S. Khuller and B. Schieber},
  booktitle = {Proc. 30th Symp. on Foundations of Computer Science (FOCS)},
  year = {1989},
  pages = {288--293},
  title = {Efficient parallel algorithms for testing connectivity and finding disjoint $s\ -t$ paths in graphs}
}
[C12] M.W. Bern, H.J. Karloff, P. Raghavan, and B. Schieber.
Fast approximation techniques and geometric embedding problems. In Proc. 5th ACM Symp. on Computational Geometry, pages 292—301, 1989. 
@inproceedings{C12,
  author = {M.W. Bern and H.J. Karloff and P. Raghavan and B. Schieber},
  booktitle = {Proc. 5th ACM Symp. on Computational Geometry},
  year = {1989},
  pages = {292--301},
  title = {Fast approximation techniques and geometric embedding problems}
}
[C11] Y. Mansour, B. Schieber, and P. Tiwari.
Lower bounds for computations with the floor operation. In Proc. 16th Int. Colloq. on Automata Lang. and Prog. (ICALP), pages 559—573, 1989. 
@inproceedings{C11,
  author = {Y. Mansour and B. Schieber and P. Tiwari},
  booktitle = {Proc. 16th Int. Colloq. on Automata Lang. and Prog. (ICALP)},
  year = {1989},
  pages = {559--573},
  title = {Lower bounds for computations with the floor operation}
}
[C10] P.K. Agarwal, A. Aggarwal, B. Aronov, S.R. Kosaraju, B. Schieber, and S. Suri.
Computing external-furthest neighbors for a simple polygon. In Proc. 1st Canadian Conf. on Computational Geometry, 1989. 
@inproceedings{C10,
  author = {P.K. Agarwal and A. Aggarwal and B. Aronov and S.R. Kosaraju and B. Schieber and S. Suri},
  booktitle = {Proc. 1st Canadian Conf. on Computational Geometry},
  year = {1989},
  title = {Computing external-furthest neighbors for a simple polygon}
}
[C9] B. Schieber and M. Snir.
Calling names on nameless networks. In Proc. 8th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 319—328, 1989. 
@inproceedings{C9,
  author = {B. Schieber and M. Snir},
  booktitle = {Proc. 8th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)},
  year = {1989},
  pages = {319--328},
  title = {Calling names on nameless networks}
}
[C8] Y. Mansour and B. Schieber.
The intractability of bounded protocols for non-FIFO channels. In Proc. 8th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 59—72, 1989. 
@inproceedings{C8,
  author = {Y. Mansour and B. Schieber},
  booktitle = {Proc. 8th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)},
  year = {1989},
  pages = {59--72},
  title = {The intractability of bounded protocols for non-{FIFO} channels}
}
[C7] O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin.
Highly parallelizable problems. In Proc. 21st ACM Symp. on Theory of Computing (STOC), pages 301—319, 1989. 
@inproceedings{C7,
  author = {O. Berkman and D. Breslauer and Z. Galil and B. Schieber and U. Vishkin},
  booktitle = {Proc. 21st ACM Symp. on Theory of Computing (STOC)},
  year = {1989},
  pages = {301--319},
  title = {Highly parallelizable problems}
}
[C6] Y. Mansour, B. Schieber, and P. Tiwari.
Lower bounds for integer greatest common divisor computations. In Proc. 29th Symp. on Foundations of Computer Science (FOCS), pages 54—63, 1988. 
@inproceedings{C6,
  author = {Y. Mansour and B. Schieber and P. Tiwari},
  booktitle = {Proc. 29th Symp. on Foundations of Computer Science (FOCS)},
  year = {1988},
  pages = {54--63},
  title = {Lower bounds for integer greatest common divisor computations}
}
[C5] Y. Afek, G.M. Landau, B. Schieber, and M. Yung.
The power of multimedia: combining point-to-point and multiaccess networks. In Proc. 7th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 90—104, 1988. 
@inproceedings{C5,
  author = {Y. Afek and G.M. Landau and B. Schieber and M. Yung},
  booktitle = {Proc. 7th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)},
  year = {1988},
  pages = {90--104},
  title = {The power of multimedia: combining point-to-point and multiaccess networks}
}
[C4] B. Schieber and U. Vishkin.
On finding lowest common ancestors: simplification and parallelization. In Proc. 3rd Aegean Workshop on Computing (AWOC), Lecture Notes in Computer Science 319, Springer-Verlag, pages 111—123, 1988. 
@inproceedings{C4,
  author = {B. Schieber and U. Vishkin},
  booktitle = {Proc. 3rd Aegean Workshop on Computing (AWOC), Lecture Notes in Computer Science 319, Springer-Verlag},
  year = {1988},
  pages = {111--123},
  title = {On finding lowest common ancestors: simplification and parallelization}
}
[C3] G.M. Landau, B. Schieber, and U. Vishkin.
Parallel construction of a suffix tree. In Proc. 14th Int. Colloq. on Automata Lang. and Prog. (ICALP), Lecture Notes in Computer Science 267, Springer-Verlag, pages 314—325, 1987. 
@inproceedings{C3,
  author = {G.M. Landau and B. Schieber and U. Vishkin},
  booktitle = {Proc. 14th Int. Colloq. on Automata Lang. and Prog. (ICALP), Lecture Notes in Computer Science 267, Springer-Verlag},
  year = {1987},
  pages = {314--325},
  title = {Parallel construction of a suffix tree}
}
[C2] Y. Maon, B. Schieber, and U. Vishkin.
Parallel ear decomposition search (EDS) and st -numbering in graphs. In Proc. 2nd Aegean Workshop on Computing (AWOC), number 227 in Lecture Notes in Computer Science, pages 34—45. Springer-Verlag, 1986. 
@inproceedings{C2,
  author = {Y. Maon and B. Schieber and U. Vishkin},
  publisher = {Springer-Verlag},
  booktitle = {Proc. 2nd Aegean Workshop on Computing (AWOC)},
  year = {1986},
  number = {227},
  pages = {34--45},
  series = {Lecture Notes in Computer Science},
  title = {Parallel Ear Decomposition Search ({EDS}) and $st\ $-numbering in graphs}
}
[C1] B. Schieber and S. Moran.
Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings. In Proc. 5th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 282—292, 1986. 
@inproceedings{C1,
  author = {B. Schieber and S. Moran},
  booktitle = {Proc. 5th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)},
  year = {1986},
  pages = {282--292},
  title = {Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings}
}

Book Chapters

[B1] B. Schieber.
Parallel lowest common ancestor computation. In J.H. Reif, editor, A Synthesis of Parallel Algorithms, chapter 6, pages 259—273. Morgan Kaufmann Publishers, 1 edition, 1994. 
@incollection{B1,
  author = {B. Schieber},
  editor = {J.H. Reif},
  publisher = {Morgan Kaufmann Publishers},
  booktitle = {A Synthesis of Parallel Algorithms},
  chapter = {6},
  year = {1994},
  edition = {1},
  pages = {259--273},
  title = {Parallel lowest common ancestor computation}
}