 | 2009 |
|---|
| 121 |       | Amotz Bar-Noy,
Sudipto Guha,
Yoav Katz,
Joseph Naor,
Baruch Schieber,
Hadas Shachnai:
Throughput maximization of real-time scheduling with batching.
ACM Transactions on Algorithms 5(2): (2009) |
| 2008 |
|---|
| 120 | | 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 Transactions on Algorithms 4(3): (2008) |
| 119 | | 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) |
| 2007 |
|---|
| 118 | | 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 |
| 117 | | Nikhil Bansal,
Ning Chen,
Neva Cherniavsky,
Atri Rudra,
Baruch Schieber,
Maxim Sviridenko:
Dynamic pricing for impatient bidders.
SODA 2007: 726-735 |
| 116 | | Baruch Schieber:
Preface.
IBM Journal of Research and Development 51(3/4): 247-250 (2007) |
| 115 | | 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 Journal of Research and Development 51(3/4): 391-408 (2007) |
| 2006 |
|---|
| 114 | | Nikhil Bansal,
Don Coppersmith,
Baruch Schieber:
Minimizing Setup and Beam-On Times in Radiation Therapy.
APPROX-RANDOM 2006: 27-38 |
| 113 | | Nikhil Bansal,
Amit Chakrabarti,
Amir Epstein,
Baruch Schieber:
A quasi-PTAS for unsplittable flow on line graphs.
STOC 2006: 721-729 |
| 112 | | Tracy Kimbrel,
Baruch Schieber,
Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
J. Scheduling 9(4): 365-379 (2006) |
| 111 | | Oktay Günlük,
Tracy Kimbrel,
Laszlo Ladányi,
Baruch Schieber,
Gregory B. Sorkin:
Vehicle Routing and Staffing for Sedan Service.
Transportation Science 40(3): 313-326 (2006) |
| 2005 |
|---|
| 110 | | 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 |
| 109 | | Baruch Schieber,
Daniel Geist,
Ayal Zaks:
Computing the minimum DNF representation of Boolean functions defined by intervals.
Discrete Applied Mathematics 149(1-3): 154-173 (2005) |
| 2004 |
|---|
| 108 | | Nikhil Bansal,
Lisa Fleischer,
Tracy Kimbrel,
Mohammad Mahdian,
Baruch Schieber,
Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering.
ICALP 2004: 196-207 |
| 107 | | Tracy Kimbrel,
Baruch Schieber,
Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
SODA 2004: 982-991 |
| 106 | | 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) |
| 105 | | 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) |
| 2003 |
|---|
| 104 | | Gad M. Landau,
Baruch Schieber,
Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment.
CPM 2003: 225-236 |
| 103 | | Gad M. Landau,
Baruch Schieber,
Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment.
Inf. Process. Lett. 88(6): 259-270 (2003) |
| 102 |  | Philippe Baptiste,
Baruch Schieber:
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness.
J. Scheduling 6(4): 395-404 (2003) |
| 101 | | Amotz Bar-Noy,
Joseph Naor,
Baruch Schieber:
Pushing Dependent Data in Clients-Providers-Servers Systems.
Wireless Networks 9(5): 421-430 (2003) |
| 2002 |
|---|
| 100 | | 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 |
| 99 | | 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) |
| 98 | | 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) |
| 2001 |
|---|
| 97 | | Alexander Kesselman,
Zvi Lotker,
Yishay Mansour,
Boaz Patt-Shamir,
Baruch Schieber,
Maxim Sviridenko:
Buffer overflow management in QoS switches.
STOC 2001: 520-529 |
| 96 | | 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 |
| 95 | | Alan J. Hoffman,
Baruch Schieber:
The edge versus path incidence matrix of series-parallel graphs and greedy packing.
Discrete Applied Mathematics 113(2-3): 275-284 (2001) |
| 94 | | 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) |
| 93 | | 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) |
| 2000 |
|---|
| 92 | | Moses Charikar,
Joseph Naor,
Baruch Schieber:
Resource Optimization in QoS Multicast Routing of Real-Time Multimedia.
INFOCOM 2000: 1518-1527 |
| 91 | | Amotz Bar-Noy,
Joseph Naor,
Baruch Schieber:
Pushing dependent data in clients-providers-servers systems.
MOBICOM 2000: 222-230 |
| 90 | | Guy Even,
Sudipto Guha,
Baruch Schieber:
Improved approximations of crossings in graph drawings.
STOC 2000: 296-305 |
| 89 | | 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 |
| 88 | | Amotz Bar-Noy,
Shlomo Kipnis,
Baruch Schieber:
Optimal multiple message broadcasting in telephone-like communication systems.
Discrete Applied Mathematics 100(1-2): 1-15 (2000) |
| 87 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Divide-and-conquer approximation algorithms via spreading metrics.
J. ACM 47(4): 585-616 (2000) |
| 86 | | Amotz Bar-Noy,
Sudipto Guha,
Joseph Naor,
Baruch Schieber:
Message Multicasting in Heterogeneous Networks.
SIAM J. Comput. 30(2): 347-358 (2000) |
| 85 | | Guy Even,
Joseph Naor,
Baruch Schieber,
Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.
SIAM J. Discrete Math. 13(2): 255-267 (2000) |
| 1999 |
|---|
| 84 | | Sudipto Guha,
Anna Moss,
Joseph Naor,
Baruch Schieber:
Efficient Recovery from Power Outage (Extended Abstract).
STOC 1999: 574-582 |
| 83 | | Amotz Bar-Noy,
Sudipto Guha,
Joseph Naor,
Baruch Schieber:
Approximating the Throughput of Multiple Machines Under Real-Time Scheduling.
STOC 1999: 622-631 |
| 82 | | Don Coppersmith,
Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations.
J. Complexity 15(1): 17-29 (1999) |
| 81 | | Amotz Bar-Noy,
Ran Canetti,
Shay Kutten,
Yishay Mansour,
Baruch Schieber:
Bandwidth Allocation with Preemption.
SIAM J. Comput. 28(5): 1806-1828 (1999) |
| 80 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms.
SIAM J. Comput. 28(6): 2187-2214 (1999) |
| 79 | | Alok Aggarwal,
Don Coppersmith,
Sanjeev Khanna,
Rajeev Motwani,
Baruch Schieber:
The Angular-Metric Traveling Salesman Problem.
SIAM J. Comput. 29(3): 697-711 (1999) |
| 1998 |
|---|
| 78 | | Amotz Bar-Noy,
Yishay Mansour,
Baruch Schieber:
Competitive Dynamic Bandwidth Allocation.
PODC 1998: 31-39 |
| 77 | | Amotz Bar-Noy,
Randeep Bhatia,
Joseph Naor,
Baruch Schieber:
Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract).
SODA 1998: 11-20 |
| 76 | | Amotz Bar-Noy,
Sudipto Guha,
Joseph Naor,
Baruch Schieber:
Multicasting in Heterogeneous Networks.
STOC 1998: 448-453 |
| 75 | | Guy Even,
Joseph Naor,
Baruch Schieber,
Madhu Sudan:
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.
Algorithmica 20(2): 151-174 (1998) |
| 74 | | Baruch Schieber:
Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property.
J. Algorithms 29(2): 204-222 (1998) |
| 73 | | 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) |
| 72 | | 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) |
| 1997 |
|---|
| 71 | | Joseph Naor,
Baruch Schieber:
Improved Approximations for Shallow-Light Spanning Trees.
FOCS 1997: 536-541 |
| 70 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Spreading Metric Based Graph Partitioning Algorithms.
PPSC 1997 |
| 69 | | Alok Aggarwal,
Don Coppersmith,
Sanjeev Khanna,
Rajeev Motwani,
Baruch Schieber:
The Angular-Metric Traveling Salesman Problem.
SODA 1997: 221-229 |
| 68 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms.
SODA 1997: 639-648 |
| 67 | | Leizhen Cai,
Baruch Schieber:
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph.
Discrete Applied Mathematics 73(1): 27-34 (1997) |
| 66 | | Allan Borodin,
Yuval Rabani,
Baruch Schieber:
Deterministic Many-to-Many Hot Potato Routing.
IEEE Trans. Parallel Distrib. Syst. 8(6): 587-596 (1997) |
| 65 | | 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) |
| 64 | | Allan Borodin,
Prabhakar Raghavan,
Baruch Schieber,
Eli Upfal:
How much can hardware help routing?
J. ACM 44(5): 726-741 (1997) |
| 63 | | Avrim Blum,
Prabhakar Raghavan,
Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain.
SIAM J. Comput. 26(1): 110-137 (1997) |
| 1996 |
|---|
| 62 | | Guy Even,
Joseph Naor,
Baruch Schieber,
Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.
ISTCS 1996: 78-88 |
| 61 | | Omer Berkman,
Baruch Schieber,
Uzi Vishkin:
A fast parallel algorithm for finding the convex hull of a sorted point set.
Int. J. Comput. Geometry Appl. 6(2): 231-242 (1996) |
| 60 | | 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) |
| 1995 |
|---|
| 59 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
FOCS 1995: 62-71 |
| 58 | | Guy Even,
Joseph Naor,
Baruch Schieber,
Madhu Sudan:
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.
IPCO 1995: 14-28 |
| 57 | | Amotz Bar-Noy,
Alain J. Mayer,
Baruch Schieber,
Madhu Sudan:
Guaranteeing Fair Service to Persistent Dependent Tasks.
SODA 1995: 243-252 |
| 56 | | Baruch Schieber:
Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property.
SODA 1995: 405-411 |
| 55 | | Amotz Bar-Noy,
Ran Canetti,
Shay Kutten,
Yishay Mansour,
Baruch Schieber:
Bandwidth allocation with preemption.
STOC 1995: 616-625 |
| 54 | | Amotz Bar-Noy,
Shlomo Kipnis,
Baruch Schieber:
optimal Computation of Census Functions in the Postal Model.
Discrete Applied Mathematics 58(3): 213-222 (1995) |
| 53 | | Amotz Bar-Noy,
Jehoshua Bruck,
Ching-Tien Ho,
Shlomo Kipnis,
Baruch Schieber:
Computing Global Combine Operations in the Multiport Postal Model.
IEEE Trans. Parallel Distrib. Syst. 6(8): 896-900 (1995) |
| 52 | | 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) |
| 51 | | Allan Borodin,
Sandy Irani,
Prabhakar Raghavan,
Baruch Schieber:
Competitive Paging with Locality of Reference.
J. Comput. Syst. Sci. 50(2): 244-258 (1995) |
| 1994 |
|---|
| 50 | | 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 |
| 49 | | 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) |
| 48 | | Alok Aggarwal,
Baruch Schieber,
Takeshi Tokuyama:
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications.
Discrete & Computational Geometry 12: 263-280 (1994) |
| 47 | | Baruch Schieber,
Marc Snir:
Calling Names on Nameless Networks
Inf. Comput. 113(1): 80-101 (1994) |
| 1993 |
|---|
| 46 | | Amotz Bar-Noy,
Prabhakar Raghavan,
Baruch Schieber,
Hisao Tamaki:
Fast Deflection Routing for Packets and Worms (Extended Summary).
PODC 1993: 75-86 |
| 45 | | 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 |
| 44 | | Allan Borodin,
Prabhakar Raghavan,
Baruch Schieber,
Eli Upfal:
How much can hardware help routing?
STOC 1993: 573-582 |
| 43 | | Alok Aggarwal,
Baruch Schieber,
Takeshi Tokuyama:
Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications.
Symposium on Computational Geometry 1993: 189-197 |
| 42 | | Yishay Mansour,
James K. Park,
Baruch Schieber,
Sandeep Sen:
Improved selection in totally monotone arrays.
Int. J. Comput. Geometry Appl. 3(2): 115-132 (1993) |
| 41 | | 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) |
| 40 | | Amotz Bar-Noy,
Shlomo Kipnis,
Baruch Schieber:
An Optimal Algorithm for computing Census Functions in Message-Passing Systems.
Parallel Processing Letters 3: 19-23 (1993) |
| 1992 |
|---|
| 39 | | Don Coppersmith,
Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)
FOCS 1992: 288-295 |
| 38 | | Alok Aggarwal,
Amotz Bar-Noy,
Samir Khuller,
Dina Kravets,
Baruch Schieber:
Efficient Minimum Cost Matching Using Quadrangle Inequality
FOCS 1992: 583-592 |
| 37 | | Greg Barnes,
Jonathan F. Buss,
Walter L. Ruzzo,
Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Structure in Complexity Theory Conference 1992: 27-33 |
| 36 | | Nader H. Bshouty,
Yishay Mansour,
Baruch Schieber,
Prasoon Tiwari:
Fast Exponentiation Using the Truncation Operation.
Computational Complexity 2: 244-255 (1992) |
| 35 | | 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) |
| 34 | | Samir Khuller,
Baruch Schieber:
On Independent Spanning Trees.
Inf. Process. Lett. 42(6): 321-323 (1992) |
| 33 | | 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) |
| 32 | | 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) |
| 1991 |
|---|
| 31 | | Yishay Mansour,
James K. Park,
Baruch Schieber:
Improved Selection on Totally Monotone Arrays.
FSTTCS 1991: 347-359 |
| 30 | | Amotz Bar-Noy,
Baruch Schieber:
The Canadian Traveller Problem.
SODA 1991: 261-270 |
| 29 | | Allan Borodin,
Sandy Irani,
Prabhakar Raghavan,
Baruch Schieber:
Competitive Paging with Locality of Reference (Preliminary Version)
STOC 1991: 249-259 |
| 28 | | Avrim Blum,
Prabhakar Raghavan,
Baruch Schieber:
Navigating in Unfamiliar Geometric Terrain (Preliminary Version)
STOC 1991: 494-504 |
| 27 | | Pankaj K. Agarwal,
Alok Aggarwal,
Boris Aronov,
S. Rao Kosaraju,
Baruch Schieber,
Subhash Suri:
Computing external farthest neighbors for a simple polygon.
Discrete Applied Mathematics 31(2): 97-111 (1991) |
| 26 | | Yishay Mansour,
Baruch Schieber,
Prasoon Tiwari:
A Lower Bound for Integer Greatest Common Divisor Computations.
J. ACM 38(2): 453-471 (1991) |
| 25 | | 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) |
| 24 | | Yishay Mansour,
Baruch Schieber,
Prasoon Tiwari:
Lower Bounds for Computations with the Floor Operation.
SIAM J. Comput. 20(2): 315-327 (1991) |
| 23 | | 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) |
| 1990 |
|---|
| 22 | | Lawrence L. Larmore,
Baruch Schieber:
On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure.
SODA 1990: 503-512 |
| 21 | | Baruch Schieber,
Uzi Vishkin:
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm.
Discrete Applied Mathematics 29(1): 97-111 (1990) |
| 20 | | 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) |
| 1989 |
|---|
| 19 | | Samir Khuller,
Baruch Schieber:
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)
FOCS 1989: 288-293 |
| 18 | | Yishay Mansour,
Baruch Schieber,
Prasoon Tiwari:
The Complexity of Approximating the Square Root (Extended Summary)
FOCS 1989: 325-330 |
| 17 | | Yishay Mansour,
Baruch Schieber,
Prasoon Tiwari:
Lower Bounds for Computations with the Floor Operation.
ICALP 1989: 559-573 |
| 16 | | Baruch Schieber:
Calling Names in Nameless Networks.
PODC 1989: 319-328 |
| 15 | | Yishay Mansour,
Baruch Schieber:
The Intractability of Bounded Protocols for Non-FIFO Channels.
PODC 1989: 59-72 |
| 14 | | Omer Berkman,
Dany Breslauer,
Zvi Galil,
Baruch Schieber,
Uzi Vishkin:
Highly Parallelizable Problems (Extended Abstract)
STOC 1989: 309-319 |
| 13 | | Marshall W. Bern,
Howard J. Karloff,
Prabhakar Raghavan,
Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Symposium on Computational Geometry 1989: 292-301 |
| 12 | | Yishay Mansour,
Baruch Schieber:
Finding the Edge Connectivity of Directed Graphs.
J. Algorithms 10(1): 76-85 (1989) |
| 11 | | Baruch Schieber,
Shlomo Moran:
Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows.
J. Parallel Distrib. Comput. 6(1): 20-38 (1989) |
| 1988 |
|---|
| 10 | | Baruch Schieber,
Uzi Vishkin:
On Finding Lowest Common Ancestors: Simplification and Parallelization.
AWOC 1988: 111-123 |
| 9 | | Yishay Mansour,
Baruch Schieber,
Prasoon Tiwari:
Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary)
FOCS 1988: 54-63 |
| 8 | | 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 |
| 7 | | 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) |
| 6 | | Zvi Galil,
Baruch Schieber:
On finding most uniform spanning trees.
Discrete Applied Mathematics 20(2): 173-175 (1988) |
| 5 | | Baruch Schieber,
Uzi Vishkin:
On Finding Lowest Common Ancestors: Simplification and Parallelization.
SIAM J. Comput. 17(6): 1253-1262 (1988) |
| 1987 |
|---|
| 4 | | Gad M. Landau,
Baruch Schieber,
Uzi Vishkin:
Parallel Construction of a Suffix Tree (Extended Abstract).
ICALP 1987: 314-325 |
| 1986 |
|---|
| 3 | | 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 |
| 2 | | Baruch Schieber,
Shlomo Moran:
Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings.
PODC 1986: 282-292 |
| 1 | | Yael Maon,
Baruch Schieber,
Uzi Vishkin:
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs.
Theor. Comput. Sci. 47(3): 277-298 (1986) |
