The following pages link to Danny Raz (Q207395):
Displaying 24 items.
- Building edge-failure resilient networks (Q818826) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- Deciding emptiness for stack automata on infinite trees (Q1333263) (← links)
- Length considerations in context-free languages (Q1391135) (← links)
- Algorithms for dynamic NFV workload (Q1757775) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- Time-dependent multi-scheduling of multicast (Q2930289) (← links)
- Deciding Properties of Nonregular Programs (Q3137712) (← links)
- Upward Max-Min Fairness (Q3177883) (← links)
- (Q4436372) (← links)
- (Q4526975) (← links)
- On slender context-free languages (Q4596643) (← links)
- Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control (Q4651514) (← links)
- (Q4737544) (← links)
- (Q5091069) (← links)
- Competitive Analysis with a Sample and the Secretary Problem (Q5146915) (← links)
- Approximating min-sum <i>k</i> -clustering in metric spaces (Q5175948) (← links)
- Exact Worst Case TCAM Rule Expansion (Q5274420) (← links)
- Coping with Interference: From Maximum Coverage to Planning Cellular Networks (Q5443507) (← links)
- Algorithms – ESA 2004 (Q5464580) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- (Q5875570) (← links)
- General Knapsack Problems in a Dynamic Setting (Q6090887) (← links)
