Baruch Schieber

186 papers A* 48A 4B 10C 5Journal 96Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Multi-Attribute Group Fairness in CoRR Thinh On, Senjuti Basu Roy, Baruch Schieber
2025	C	`conf`	Brief Announcement: The Steiner Shortest Path Tree Problem. SSS Omer Asher, Yefim Dinitz, Shlomi Dolev, Li-on Raviv, Baruch Schieber
2025	J	`jnl`	Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. Algorithmica Baruch Schieber, Bhargav Samineni, Soroush Vahidi
2025	J	`jnl`	The Steiner Shortest Path Tree Problem. CoRR Omer Asher, Yefim Dinitz, Shlomi Dolev, Li-on Raviv, Baruch Schieber
2024	B	`conf`	Approximations and Hardness of Covering and Packing Partially Ordered Items. WG Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024	J	`jnl`	Approximations and Hardness of Packing Partially Ordered Items. CoRR Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024	C	`conf`	Brief Announcement: Make Master Private-Keys Secure by Keeping It Public. SSS Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch Schieber, Shantanu Sharma
2024	C	`conf`	Brief Announcement: Towards Proportionate Fair Assignment. SSS Baruch Schieber
2024	J	`jnl`	Fairness in Preference Queries: Social Choice Theories Meet Data Management. Proc. VLDB Endow. Senjuti Basu Roy, Baruch Schieber, Nimrod Talmon
2024	J	`jnl`	Optimal Preprocessing for Answering On-Line Product Queries. CoRR Noga Alon, Baruch Schieber
2024	C	`conf`	Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. SSS Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber
2024	A*	`conf`	Promoting Fairness and Priority in Selecting KDD Md Mouinul Islam, Soroush Vahidi, Baruch Schieber, Senjuti Basu Roy
2024	—	`conf`	Reminisce for Securing Private-Keys in Public. CSCML Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch Schieber, Shantanu Sharma
2024	J	`jnl`	The preemptive resource allocation problem. J. Sched. Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2023	A	`conf`	Approximating Connected Maximum Cuts via Local Search. ESA Baruch Schieber, Soroush Vahidi
2023	B	`conf`	Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. WALCOM Baruch Schieber, Bhargav Samineni, Soroush Vahidi
2023	—	`conf`	Parallel Longest Common SubSequence Analysis In Chapel. HPEC Soroush Vahidi, Baruch Schieber, Zhihui Du, David A. Bader
2023	J	`jnl`	Parallel Longest Common SubSequence Analysis In Chapel. CoRR Soroush Vahidi, Baruch Schieber, Zhihui Du, David A. Bader
2023	B	`conf`	Quick Minimization of Tardy Processing Time on a Single Machine. WADS Baruch Schieber, Pranav Sitaraman
2023	J	`jnl`	Quick Minimization of Tardy Processing Time on a Single Machine. CoRR Baruch Schieber, Pranav Sitaraman
2023	C	`ed.`	Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings SSS Shlomi Dolev, Baruch Schieber
2022	J	`jnl`	Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. CoRR Baruch Schieber, Bhargav Samineni, Soroush Vahidi
2022	J	`jnl`	Partially Disjoint k Shortest Paths. CoRR Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber
2022	—	`conf`	Rank Aggregation with Proportionate Fairness. SIGMOD Conference Dong Wei, Md Mouinul Islam, Baruch Schieber, Senjuti Basu Roy
2022	J	`jnl`	Satisfying Complex Top-k Fairness Constraints by Preference Substitutions. Proc. VLDB Endow. Md Mouinul Islam, Dong Wei, Baruch Schieber, Senjuti Basu Roy
2020	J	`jnl`	Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2020	—	`conf`	Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2020	J	`jnl`	The Euclidean Math. Oper. Res. Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Constrained submodular maximization via greedy local search. Oper. Res. Lett. Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Flexible Resource Allocation to Interval Jobs. Algorithmica Dmitriy Katz, Baruch Schieber, Hadas Shachnai
2019	A*	`conf`	Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2019	A	`conf`	Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	A*	`conf`	Scalable Fair Clustering. ICML Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
2019	J	`jnl`	Scalable Fair Clustering. CoRR Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
2019	—	`conf`	The Preemptive Resource Allocation Problem. FSTTCS Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir
2018	B	`conf`	Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai
2018	A*	`conf`	Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2018	J	`jnl`	Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2018	J	`jnl`	Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	J	`jnl`	Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	A*	`conf`	Fully dynamic maximal independent set with sublinear update time. STOC Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	—	`conf`	Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	The Preemptive Resource Allocation Problem. CoRR Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2017	J	`jnl`	Constrained Submodular Maximization via Greedy Local Search. CoRR Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2016	J	`jnl`	All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
2016	B	`conf`	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. SPAA Dmitriy Katz, Baruch Schieber, Hadas Shachnai
2016	J	`jnl`	Flexible Resource Allocation for Clouds and All-Optical Networks. CoRR Dmitriy Katz, Baruch Schieber, Hadas Shachnai
2016	A	`conf`	Real-Time k-bounded Preemptive Scheduling. ALENEX Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir
2016	A	`conf`	Subgraph Counting: Color Coding Beyond Trees. IPDPS Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali, Fabrizio Petrini, Xinyu Que, Yogish Sabharwal, Baruch Schieber
2016	J	`jnl`	Subgraph Counting: Color Coding Beyond Trees. CoRR Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali, Fabrizio Petrini, Xinyu Que, Yogish Sabharwal, Baruch Schieber
2015	J	`jnl`	Real-time scheduling to minimize machine busy times. J. Sched. Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
2015	—	`conf`	The Container Selection Problem. APPROX-RANDOM Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf
2013	B	`conf`	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
2013	—	`conf`	The Approximability of the Binary Paintshop Problem. APPROX-RANDOM Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber
2013	B	`conf`	The Euclidean k-Supplier Problem. IPCO Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai
2011	J	`jnl`	Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Algorithmica Nikhil Bansal, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Baruch Schieber, Chao Wang
2010	J	`jnl`	Dynamic pricing for impatient bidders. ACM Trans. Algorithms Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
2010	—	`conf`	Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
2009	J	`jnl`	Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2008	J	`jnl`	Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko
2008	J	`jnl`	Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber
2007	A*	`conf`	Dynamic pricing for impatient bidders. SODA Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
2007	J	`jnl`	Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM J. Res. Dev. Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz
2007	A*	`conf`	Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber
2007	J	`jnl`	Preface. IBM J. Res. Dev. Baruch Schieber
2006	A*	`conf`	A quasi-PTAS for unsplittable flow on line graphs. STOC Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber
2006	—	`conf`	Minimizing Setup and Beam-On Times in Radiation Therapy. APPROX-RANDOM Nikhil Bansal, Don Coppersmith, Baruch Schieber
2006	J	`jnl`	Minimizing migrations in fair multiprocessor scheduling of persistent tasks. J. Sched. Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
2006	J	`jnl`	Vehicle Routing and Staffing for Sedan Service. Transp. Sci. Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin
2005	J	`jnl`	Computing the minimum DNF representation of Boolean functions defined by intervals. Discret. Appl. Math. Baruch Schieber, Daniel Geist, Ayal Zaks
2005	B	`conf`	Traffic engineering of management flows by link augmentations on confluent trees. SPAA Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber
2004	J	`jnl`	Buffer Overflow Management in QoS Switches. SIAM J. Comput. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
2004	A*	`conf`	Further Improvements in Competitive Guarantees for QoS Buffering. ICALP Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
2004	A*	`conf`	Minimizing migrations in fair multiprocessor scheduling of persistent tasks. SODA Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
2004	J	`jnl`	Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. Moses Charikar, Joseph Naor, Baruch Schieber
2003	J	`jnl`	A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Sched. Philippe Baptiste, Baruch Schieber
2003	J	`jnl`	Pushing Dependent Data in Clients-Providers-Servers Systems. Wirel. Networks Amotz Bar-Noy, Joseph Naor, Baruch Schieber
2003	B	`conf`	Sparse LCS Common Substring Alignment. CPM Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
2003	J	`jnl`	Sparse LCS Common Substring Alignment. Inf. Process. Lett. Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
2002	J	`jnl`	Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. SIAM J. Comput. Guy Even, Sudipto Guha, Baruch Schieber
2002	J	`jnl`	Minimizing Service and Operation Costs of Periodic Scheduling. Math. Oper. Res. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
2002	A*	`conf`	Throughput maximization of real-time scheduling with batching. SODA Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2001	J	`jnl`	A unified approach to approximating resource allocation and scheduling. J. ACM Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
2001	J	`jnl`	Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SIAM J. Comput. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
2001	A*	`conf`	Buffer overflow management in QoS switches. STOC Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
2001	A*	`conf`	Online server allocation in a server farm via benefit task systems. STOC T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko
2001	J	`jnl`	The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discret. Appl. Math. Alan J. Hoffman, Baruch Schieber
2000	A*	`conf`	A unified approach to approximating resource allocation and scheduling. STOC Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
2000	J	`jnl`	Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM J. Discret. Math. Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
2000	J	`jnl`	Divide-and-conquer approximation algorithms via spreading metrics. J. ACM Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
2000	A*	`conf`	Improved approximations of crossings in graph drawings. STOC Guy Even, Sudipto Guha, Baruch Schieber
2000	J	`jnl`	Message Multicasting in Heterogeneous Networks. SIAM J. Comput. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
2000	J	`jnl`	Optimal multiple message broadcasting in telephone-like communication systems. Discret. Appl. Math. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
2000	A*	`conf`	Pushing dependent data in clients-providers-servers systems. MobiCom Amotz Bar-Noy, Joseph Naor, Baruch Schieber
2000	A*	`conf`	Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. INFOCOM Moses Charikar, Joseph Naor, Baruch Schieber
1999	A*	`conf`	Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
1999	J	`jnl`	Bandwidth Allocation with Preemption. SIAM J. Comput. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
1999	A*	`conf`	Efficient Recovery from Power Outage (Extended Abstract). STOC Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber
1999	J	`jnl`	Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1999	J	`jnl`	Lower Bounds on the Depth of Monotone Arithmetic Computations. J. Complex. Don Coppersmith, Baruch Schieber
1999	J	`jnl`	The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
1998	J	`jnl`	A Sublinear Space, Polynomial Time Algorithm for Directed SIAM J. Comput. Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
1998	J	`jnl`	Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
1998	A*	`conf`	Competitive Dynamic Bandwidth Allocation. PODC Amotz Bar-Noy, Yishay Mansour, Baruch Schieber
1998	J	`jnl`	Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property. J. Algorithms Baruch Schieber
1998	J	`jnl`	Guaranteeing Fair Service to Persistent Dependent Tasks. SIAM J. Comput. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
1998	A*	`conf`	Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). SODA Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
1998	A*	`conf`	Multicasting in Heterogeneous Networks. STOC Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
1997	J	`jnl`	A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. Discret. Appl. Math. Leizhen Cai, Baruch Schieber
1997	J	`jnl`	A Tight Bound for Approximating the Square Root. Inf. Process. Lett. Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1997	J	`jnl`	Deterministic Many-to-Many Hot Potato Routing. IEEE Trans. Parallel Distributed Syst. Allan Borodin, Yuval Rabani, Baruch Schieber
1997	A*	`conf`	Fast Approximate Graph Partitioning Algorithms. SODA Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1997	J	`jnl`	How much can hardware help routing? J. ACM Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
1997	A*	`conf`	Improved Approximations for Shallow-Light Spanning Trees. FOCS Joseph Naor, Baruch Schieber
1997	J	`jnl`	Navigating in Unfamiliar Geometric Terrain. SIAM J. Comput. Avrim Blum, Prabhakar Raghavan, Baruch Schieber
1997	—	`conf`	Spreading Metric Based Graph Partitioning Algorithms. PP Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1997	A*	`conf`	The Angular-Metric Traveling Salesman Problem. SODA Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
1996	J	`jnl`	A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geom. Appl. Omer Berkman, Baruch Schieber, Uzi Vishkin
1996	—	`conf`	Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. ISTCS Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
1996	J	`jnl`	Efficient Routing in Optical Networks. J. ACM Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
1995	B	`conf`	Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. IPCO Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
1995	A*	`conf`	Bandwidth allocation with preemption. STOC Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
1995	J	`jnl`	Competitive Paging with Locality of Reference. J. Comput. Syst. Sci. Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber
1995	J	`jnl`	Computing Global Combine Operations in the Multiport Postal Model. IEEE Trans. Parallel Distributed Syst. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber
1995	A*	`conf`	Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property. SODA Baruch Schieber
1995	A*	`conf`	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). FOCS Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1995	J	`jnl`	Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. J. Algorithms Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
1995	A*	`conf`	Guaranteeing Fair Service to Persistent Dependent Tasks. SODA Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
1995	J	`jnl`	optimal Computation of Census Functions in the Postal Model. Discret. Appl. Math. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
1994	J	`jnl`	A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. Algorithmica Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber
1994	J	`jnl`	Calling Names on Nameless Networks Inf. Comput. Baruch Schieber, Marc Snir
1994	A*	`conf`	Efficient Routing and Scheduling Algorithms for Optical Networks. SODA Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
1994	J	`jnl`	Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. Discret. Comput. Geom. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama
1994	—	`conf`	Optimal multiple message broadcasting in telephone-like communication systems. SPDP Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
1993	J	`jnl`	An Optimal Algorithm for computing Census Functions in Message-Passing Systems. Parallel Process. Lett. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
1993	—	`conf`	Computing Global Combine Operations in the Multi-Port Postal Model. SPDP Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber
1993	A*	`conf`	Fast Deflection Routing for Packets and Worms (Extended Summary). PODC Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki
1993	—	`conf`	Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. SCG Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama
1993	A*	`conf`	How much can hardware help routing? STOC Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
1993	J	`jnl`	Improved selection in totally monotone arrays. Int. J. Comput. Geom. Appl. Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen
1993	J	`jnl`	Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms Omer Berkman, Baruch Schieber, Uzi Vishkin
1992	—	`conf`	A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity SCT Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
1992	J	`jnl`	An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. Inf. Process. Lett. Dan Gusfield, Gad M. Landau, Baruch Schieber
1992	A*	`conf`	Efficient Minimum Cost Matching Using Quadrangle Inequality FOCS Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
1992	J	`jnl`	Fast Exponentiation Using the Truncation Operation. Comput. Complex. Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1992	J	`jnl`	Fast Geometric Approximation Techniques and Geometric Embedding Problems. Theor. Comput. Sci. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
1992	A*	`conf`	Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) FOCS Don Coppersmith, Baruch Schieber
1992	J	`jnl`	On Independent Spanning Trees. Inf. Process. Lett. Samir Khuller, Baruch Schieber
1992	J	`jnl`	The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels. J. ACM Yishay Mansour, Baruch Schieber
1991	J	`jnl`	A Lower Bound for Integer Greatest Common Divisor Computations. J. ACM Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1991	—	`conf`	Competitive Paging with Locality of Reference (Brief Summary). On-Line Algorithms Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber
1991	A*	`conf`	Competitive Paging with Locality of Reference (Preliminary Version) STOC Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber
1991	J	`jnl`	Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri
1991	J	`jnl`	Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs. SIAM J. Comput. Samir Khuller, Baruch Schieber
1991	—	`conf`	Improved Selection on Totally Monotone Arrays. FSTTCS Yishay Mansour, James K. Park, Baruch Schieber
1991	J	`jnl`	Lower Bounds for Computations with the Floor Operation. SIAM J. Comput. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1991	—	`conf`	Navigating in Unfamiliar Geometric Terrain (Extended Summary). On-Line Algorithms Avrim Blum, Prabhakar Raghavan, Baruch Schieber
1991	A*	`conf`	Navigating in Unfamiliar Geometric Terrain (Preliminary Version) STOC Avrim Blum, Prabhakar Raghavan, Baruch Schieber
1991	J	`jnl`	On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. J. Algorithms Lawrence L. Larmore, Baruch Schieber
1991	A*	`conf`	The Canadian Traveller Problem. SODA Amotz Bar-Noy, Baruch Schieber
1990	J	`jnl`	Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. Discret. Appl. Math. Baruch Schieber, Uzi Vishkin
1990	A*	`conf`	On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. SODA Lawrence L. Larmore, Baruch Schieber
1990	J	`jnl`	The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks Inf. Comput. Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung
1989	A*	`conf`	Calling Names in Nameless Networks. PODC Baruch Schieber
1989	A*	`conf`	Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) FOCS Samir Khuller, Baruch Schieber
1989	—	`conf`	Fast Geometric Approximation Techniques and Geometric Embedding Problems. SCG Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
1989	J	`jnl`	Finding the Edge Connectivity of Directed Graphs. J. Algorithms Yishay Mansour, Baruch Schieber
1989	A*	`conf`	Highly Parallelizable Problems (Extended Abstract) STOC Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
1989	A*	`conf`	Lower Bounds for Computations with the Floor Operation. ICALP Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1989	J	`jnl`	Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. J. Parallel Distributed Comput. Baruch Schieber, Shlomo Moran
1989	A*	`conf`	The Complexity of Approximating the Square Root (Extended Summary) FOCS Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1989	A*	`conf`	The Intractability of Bounded Protocols for Non-FIFO Channels. PODC Yishay Mansour, Baruch Schieber
1988	A*	`conf`	Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary) FOCS Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1988	—	`conf`	On Finding Lowest Common Ancestors: Simplification and Parallelization. AWOC Baruch Schieber, Uzi Vishkin
1988	J	`jnl`	On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput. Baruch Schieber, Uzi Vishkin
1988	J	`jnl`	On finding most uniform spanning trees. Discret. Appl. Math. Zvi Galil, Baruch Schieber
1988	J	`jnl`	Parallel Construction of a Suffix Tree with Applications. Algorithmica Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin
1988	A*	`conf`	The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. PODC Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung
1987	—	`—`	Design and analysis of some parallel algorithms Baruch Schieber
1987	A*	`conf`	Parallel Construction of a Suffix Tree (Extended Abstract). ICALP Gad M. Landau, Baruch Schieber, Uzi Vishkin
1986	—	`conf`	Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). Aegean Workshop on Computing Yael Maon, Baruch Schieber, Uzi Vishkin
1986	J	`jnl`	Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. Theor. Comput. Sci. Yael Maon, Baruch Schieber, Uzi Vishkin
1986	A*	`conf`	Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. PODC Baruch Schieber, Shlomo Moran