| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko |
Dynamic pricing for impatient bidders.  |
ACM Transactions on Algorithms  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir |
Minimizing Busy Time in Multiple Machine Real-time Scheduling.  |
FSTTCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2009 |
DBLP DOI BibTeX RDF |
local ratio technique, Scheduling, batching |
| 1 | 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  |
2008 |
DBLP DOI BibTeX RDF |
capacitated covering, rectangle stabbing, Approximation algorithms, lot sizing |
| 1 | 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.  |
2008 |
DBLP DOI BibTeX RDF |
Confluent flows, Management flows, Dynamic programming, Combinatorial optimization, Network management, Traffic engineering |
| 1 | Baruch Schieber |
Preface.  |
IBM Journal of Research and Development  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko |
Dynamic pricing for impatient bidders.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber |
Non-Preemptive Min-Sum Scheduling with Resource Augmentation.  |
FOCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko |
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.  |
J. Scheduling  |
2006 |
DBLP DOI BibTeX RDF |
Persistent tasks, Multiprocessor scheduling, Process migration, Fair scheduling |
| 1 | Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin |
Vehicle Routing and Staffing for Sedan Service.  |
Transportation Science  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Don Coppersmith, Baruch Schieber |
Minimizing Setup and Beam-On Times in Radiation Therapy.  |
APPROX-RANDOM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber |
A quasi-PTAS for unsplittable flow on line graphs.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, resource allocation, approximation scheme, unsplittable flow |
| 1 | Baruch Schieber, Daniel Geist, Ayal Zaks |
Computing the minimum DNF representation of Boolean functions defined by intervals.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
approximation algorithms, network management, traffic engineering |
| 1 | Moses Charikar, Joseph Naor, Baruch Schieber |
Resource optimization in QoS multicast routing of real-time multimedia.  |
IEEE/ACM Trans. Netw.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko |
Buffer Overflow Management in QoS Switches.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko |
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko |
Further Improvements in Competitive Guarantees for QoS Buffering.  |
ICALP  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson |
Sparse LCS Common Substring Alignment.  |
Inf. Process. Lett.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Joseph Naor, Baruch Schieber |
Pushing Dependent Data in Clients-Providers-Servers Systems.  |
Wireless Networks  |
2003 |
DBLP DOI BibTeX RDF |
clients-providers-servers, de-randomization, scheduling, broadcast disks |
| 1 | Philippe Baptiste, Baruch Schieber |
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness.  |
J. Scheduling  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson |
Sparse LCS Common Substring Alignment.  |
CPM  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber |
Minimizing Service and Operation Costs of Periodic Scheduling.  |
Math. Oper. Res.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Sudipto Guha, Baruch Schieber |
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas.  |
SIAM J. Comput.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
Throughput maximization of real-time scheduling with batching.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber |
A unified approach to approximating resource allocation and scheduling.  |
J. ACM  |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms for NP-hard problems, scheduling, resource allocation, dynamic storage allocation, general caching |
| 1 | Alan J. Hoffman, Baruch Schieber |
The edge versus path incidence matrix of series-parallel graphs and greedy packing.  |
Discrete Applied Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber |
Approximating the Throughput of Multiple Machines in Real-Time Scheduling.  |
SIAM J. Comput.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko |
Buffer overflow management in QoS switches.  |
STOC  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko |
Online server allocation in a server farm via benefit task systems.  |
STOC  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-conquer approximation algorithms via spreading metrics.  |
J. ACM  |
2000 |
DBLP DOI BibTeX RDF |
feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement |
| 1 | Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin |
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.  |
SIAM J. Discrete Math.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber |
Optimal multiple message broadcasting in telephone-like communication systems.  |
Discrete Applied Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber |
Message Multicasting in Heterogeneous Networks.  |
SIAM J. Comput.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Joseph Naor, Baruch Schieber |
Pushing dependent data in clients-providers-servers systems.  |
MOBICOM  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Joseph Naor, Baruch Schieber |
Resource Optimization in QoS Multicast Routing of Real-Time Multimedia.  |
INFOCOM  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Guy Even, Sudipto Guha, Baruch Schieber |
Improved approximations of crossings in graph drawings.  |
STOC  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber |
A unified approach to approximating resource allocation and scheduling.  |
STOC  |
2000 |
DBLP DOI BibTeX RDF |
interval scheduling, scheduling with release times and deadlines, scheduling, resource allocation, bandwidth allocation, interval graphs |
| 1 | Don Coppersmith, Baruch Schieber |
Lower Bounds on the Depth of Monotone Arithmetic Computations.  |
J. Complexity  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber |
The Angular-Metric Traveling Salesman Problem.  |
SIAM J. Comput.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Fast Approximate Graph Partitioning Algorithms.  |
SIAM J. Comput.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber |
Bandwidth Allocation with Preemption.  |
SIAM J. Comput.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber |
Efficient Recovery from Power Outage (Extended Abstract).  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber |
Approximating the Throughput of Multiple Machines Under Real-Time Scheduling.  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan |
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Schieber |
Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property.  |
J. Algorithms  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan |
Guaranteeing Fair Service to Persistent Dependent Tasks.  |
SIAM J. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber |
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity.  |
SIAM J. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber |
Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract).  |
SODA  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Yishay Mansour, Baruch Schieber |
Competitive Dynamic Bandwidth Allocation.  |
PODC  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber |
Multicasting in Heterogeneous Networks.  |
STOC  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
A Tight Bound for Approximating the Square Root.  |
Inf. Process. Lett.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Yuval Rabani, Baruch Schieber |
Deterministic Many-to-Many Hot Potato Routing.  |
IEEE Trans. Parallel Distrib. Syst.  |
1997 |
DBLP DOI BibTeX RDF |
many-to-many routing, Routing, hypercube, mesh, deflection routing |
| 1 | Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal |
How much can hardware help routing?  |
J. ACM  |
1997 |
DBLP DOI BibTeX RDF |
randomized routing algorithms, single-port, packet routing, permutation routing, multi-port |
| 1 | Leizhen Cai, Baruch Schieber |
A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph.  |
Discrete Applied Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Avrim Blum, Prabhakar Raghavan, Baruch Schieber |
Navigating in Unfamiliar Geometric Terrain.  |
SIAM J. Comput.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Fast Approximate Graph Partitioning Algorithms.  |
SODA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber |
The Angular-Metric Traveling Salesman Problem.  |
SODA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Naor, Baruch Schieber |
Improved Approximations for Shallow-Light Spanning Trees.  |
FOCS  |
1997 |
DBLP DOI BibTeX RDF |
shallow-light spanning trees, bicriteria optimization, non-trivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design |
| 1 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Spreading Metric Based Graph Partitioning Algorithms.  |
PPSC  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan |
Efficient Routing in Optical Networks.  |
J. ACM  |
1996 |
DBLP DOI BibTeX RDF |
routing, optical networks, wavelength assignment |
| 1 | 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.  |
1996 |
DBLP BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin |
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.  |
ISTCS  |
1996 |
DBLP BibTeX RDF |
|
| 1 | 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.  |
1995 |
DBLP DOI BibTeX RDF |
Census computation, global combine, multiple ports, distributed systems, parallel computers, gossiping, message-passing systems, postal model |
| 1 | Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber |
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality.  |
J. Algorithms  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber |
optimal Computation of Census Functions in the Postal Model.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber |
Competitive Paging with Locality of Reference.  |
J. Comput. Syst. Sci.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Schieber |
Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property.  |
SODA  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan |
Guaranteeing Fair Service to Persistent Dependent Tasks.  |
SODA  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan |
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.  |
IPCO  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).  |
FOCS  |
1995 |
DBLP DOI BibTeX RDF |
divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm |
| 1 | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber |
Bandwidth allocation with preemption.  |
STOC  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Yuval Rabani, Yiftach Ravid, Baruch Schieber |
A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.  |
Algorithmica  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Schieber, Marc Snir |
Calling Names on Nameless Networks  |
Inf. Comput.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama |
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications.  |
Discrete & Computational Geometry  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan |
Efficient Routing and Scheduling Algorithms for Optical Networks.  |
SODA  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Berkman, Baruch Schieber, Uzi Vishkin |
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.  |
J. Algorithms  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber |
An Optimal Algorithm for computing Census Functions in Message-Passing Systems.  |
Parallel Processing Letters  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen |
Improved selection in totally monotone arrays.  |
Int. J. Comput. Geometry Appl.  |
1993 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki |
Fast Deflection Routing for Packets and Worms (Extended Summary).  |
PODC  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber |
Computing Global Combine Operations in the Multi-Port Postal Model.  |
SPDP  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal |
How much can hardware help routing?  |
STOC  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Baruch Schieber |
On Independent Spanning Trees.  |
Inf. Process. Lett.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Gusfield, Gad M. Landau, Baruch Schieber |
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.  |
Inf. Process. Lett.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber |
Fast Geometric Approximation Techniques and Geometric Embedding Problems.  |
Theor. Comput. Sci.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Yishay Mansour, Baruch Schieber |
The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels.  |
J. ACM  |
1992 |
DBLP DOI BibTeX RDF |
non-FIFO channels, sequence transmission, lower bound, data link |
| 1 | Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
Fast Exponentiation Using the Truncation Operation.  |
Computational Complexity  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Don Coppersmith, Baruch Schieber |
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)  |
FOCS  |
1992 |
DBLP DOI BibTeX RDF |
monotone arithmetic computations, binary computation tree, alternating 5-3 trees, computational complexity, lower bounds, depth, tight bound, arithmetic expression |
| 1 | Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber |
Efficient Minimum Cost Matching Using Quadrangle Inequality  |
FOCS  |
1992 |
DBLP DOI BibTeX RDF |
weakly polynomial algorithm, quadrangle inequality, minimum cost perfect matching, red points, blue points, bitonic Monge array, computational geometry, time complexity, bipartite graphs, cost function, Euclidean distance, linear time algorithm, transportation problem, matching problem |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Lawrence L. Larmore, Baruch Schieber |
On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure.  |
J. Algorithms  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
A Lower Bound for Integer Greatest Common Divisor Computations.  |
J. ACM  |
1991 |
DBLP DOI BibTeX RDF |
floor operation, greatest common devisor, mod operation, lower bound, truncation |
| 1 | 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  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
Lower Bounds for Computations with the Floor Operation.  |
SIAM J. Comput.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Khuller, Baruch Schieber |
Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs.  |
SIAM J. Comput.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Baruch Schieber |
The Canadian Traveller Problem.  |
SODA  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Yishay Mansour, James K. Park, Baruch Schieber |
Improved Selection on Totally Monotone Arrays.  |
FSTTCS  |
1991 |
DBLP DOI BibTeX RDF |
|