Baruch Schieber

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2013
56The Euclidean k-Supplier Problem. Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai. IPCO 2013, 290-301. Web SearchBibTeXDownload
55All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir. IPCO 2013, 13-24. Web SearchBibTeXDownload
2011
54Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Danny Z. Chen, Don Coppersmith, Xiaobo Sharon Hu, Chao Wang, Ewa Misiolek, Baruch Schieber, Chao Wang. Algorithmica (60): 421-450 (2011). Web SearchBibTeXDownload
2010
53Dynamic pricing for impatient bidders. Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
52Minimizing Busy Time in Multiple Machine Real-time Scheduling. Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir. FSTTCS 2010, 169-180. Web SearchBibTeXDownload
2009
51Throughput maximization of real-time scheduling with batching. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai. ACM Transactions on Algorithms (5) (2009). Cited by 25Web SearchBibTeXDownload
2008
50Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber. Theory Comput. Syst. (42): 2-26 (2008). Web SearchBibTeXDownload
2007
49Non-Preemptive Min-Sum Scheduling with Resource Augmentation. Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber. FOCS 2007, 614-624. Web SearchBibTeXDownload
48Dynamic pricing for impatient bidders. Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko. SODA 2007, 726-735. Web SearchBibTeXDownload
2006
47A quasi-PTAS for unsplittable flow on line graphs. Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber. STOC 2006, 721-729. Web SearchBibTeXDownload
2005
46Traffic engineering of management flows by link augmentations on confluent trees. Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber. SPAA 2005, 289-298. Web SearchBibTeXDownload
2004
45Further Improvements in Competitive Guarantees for QoS Buffering. Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko. ICALP 2004, 196-207. Web SearchBibTeXDownload
44Resource optimization in QoS multicast routing of real-time multimedia. Moses Charikar, Joseph Naor, Baruch Schieber. IEEE/ACM Trans. Netw. (12): 340-348 (2004). Web SearchBibTeXDownload
2003
43Sparse LCS Common Substring Alignment. Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson. CPM (88): 259-270 (2003). Web SearchBibTeXDownload
2002
42Minimizing Service and Operation Costs of Periodic Scheduling. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber. Math. Oper. Res. (27): 518-544 (2002). Web SearchBibTeXDownload
41Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. Guy Even, Sudipto Guha, Baruch Schieber. SIAM J. Comput. (32): 231-252 (2002). Web SearchBibTeXDownload
40Throughput maximization of real-time scheduling with batching. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai. SODA 2002, 742-751. Cited by 25Web SearchBibTeXDownload
2001
39Approximating the Throughput of Multiple Machines in Real-Time Scheduling. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. SIAM J. Comput. (31): 331-352 (2001). Cited by 2Web SearchBibTeXDownload
38Online server allocation in a server farm via benefit task systems. T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko. STOC 2001, 540-549. Web SearchBibTeXDownload
2000
37Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. Moses Charikar, Joseph Naor, Baruch Schieber. INFOCOM 2000, 1518-1527. Web SearchBibTeXDownload
36Message Multicasting in Heterogeneous Networks. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. SIAM J. Comput. (30): 347-358 (2000). Cited by 1Web SearchBibTeXDownload
35Improved approximations of crossings in graph drawings. Guy Even, Sudipto Guha, Baruch Schieber. STOC 2000, 296-305. Cited by 30Web SearchBibTeXDownload
1999
34The Angular-Metric Traveling Salesman Problem. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber. SIAM J. Comput. (29): 697-711 (1999). Cited by 24Web SearchBibTeXDownload
33Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. STOC 1999, 622-631. Cited by 99Web SearchBibTeXDownload
32Efficient Recovery from Power Outage (Extended Abstract). Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber. STOC 1999, 574-582. Cited by 12Web SearchBibTeXDownload
1998
31Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber. SODA 1998, 11-20. Web SearchBibTeXDownload
30Multicasting in Heterogeneous Networks. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber. STOC 1998, 448-453. Cited by 81Web SearchBibTeXDownload
1997
29Deterministic Many-to-Many Hot Potato Routing. Allan Borodin, Yuval Rabani, Baruch Schieber. IEEE Trans. Parallel Distrib. Syst. (8): 587-596 (1997). Web SearchBibTeXDownload
28How much can hardware help routing?. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal. J. ACM (44): 726-741 (1997). Cited by 35Web SearchBibTeXDownload
27Navigating in Unfamiliar Geometric Terrain. Avrim Blum, Prabhakar Raghavan, Baruch Schieber. SIAM J. Comput. (26): 110-137 (1997). Cited by 182Web SearchBibTeXDownload
26The Angular-Metric Traveling Salesman Problem. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber. SODA 1997, 221-229. Cited by 24Web SearchBibTeXDownload
1995
25Computing Global Combine Operations in the Multiport Postal Model. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber. IEEE Trans. Parallel Distrib. Syst. (6): 896-900 (1995). Cited by 25Web SearchBibTeXDownload
24Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber. J. Algorithms (19): 116-143 (1995). Web SearchBibTeXDownload
23Competitive Paging with Locality of Reference. Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber. J. Comput. Syst. Sci. (50): 244-258 (1995). Cited by 196Web SearchBibTeXDownload
1994
22Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama. Discrete & Computational Geometry (12): 263-280 (1994). Web SearchBibTeXDownload
21Calling Names on Nameless Networks. Baruch Schieber, Marc Snir. Inf. Comput. (113): 80-101 (1994). Web SearchBibTeXDownload
1993
20Fast Deflection Routing for Packets and Worms (Extended Summary). Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki. PODC 1993, 75-86. Cited by 64Web SearchBibTeXDownload
19Computing Global Combine Operations in the Multi-Port Postal Model. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber. SPDP 1993, 336-343. Web SearchBibTeX
18How much can hardware help routing?. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal. STOC 1993, 573-582. Cited by 35Web SearchBibTeXDownload
17Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama. Symposium on Computational Geometry 1993, 189-197. Web SearchBibTeXDownload
1992
16Efficient Minimum Cost Matching Using Quadrangle Inequality. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber. FOCS 1992, 583-592. Web SearchBibTeXDownload
15On Independent Spanning Trees. Samir Khuller, Baruch Schieber. Inf. Process. Lett. (42): 321-323 (1992). Web SearchBibTeXDownload
14An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. Dan Gusfield, Gad M. Landau, Baruch Schieber. Inf. Process. Lett. (41): 181-185 (1992). Web SearchBibTeXDownload
13Fast Geometric Approximation Techniques and Geometric Embedding Problems. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber. Theor. Comput. Sci. (106): 265-281 (1992). Cited by 25Web SearchBibTeXDownload
1991
12Computing external farthest neighbors for a simple polygon. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri. Discrete Applied Mathematics (31): 97-111 (1991). Web SearchBibTeXDownload
11Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs. Samir Khuller, Baruch Schieber. SIAM J. Comput. (20): 352-375 (1991). Web SearchBibTeXDownload
10Competitive Paging with Locality of Reference (Preliminary Version). Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber. STOC 1991, 249-259. Web SearchBibTeXDownload
9Navigating in Unfamiliar Geometric Terrain (Preliminary Version). Avrim Blum, Prabhakar Raghavan, Baruch Schieber. STOC 1991, 494-504. Web SearchBibTeXDownload
1990
8The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks. Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung. Inf. Comput. (84): 97-118 (1990). Web SearchBibTeXDownload
1989
7Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary). Samir Khuller, Baruch Schieber. FOCS 1989, 288-293. Web SearchBibTeXDownload
6Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. Baruch Schieber, Shlomo Moran. J. Parallel Distrib. Comput. (6): 20-38 (1989). Web SearchBibTeXDownload
5Fast Geometric Approximation Techniques and Geometric Embedding Problems. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber. Symposium on Computational Geometry 1989, 292-301. Cited by 25Web SearchBibTeXDownload
1988
4Parallel Construction of a Suffix Tree with Applications. Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin. Algorithmica (3): 347-365 (1988). Web SearchBibTeXDownload
3The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung. PODC 1988, 90-104. Web SearchBibTeXDownload
1987
2Parallel Construction of a Suffix Tree (Extended Abstract). Gad M. Landau, Baruch Schieber, Uzi Vishkin. ICALP 1987, 314-325. Web SearchBibTeXDownload
1986
1Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. Baruch Schieber, Shlomo Moran. PODC 1986, 282-292. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research