The following pages link to Yossi Azar (Q526845):
Displaying 50 items.
- (Q172557) (redirect page) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- Liquid price of anarchy (Q681835) (← links)
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Fair versus unrestricted bin packing (Q699764) (← links)
- Tell me who I am: An interactive recommendation system (Q733719) (← links)
- Parallel comparison merging of many-ordered lists (Q807015) (← links)
- Parallel comparison algorithms for approximation problems (Q808727) (← links)
- An improved algorithm for online coloring of intervals with bandwidth (Q860808) (← links)
- Minimizing total flow time and total completion time with immediate dispatching (Q878441) (← links)
- Parallel selection (Q913517) (← links)
- Universal sequences for complete graphs (Q918989) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Approximation schemes for scheduling on parallel machines (Q1268852) (← links)
- Approximating probability distributions using small sample spaces (Q1288906) (← links)
- On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
- On-line load balancing (Q1331958) (← links)
- Maximizing job benefits on-line (Q1348735) (← links)
- On-line and off-line approximation algorithms for vector covering problems (Q1386465) (← links)
- Temporary tasks assignment resolved (Q1400898) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- On capital investment. (Q1818269) (← links)
- On-line restricted assignment of temporary tasks with unknown durations. (Q1853182) (← links)
- Off-line temporary tasks assignment. (Q1853487) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- Biased random walks (Q1912749) (← links)
- Maximizing throughput in multi-queue switches (Q2369876) (← links)
- Scheduling with deadlines and buffer management with processing requirements (Q2408172) (← links)
- An improved algorithm for online machine minimization (Q2417064) (← links)
- Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms (Q2464381) (← links)
- Collaborate with strangers to find own preferences (Q2471699) (← links)
- Combinatorial algorithms for the unsplittable flow problem (Q2492628) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
- Truthful approximation mechanisms for scheduling selfish related machines (Q2643141) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- (Q2721976) (← links)
- (Q2721978) (← links)
- (Q2721979) (← links)
- (Q2753725) (← links)
- Balanced allocations (extended abstract) (Q2817654) (← links)
- Minimizing the flow time without migration (Q2819546) (← links)
- Efficient Submodular Function Maximization under Linear Packing Constraints (Q2843232) (← links)
- Admission control to minimize rejections and online set cover with repetitions (Q2930285) (← links)
- Truthful unsplittable flow for large capacity networks (Q2930315) (← links)
- An improved algorithm for CIOQ switches (Q2944517) (← links)
