The following pages link to Baruch Schieber (Q221691):
Displaying 50 items.
- A tight bound for approximating the square root (Q287183) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks (Q880554) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- On finding most uniform spanning trees (Q1102979) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- An efficient algorithm for the all pairs suffix-prefix problem (Q1190509) (← links)
- On independent spanning trees (Q1198088) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- Lower bounds on the depth of monotone arithmetic computations (Q1288530) (← links)
- (Q1329147) (redirect page) (← links)
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
- Calling names on nameless networks (Q1333277) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness (Q1404273) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- Optimal computation of census functions in the postal model (Q1804885) (← links)
- Competitive paging with locality of reference (Q1892219) (← links)
- Optimal multiple message broadcasting in telephone-like communication systems (Q1962017) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Fast exponentiation using the truncation operation (Q2366170) (← links)
- Computing the minimum DNF representation of Boolean functions defined by intervals (Q2387437) (← links)
- Traffic engineering of management flows by link augmentations on confluent trees (Q2471695) (← links)
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling (Q2784456) (← links)
- Competitive dynamic bandwidth allocation (Q2790099) (← links)
- Efficient recovery from power outage (extended abstract) (Q2819589) (← links)
- Approximating the throughput of multiple machines under real-time scheduling (Q2819592) (← links)
- The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
- Minimizing Busy Time in Multiple Machine Real-time Scheduling (Q2908847) (← links)
- Dynamic pricing for impatient bidders (Q2930314) (← links)
- A quasi-PTAS for unsplittable flow on line graphs (Q2931432) (← links)
- (Q2934659) (← links)
- (Q3128902) (← links)
- IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS (Q3136720) (← links)
- (Q3138930) (← links)
- (Q3138961) (← links)
- Improved approximations of crossings in graph drawings (Q3191996) (← links)
- Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs (Q3210185) (← links)
- Lower Bounds for Computations with the Floor Operation (Q3212292) (← links)
- Sparse LCS Common Substring Alignment (Q3550838) (← links)
- Minimizing Setup and Beam-On Times in Radiation Therapy (Q3595380) (← links)
- (Q3727398) (← links)
