The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Baruch Schieber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Fast Approximate Graph Partitioning Algorithms. [Citation Graph (1, 0)][DBLP]
    SODA, 1997, pp:639-648 [Conf]
  2. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
    Bandwidth allocation with preemption. [Citation Graph (1, 0)][DBLP]
    STOC, 1995, pp:616-625 [Conf]
  3. Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber
    Competitive Paging with Locality of Reference (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    STOC, 1991, pp:249-259 [Conf]
  4. Baruch Schieber, Uzi Vishkin
    On Finding Lowest Common Ancestors: Simplification and Parallelization. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1253-1262 [Journal]
  5. Nikhil Bansal, Don Coppersmith, Baruch Schieber
    Minimizing Setup and Beam-On Times in Radiation Therapy. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:27-38 [Conf]
  6. Yael Maon, Baruch Schieber, Uzi Vishkin
    Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:34-45 [Conf]
  7. Baruch Schieber, Uzi Vishkin
    On Finding Lowest Common Ancestors: Simplification and Parallelization. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:111-123 [Conf]
  8. Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
    A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:27-33 [Conf]
  9. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama
    Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:189-197 [Conf]
  10. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
    Fast Geometric Approximation Techniques and Geometric Embedding Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:292-301 [Conf]
  11. Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
    Sparse LCS Common Substring Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:225-236 [Conf]
  12. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
    Efficient Minimum Cost Matching Using Quadrangle Inequality [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:583-592 [Conf]
  13. Don Coppersmith, Baruch Schieber
    Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:288-295 [Conf]
  14. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:62-71 [Conf]
  15. Samir Khuller, Baruch Schieber
    Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:288-293 [Conf]
  16. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:54-63 [Conf]
  17. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    The Complexity of Approximating the Square Root (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:325-330 [Conf]
  18. Joseph Naor, Baruch Schieber
    Improved Approximations for Shallow-Light Spanning Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:536-541 [Conf]
  19. Yishay Mansour, James K. Park, Baruch Schieber
    Improved Selection on Totally Monotone Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:347-359 [Conf]
  20. Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
    Further Improvements in Competitive Guarantees for QoS Buffering. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:196-207 [Conf]
  21. Gad M. Landau, Baruch Schieber, Uzi Vishkin
    Parallel Construction of a Suffix Tree (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:314-325 [Conf]
  22. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    Lower Bounds for Computations with the Floor Operation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:559-573 [Conf]
  23. Moses Charikar, Joseph Naor, Baruch Schieber
    Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1518-1527 [Conf]
  24. Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
    Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:14-28 [Conf]
  25. Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
    Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:78-88 [Conf]
  26. Amotz Bar-Noy, Joseph Naor, Baruch Schieber
    Pushing dependent data in clients-providers-servers systems. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2000, pp:222-230 [Conf]
  27. Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki
    Fast Deflection Routing for Packets and Worms (Extended Summary). [Citation Graph (0, 0)][DBLP]
    PODC, 1993, pp:75-86 [Conf]
  28. Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung
    The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1988, pp:90-104 [Conf]
  29. Amotz Bar-Noy, Yishay Mansour, Baruch Schieber
    Competitive Dynamic Bandwidth Allocation. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:31-39 [Conf]
  30. Yishay Mansour, Baruch Schieber
    The Intractability of Bounded Protocols for Non-FIFO Channels. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:59-72 [Conf]
  31. Baruch Schieber
    Calling Names in Nameless Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:319-328 [Conf]
  32. Baruch Schieber, Shlomo Moran
    Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:282-292 [Conf]
  33. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Spreading Metric Based Graph Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  34. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing and Scheduling Algorithms for Optical Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:412-423 [Conf]
  35. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
    The Angular-Metric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:221-229 [Conf]
  36. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
    Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:11-20 [Conf]
  37. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
    Throughput maximization of real-time scheduling with batching. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:742-751 [Conf]
  38. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:243-252 [Conf]
  39. Amotz Bar-Noy, Baruch Schieber
    The Canadian Traveller Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:261-270 [Conf]
  40. Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
    Minimizing migrations in fair multiprocessor scheduling of persistent tasks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:982-991 [Conf]
  41. Lawrence L. Larmore, Baruch Schieber
    On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:503-512 [Conf]
  42. Baruch Schieber
    Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:405-411 [Conf]
  43. Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber
    Traffic engineering of management flows by link augmentations on confluent trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:289-298 [Conf]
  44. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber
    Computing Global Combine Operations in the Multi-Port Postal Model. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:336-343 [Conf]
  45. Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber
    A quasi-PTAS for unsplittable flow on line graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:721-729 [Conf]
  46. Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
    A unified approach to approximating resource allocation and scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:735-744 [Conf]
  47. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Multicasting in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:448-453 [Conf]
  48. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:622-631 [Conf]
  49. Avrim Blum, Prabhakar Raghavan, Baruch Schieber
    Navigating in Unfamiliar Geometric Terrain (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:494-504 [Conf]
  50. Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin
    Highly Parallelizable Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:309-319 [Conf]
  51. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
    How much can hardware help routing? [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:573-582 [Conf]
  52. Guy Even, Sudipto Guha, Baruch Schieber
    Improved approximations of crossings in graph drawings. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:296-305 [Conf]
  53. Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber
    Efficient Recovery from Power Outage (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:574-582 [Conf]
  54. T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko
    Online server allocation in a server farm via benefit task systems. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:540-549 [Conf]
  55. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
    Buffer overflow management in QoS switches. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:520-529 [Conf]
  56. Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin
    Parallel Construction of a Suffix Tree with Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:347-365 [Journal]
  57. Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
    Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:2, pp:151-174 [Journal]
  58. Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber
    A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:6, pp:572-578 [Journal]
  59. Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    Fast Exponentiation Using the Truncation Operation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:244-255 [Journal]
  60. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
    optimal Computation of Census Functions in the Postal Model. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:58, n:3, pp:213-222 [Journal]
  61. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
    Optimal multiple message broadcasting in telephone-like communication systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:1-2, pp:1-15 [Journal]
  62. Leizhen Cai, Baruch Schieber
    A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:73, n:1, pp:27-34 [Journal]
  63. Alan J. Hoffman, Baruch Schieber
    The edge versus path incidence matrix of series-parallel graphs and greedy packing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:275-284 [Journal]
  64. Baruch Schieber, Daniel Geist, Ayal Zaks
    Computing the minimum DNF representation of Boolean functions defined by intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:154-173 [Journal]
  65. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama
    Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:263-280 [Journal]
  66. Baruch Schieber, Marc Snir
    Calling Names on Nameless Networks [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:113, n:1, pp:80-101 [Journal]
  67. Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung
    The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:84, n:1, pp:97-118 [Journal]
  68. Omer Berkman, Baruch Schieber, Uzi Vishkin
    A fast parallel algorithm for finding the convex hull of a sorted point set. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:231-242 [Journal]
  69. Yishay Mansour, James K. Park, Baruch Schieber, S. Sen
    Improved selection in totally monotone arrays. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:2, pp:115-132 [Journal]
  70. Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    A Tight Bound for Approximating the Square Root. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:211-213 [Journal]
  71. Dan Gusfield, Gad M. Landau, Baruch Schieber
    An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:4, pp:181-185 [Journal]
  72. Samir Khuller, Baruch Schieber
    On Independent Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:321-323 [Journal]
  73. Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
    Sparse LCS Common Substring Alignment. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:6, pp:259-270 [Journal]
  74. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan
    Efficient Routing in Optical Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:6, pp:973-1001 [Journal]
  75. Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
    A unified approach to approximating resource allocation and scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:5, pp:1069-1090 [Journal]
  76. Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal
    How much can hardware help routing? [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:5, pp:726-741 [Journal]
  77. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Divide-and-conquer approximation algorithms via spreading metrics. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:4, pp:585-616 [Journal]
  78. Yishay Mansour, Baruch Schieber
    The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:783-799 [Journal]
  79. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    A Lower Bound for Integer Greatest Common Divisor Computations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:2, pp:453-471 [Journal]
  80. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
    Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:116-143 [Journal]
  81. Omer Berkman, Baruch Schieber, Uzi Vishkin
    Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:344-370 [Journal]
  82. Lawrence L. Larmore, Baruch Schieber
    On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:3, pp:490-515 [Journal]
  83. Yishay Mansour, Baruch Schieber
    Finding the Edge Connectivity of Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:1, pp:76-85 [Journal]
  84. Baruch Schieber
    Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:204-222 [Journal]
  85. Don Coppersmith, Baruch Schieber
    Lower Bounds on the Depth of Monotone Arithmetic Computations. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:1, pp:17-29 [Journal]
  86. Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber
    Competitive Paging with Locality of Reference. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:244-258 [Journal]
  87. Baruch Schieber, Shlomo Moran
    Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:6, n:1, pp:20-38 [Journal]
  88. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
    Minimizing Service and Operation Costs of Periodic Scheduling. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:3, pp:518-544 [Journal]
  89. Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber
    An Optimal Algorithm for computing Census Functions in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:19-23 [Journal]
  90. Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
    Minimizing migrations in fair multiprocessor scheduling of persistent tasks. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:4, pp:365-379 [Journal]
  91. Philippe Baptiste, Baruch Schieber
    A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:4, pp:395-404 [Journal]
  92. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
    The Angular-Metric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:697-711 [Journal]
  93. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber
    Bandwidth Allocation with Preemption. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1806-1828 [Journal]
  94. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Message Multicasting in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:347-358 [Journal]
  95. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Approximating the Throughput of Multiple Machines in Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:331-352 [Journal]
  96. Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan
    Guaranteeing Fair Service to Persistent Dependent Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1168-1189 [Journal]
  97. Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
    A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1273-1282 [Journal]
  98. Avrim Blum, Prabhakar Raghavan, Baruch Schieber
    Navigating in Unfamiliar Geometric Terrain. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:110-137 [Journal]
  99. Guy Even, Sudipto Guha, Baruch Schieber
    Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:231-252 [Journal]
  100. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Fast Approximate Graph Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2187-2214 [Journal]
  101. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
    Buffer Overflow Management in QoS Switches. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:563-583 [Journal]
  102. Samir Khuller, Baruch Schieber
    Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:352-375 [Journal]
  103. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    Lower Bounds for Computations with the Floor Operation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:315-327 [Journal]
  104. Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
    Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:255-267 [Journal]
  105. Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
    Fast Geometric Approximation Techniques and Geometric Embedding Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:265-281 [Journal]
  106. Yael Maon, Baruch Schieber, Uzi Vishkin
    Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:277-298 [Journal]
  107. Moses Charikar, Joseph Naor, Baruch Schieber
    Resource optimization in QoS multicast routing of real-time multimedia. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2004, v:12, n:2, pp:340-348 [Journal]
  108. Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber
    Computing Global Combine Operations in the Multiport Postal Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:8, pp:896-900 [Journal]
  109. Allan Borodin, Yuval Rabani, Baruch Schieber
    Deterministic Many-to-Many Hot Potato Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:6, pp:587-596 [Journal]
  110. Amotz Bar-Noy, Joseph Naor, Baruch Schieber
    Pushing Dependent Data in Clients-Providers-Servers Systems. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2003, v:9, n:5, pp:421-430 [Journal]
  111. Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
    Dynamic pricing for impatient bidders. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:726-735 [Conf]

  112. Non-Preemptive Min-Sum Scheduling with Resource Augmentation. [Citation Graph (, )][DBLP]


  113. Computing external farthest neighbors for a simple polygon. [Citation Graph (, )][DBLP]


  114. On finding most uniform spanning trees. [Citation Graph (, )][DBLP]


  115. Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. [Citation Graph (, )][DBLP]


Search in 0.046secs, Finished in 0.049secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002