The following pages link to Baruch Schieber (Q221691):
Displaying 50 items.
- (Q3783605) (← links)
- (Q3798229) (← links)
- Finding the edge connectivity of directed graphs (Q3815335) (← links)
- On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152) (← links)
- (Q4010315) (← links)
- (Q4010318) (← links)
- Guaranteeing Fair Service to Persistent Dependent Tasks (Q4210089) (← links)
- A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity (Q4210095) (← links)
- Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property (Q4225862) (← links)
- (Q4228432) (← links)
- (Q4230351) (← links)
- (Q4234111) (← links)
- (Q4250158) (← links)
- Bandwidth Allocation with Preemption (Q4268843) (← links)
- The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels (Q4302789) (← links)
- A lower bound for integer greatest common divisor computations (Q4302842) (← links)
- Navigating in Unfamiliar Geometric Terrain (Q4337436) (← links)
- Efficient routing in optical networks (Q4371693) (← links)
- How much can hardware help routing? (Q4377594) (← links)
- Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications (Q4490783) (← links)
- Message Multicasting in Heterogeneous Networks (Q4507354) (← links)
- (Q4542563) (← links)
- Buffer Overflow Management in QoS Switches (Q4651481) (← links)
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values (Q4696645) (← links)
- Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas (Q4706191) (← links)
- (Q4732103) (← links)
- (Q4829010) (← links)
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality (Q4840222) (← links)
- (Q4858442) (← links)
- Guaranteeing fair service to persistent dependent tasks (Q4886054) (← links)
- (Q4886072) (← links)
- A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET (Q4889509) (← links)
- All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns (Q4910801) (← links)
- The Euclidean k-Supplier Problem (Q4910824) (← links)
- The Angular-Metric Traveling Salesman Problem (Q4943841) (← links)
- All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns (Q4962615) (← links)
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs (Q4962739) (← links)
- Throughput maximization of real-time scheduling with batching (Q4962784) (← links)
- Fully Dynamic MIS in Uniformly Sparse Graphs (Q4987444) (← links)
- Fully dynamic MIS in uniformly sparse graphs (Q5002774) (← links)
- (Q5009517) (← links)
- (Q5075815) (← links)
- Approximating minimum feedback sets and multi-cuts in directed graphs (Q5101402) (← links)
- The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
- Buffer overflow management in QoS switches (Q5176010) (← links)
- Online server allocation in a server farm via benefit task systems (Q5176012) (← links)
- On-line dynamic programming with applications to the prediction of RNA secondary structure (Q5202525) (← links)
- Fully dynamic maximal independent set with sublinear update time (Q5230340) (← links)
- Real-Time k-bounded Preemptive Scheduling (Q5232552) (← links)
- Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time (Q5236302) (← links)
