default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaruch Schieber
Person information
- affiliation: New Jersey Institute of Technology, Newark, NJ, USA
- affiliation (former): IBM Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j78]Senjuti Basu Roy, Baruch Schieber, Nimrod Talmon:
Fairness in Preference Queries: Social Choice Theories Meet Data Management. Proc. VLDB Endow. 17(12): 4225-4228 (2024)- [j77]Kanthi K. Sarpatwar
, Baruch Schieber, Hadas Shachnai:
The preemptive resource allocation problem. J. Sched. 27(1): 103-118 (2024) - [c87]Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch Schieber, Shantanu Sharma:
Reminisce for Securing Private-Keys in Public. CSCML 2024: 168-177 - [c86]Md Mouinul Islam, Soroush Vahidi, Baruch Schieber, Senjuti Basu Roy:
Promoting Fairness and Priority in Selecting k-Winners Using IRV. KDD 2024: 1199-1210 - [c85]Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber:
Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. SSS 2024: 240-254 - [c84]Baruch Schieber:
Brief Announcement: Towards Proportionate Fair Assignment. SSS 2024: 255-259 - [c83]Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch Schieber, Shantanu Sharma:
Brief Announcement: Make Master Private-Keys Secure by Keeping It Public. SSS 2024: 338-343 - [c82]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Covering and Packing Partially Ordered Items. WG 2024: 166-180 - [i15]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Packing Partially Ordered Items. CoRR abs/2403.01568 (2024) - [i14]Noga Alon, Baruch Schieber:
Optimal Preprocessing for Answering On-Line Product Queries. CoRR abs/2406.06321 (2024) - 2023
- [c81]Baruch Schieber, Soroush Vahidi:
Approximating Connected Maximum Cuts via Local Search. ESA 2023: 93:1-93:17 - [c80]Soroush Vahidi, Baruch Schieber, Zhihui Du, David A. Bader:
Parallel Longest Common SubSequence Analysis In Chapel. HPEC 2023: 1-6 - [c79]Baruch Schieber, Pranav Sitaraman:
Quick Minimization of Tardy Processing Time on a Single Machine. WADS 2023: 637-643 - [c78]Baruch Schieber, Bhargav Samineni, Soroush Vahidi:
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. WALCOM 2023: 305-316 - [e1]Shlomi Dolev, Baruch Schieber:
Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings. Lecture Notes in Computer Science 14310, Springer 2023, ISBN 978-3-031-44273-5 [contents] - [i13]Baruch Schieber, Pranav Sitaraman:
Quick Minimization of Tardy Processing Time on a Single Machine. CoRR abs/2301.05460 (2023) - [i12]Soroush Vahidi, Baruch Schieber, Zhihui Du, David A. Bader:
Parallel Longest Common SubSequence Analysis In Chapel. CoRR abs/2309.09072 (2023) - 2022
- [j76]Md Mouinul Islam, Dong Wei, Baruch Schieber, Senjuti Basu Roy:
Satisfying Complex Top-k Fairness Constraints by Preference Substitutions. Proc. VLDB Endow. 16(2): 317-329 (2022) - [c77]Dong Wei, Md Mouinul Islam, Baruch Schieber, Senjuti Basu Roy:
Rank Aggregation with Proportionate Fairness. SIGMOD Conference 2022: 262-275 - [i11]Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber:
Partially Disjoint k Shortest Paths. CoRR abs/2211.03335 (2022) - [i10]Baruch Schieber, Bhargav Samineni, Soroush Vahidi:
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. CoRR abs/2212.07002 (2022) - 2020
- [j75]Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. Math. Oper. Res. 45(1): 1-14 (2020) - [j74]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms 16(2): 26:1-26:19 (2020) - [c76]Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM 2020: 48:1-48:18
2010 – 2019
- 2019
- [j73]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Flexible Resource Allocation to Interval Jobs. Algorithmica 81(8): 3217-3244 (2019) - [j72]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47(1): 1-6 (2019) - [c75]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA 2019: 69:1-69:15 - [c74]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. FSTTCS 2019: 26:1-26:15 - [c73]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413 - [c72]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA 2019: 1919-1936 - [i9]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019) - [i8]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR abs/1907.01745 (2019) - 2018
- [j71]Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica 80(2): 576-607 (2018) - [j70]Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - [c71]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM 2018: 24:1-24:18 - [c70]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP 2018: 92:1-92:14 - [c69]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA 2018: 343-345 - [c68]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully dynamic maximal independent set with sublinear update time. STOC 2018: 815-826 - [i7]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR abs/1802.09709 (2018) - [i6]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR abs/1806.10051 (2018) - [i5]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR abs/1808.10316 (2018) - [i4]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. CoRR abs/1811.07413 (2018) - 2017
- [i3]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained Submodular Maximization via Greedy Local Search. CoRR abs/1705.06319 (2017) - 2016
- [j69]Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir:
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12(3): 38:1-38:25 (2016) - [c67]Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-Time k-bounded Preemptive Scheduling. ALENEX 2016: 127-137 - [c66]Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali, Fabrizio Petrini, Xinyu Que, Yogish Sabharwal, Baruch Schieber:
Subgraph Counting: Color Coding Beyond Trees. IPDPS 2016: 2-11 - [c65]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. SPAA 2016: 225-226 - [i2]Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali, Fabrizio Petrini, Xinyu Que, Yogish Sabharwal, Baruch Schieber:
Subgraph Counting: Color Coding Beyond Trees. CoRR abs/1602.04478 (2016) - [i1]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Flexible Resource Allocation for Clouds and All-Optical Networks. CoRR abs/1605.04982 (2016) - 2015
- [j68]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-time scheduling to minimize machine busy times. J. Sched. 18(6): 561-573 (2015) - [c64]Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf:
The Container Selection Problem. APPROX-RANDOM 2015: 416-434 - 2013
- [c63]Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber:
The Approximability of the Binary Paintshop Problem. APPROX-RANDOM 2013: 205-217 - [c62]Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir:
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24 - [c61]Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. IPCO 2013: 290-301 - 2011
- [j67]Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang:
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Algorithmica 60(2): 421-450 (2011) - 2010
- [j66]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. ACM Trans. Algorithms 6(2): 35:1-35:21 (2010) - [c60]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180
2000 – 2009
- 2009
- [j65]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5(2): 18:1-18:17 (2009) - 2008
- [j64]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber:
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. 42(1): 2-26 (2008) - [j63]Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko:
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4(3): 34:1-34:17 (2008) - 2007
- [j62]Baruch Schieber:
Preface. IBM J. Res. Dev. 51(3/4): 247-250 (2007) - [j61]Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz:
Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM J. Res. Dev. 51(3/4): 391-408 (2007) - [c59]Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber:
Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624 - [c58]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. SODA 2007: 726-735 - 2006
- [j60]Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. J. Sched. 9(4): 365-379 (2006) - [j59]Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin:
Vehicle Routing and Staffing for Sedan Service. Transp. Sci. 40(3): 313-326 (2006) - [c57]Nikhil Bansal, Don Coppersmith, Baruch Schieber:
Minimizing Setup and Beam-On Times in Radiation Therapy. APPROX-RANDOM 2006: 27-38 - [c56]Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber:
A quasi-PTAS for unsplittable flow on line graphs. STOC 2006: 721-729 - 2005
- [j58]Baruch Schieber, Daniel Geist, Ayal Zaks:
Computing the minimum DNF representation of Boolean functions defined by intervals. Discret. Appl. Math. 149(1-3): 154-173 (2005) - [c55]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber:
Traffic engineering of management flows by link augmentations on confluent trees. SPAA 2005: 289-298 - 2004
- [j57]Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko:
Buffer Overflow Management in QoS Switches. SIAM J. Comput. 33(3): 563-583 (2004) - [j56]Moses Charikar, Joseph Naor, Baruch Schieber:
Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. 12(2): 340-348 (2004) - [c54]Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 - [c53]Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. SODA 2004: 982-991 - 2003
- [j55]Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment. Inf. Process. Lett. 88(6): 259-270 (2003) - [j54]Philippe Baptiste, Baruch Schieber:
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Sched. 6(4): 395-404 (2003) - [j53]Amotz Bar-Noy, Joseph Naor, Baruch Schieber:
Pushing Dependent Data in Clients-Providers-Servers Systems. Wirel. Networks 9(5): 421-430 (2003) - [c52]Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment. CPM 2003: 225-236 - 2002
- [j52]Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber:
Minimizing Service and Operation Costs of Periodic Scheduling. Math. Oper. Res. 27(3): 518-544 (2002) - [j51]Guy Even, Sudipto Guha, Baruch Schieber:
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. SIAM J. Comput. 32(1): 231-252 (2002) - [c51]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. SODA 2002: 742-751 - 2001
- [j50]Alan J. Hoffman, Baruch Schieber:
The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discret. Appl. Math. 113(2-3): 275-284 (2001) - [j49]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. J. ACM 48(5): 1069-1090 (2001) - [j48]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SIAM J. Comput. 31(2): 331-352 (2001) - [c50]Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko:
Buffer overflow management in QoS switches. STOC 2001: 520-529 - [c49]T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko:
Online server allocation in a server farm via benefit task systems. STOC 2001: 540-549 - 2000
- [j47]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
Optimal multiple message broadcasting in telephone-like communication systems. Discret. Appl. Math. 100(1-2): 1-15 (2000) - [j46]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47(4): 585-616 (2000) - [j45]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Message Multicasting in Heterogeneous Networks. SIAM J. Comput. 30(2): 347-358 (2000) - [j44]Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM J. Discret. Math. 13(2): 255-267 (2000) - [c48]Moses Charikar, Joseph Naor, Baruch Schieber:
Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. INFOCOM 2000: 1518-1527 - [c47]Amotz Bar-Noy, Joseph Naor, Baruch Schieber:
Pushing dependent data in clients-providers-servers systems. MobiCom 2000: 222-230 - [c46]Guy Even, Sudipto Guha, Baruch Schieber:
Improved approximations of crossings in graph drawings. STOC 2000: 296-305 - [c45]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. STOC 2000: 735-744
1990 – 1999
- 1999
- [j43]Don Coppersmith, Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations. J. Complex. 15(1): 17-29 (1999) - [j42]Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth Allocation with Preemption. SIAM J. Comput. 28(5): 1806-1828 (1999) - [j41]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. 28(6): 2187-2214 (1999) - [j40]Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber:
The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. 29(3): 697-711 (1999) - [c44]Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber:
Efficient Recovery from Power Outage (Extended Abstract). STOC 1999: 574-582 - [c43]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC 1999: 622-631 - 1998
- [j39]Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan:
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica 20(2): 151-174 (1998) - [j38]Baruch Schieber:
Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property. J. Algorithms 29(2): 204-222 (1998) - [j37]Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan:
Guaranteeing Fair Service to Persistent Dependent Tasks. SIAM J. Comput. 27(4): 1168-1189 (1998) - [j36]Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SIAM J. Comput. 27(5): 1273-1282 (1998) - [c42]Amotz Bar-Noy, Yishay Mansour, Baruch Schieber:
Competitive Dynamic Bandwidth Allocation. PODC 1998: 31-39 - [c41]Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber:
Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). SODA 1998: 11-20 - [c40]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Multicasting in Heterogeneous Networks. STOC 1998: 448-453 - 1997
- [j35]Leizhen Cai, Baruch Schieber:
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. Discret. Appl. Math. 73(1): 27-34 (1997) - [j34]Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
A Tight Bound for Approximating the Square Root. Inf. Process. Lett. 63(4): 211-213 (1997) - [j33]Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal:
How much can hardware help routing? J. ACM 44(5): 726-741 (1997) - [j32]Avrim Blum, Prabhakar Raghavan, Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain. SIAM J. Comput. 26(1): 110-137 (1997) - [j31]Allan Borodin, Yuval Rabani, Baruch Schieber:
Deterministic Many-to-Many Hot Potato Routing. IEEE Trans. Parallel Distributed Syst. 8(6): 587-596 (1997) - [c39]Joseph Naor, Baruch Schieber:
Improved Approximations for Shallow-Light Spanning Trees. FOCS 1997: 536-541 - [c38]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Spreading Metric Based Graph Partitioning Algorithms. PP 1997 - [c37]Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber:
The Angular-Metric Traveling Salesman Problem. SODA 1997: 221-229 - [c36]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SODA 1997: 639-648 - 1996
- [j30]Omer Berkman, Baruch Schieber, Uzi Vishkin:
A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geom. Appl. 6(2): 231-242 (1996) - [j29]Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan:
Efficient Routing in Optical Networks. J. ACM 43(6): 973-1001 (1996) - [c35]Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. ISTCS 1996: 78-88 - 1995
- [j28]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
optimal Computation of Census Functions in the Postal Model. Discret. Appl. Math. 58(3): 213-222 (1995) - [j27]Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. J. Algorithms 19(1): 116-143 (1995) - [j26]Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference. J. Comput. Syst. Sci. 50(2): 244-258 (1995) - [j25]Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber:
Computing Global Combine Operations in the Multiport Postal Model. IEEE Trans. Parallel Distributed Syst. 6(8): 896-900 (1995) - [c34]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). FOCS 1995: 62-71 - [c33]Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan:
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. IPCO 1995: 14-28 - [c32]Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan:
Guaranteeing Fair Service to Persistent Dependent Tasks. SODA 1995: 243-252 - [c31]Baruch Schieber:
Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property. SODA 1995: 405-411 - [c30]Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber:
Bandwidth allocation with preemption. STOC 1995: 616-625 - 1994
- [j24]Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber:
A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. Algorithmica 11(6): 572-578 (1994) - [j23]Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. Discret. Comput. Geom. 12: 263-280 (1994) - [j22]Baruch Schieber, Marc Snir:
Calling Names on Nameless Networks. Inf. Comput. 113(1): 80-101 (1994) - [c29]Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan:
Efficient Routing and Scheduling Algorithms for Optical Networks. SODA 1994: 412-423 - [c28]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
Optimal multiple message broadcasting in telephone-like communication systems. SPDP 1994: 216-223 - 1993
- [j21]Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen:
Improved selection in totally monotone arrays. Int. J. Comput. Geom. Appl. 3(2): 115-132 (1993) - [j20]Omer Berkman, Baruch Schieber, Uzi Vishkin:
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms 14(3): 344-370 (1993) - [j19]Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
An Optimal Algorithm for computing Census Functions in Message-Passing Systems. Parallel Process. Lett. 3: 19-23 (1993) - [c27]Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. SCG 1993: 189-197 - [c26]Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki:
Fast Deflection Routing for Packets and Worms (Extended Summary). PODC 1993: 75-86 - [c25]Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber:
Computing Global Combine Operations in the Multi-Port Postal Model. SPDP 1993: 336-343 - [c24]Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal:
How much can hardware help routing? STOC 1993: 573-582 - 1992
- [j18]Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Fast Exponentiation Using the Truncation Operation. Comput. Complex. 2: 244-255 (1992) - [j17]Dan Gusfield, Gad M. Landau, Baruch Schieber:
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. Inf. Process. Lett. 41(4): 181-185 (1992) - [j16]Samir Khuller, Baruch Schieber:
On Independent Spanning Trees. Inf. Process. Lett. 42(6): 321-323 (1992) - [j15]Yishay Mansour, Baruch Schieber:
The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels. J. ACM 39(4): 783-799 (1992) - [j14]Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems. Theor. Comput. Sci. 106(2): 265-281 (1992) - [c23]Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SCT 1992: 27-33 - [c22]Don Coppersmith, Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary). FOCS 1992: 288-295 - [c21]Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
Efficient Minimum Cost Matching Using Quadrangle Inequality. FOCS 1992: 583-592 - 1991
- [j13]Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri:
Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. 31(2): 97-111 (1991) - [j12]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
A Lower Bound for Integer Greatest Common Divisor Computations. J. ACM 38(2): 453-471 (1991) - [j11]Lawrence L. Larmore, Baruch Schieber:
On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. J. Algorithms 12(3): 490-515 (1991) - [j10]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Lower Bounds for Computations with the Floor Operation. SIAM J. Comput. 20(2): 315-327 (1991) - [j9]Samir Khuller, Baruch Schieber:
Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs. SIAM J. Comput. 20(2): 352-375 (1991) - [c20]Avrim Blum, Prabhakar Raghavan, Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain (Extended Summary). On-Line Algorithms 1991: 151-156 - [c19]Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference (Brief Summary). On-Line Algorithms 1991: 167-168 - [c18]Yishay Mansour, James K. Park, Baruch Schieber:
Improved Selection on Totally Monotone Arrays. FSTTCS 1991: 347-359 - [c17]Amotz Bar-Noy, Baruch Schieber:
The Canadian Traveller Problem. SODA 1991: 261-270 - [c16]Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber:
Competitive Paging with Locality of Reference (Preliminary Version). STOC 1991: 249-259 - [c15]Avrim Blum, Prabhakar Raghavan, Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain (Preliminary Version). STOC 1991: 494-504 - 1990
- [j8]Baruch Schieber, Uzi Vishkin:
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. Discret. Appl. Math. 29(1): 97-111 (1990) - [j7]Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung:
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks. Inf. Comput. 84(1): 97-118 (1990) - [c14]Lawrence L. Larmore, Baruch Schieber:
On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. SODA 1990: 503-512
1980 – 1989
- 1989
- [j6]Yishay Mansour, Baruch Schieber:
Finding the Edge Connectivity of Directed Graphs. J. Algorithms 10(1): 76-85 (1989) - [j5]Baruch Schieber, Shlomo Moran:
Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. J. Parallel Distributed Comput. 6(1): 20-38 (1989) - [c13]Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems. SCG 1989: 292-301 - [c12]Samir Khuller, Baruch Schieber:
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary). FOCS 1989: 288-293 - [c11]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
The Complexity of Approximating the Square Root (Extended Summary). FOCS 1989: 325-330 - [c10]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Lower Bounds for Computations with the Floor Operation. ICALP 1989: 559-573 - [c9]Yishay Mansour, Baruch Schieber:
The Intractability of Bounded Protocols for Non-FIFO Channels. PODC 1989: 59-72 - [c8]Baruch Schieber:
Calling Names in Nameless Networks. PODC 1989: 319-328 - [c7]Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin:
Highly Parallelizable Problems (Extended Abstract). STOC 1989: 309-319 - 1988
- [j4]Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin:
Parallel Construction of a Suffix Tree with Applications. Algorithmica 3: 347-365 (1988) - [j3]Zvi Galil, Baruch Schieber:
On finding most uniform spanning trees. Discret. Appl. Math. 20(2): 173-175 (1988) - [j2]Baruch Schieber, Uzi Vishkin:
On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput. 17(6): 1253-1262 (1988) - [c6]Baruch Schieber, Uzi Vishkin:
On Finding Lowest Common Ancestors: Simplification and Parallelization. AWOC 1988: 111-123 - [c5]Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary). FOCS 1988: 54-63 - [c4]Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung:
The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. PODC 1988: 90-104 - 1987
- [b1]Baruch Schieber:
Design and analysis of some parallel algorithms. Tel Aviv University, Israel, 1987 - [c3]Gad M. Landau, Baruch Schieber, Uzi Vishkin:
Parallel Construction of a Suffix Tree (Extended Abstract). ICALP 1987: 314-325 - 1986
- [j1]Yael Maon, Baruch Schieber, Uzi Vishkin:
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. Theor. Comput. Sci. 47(3): 277-298 (1986) - [c2]Yael Maon, Baruch Schieber, Uzi Vishkin:
Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). Aegean Workshop on Computing 1986: 34-45 - [c1]Baruch Schieber, Shlomo Moran:
Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. PODC 1986: 282-292
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
