Amir Epstein (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

8 Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik: Fast convergence to nearly optimal solutions in potential games. ACM Conference on Electronic Commerce 2008: 264-273

5 Yossi Azar, Amir Epstein, Leah Epstein: Load balancing of temporary tasks in the l_p norm. Theor. Comput. Sci. 361(2-3): 314-328 (2006)

4 Yossi Azar, Amir Epstein: Convex programming for scheduling unrelated parallel machines. STOC 2005: 331-337

3 Baruch Awerbuch, Yossi Azar, Amir Epstein: Large the price of routing unsplittable flow. STOC 2005: 57-66

2 Yossi Azar, Amir Epstein: The Hardness of Network Design for Unsplittable Flow with Selfish Users. WAOA 2005: 41-54

1 Yossi Azar, Amir Epstein, Leah Epstein: Load Balancing of Temporary Tasks in the l_p Norm. WAOA 2003: 53-66

Selection of 6 from 8 records - Amir Epstein has 10 coauthors

8		Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik: Fast convergence to nearly optimal solutions in potential games. ACM Conference on Electronic Commerce 2008: 264-273
5		Yossi Azar, Amir Epstein, Leah Epstein: Load balancing of temporary tasks in the l_p norm. Theor. Comput. Sci. 361(2-3): 314-328 (2006)
4		Yossi Azar, Amir Epstein: Convex programming for scheduling unrelated parallel machines. STOC 2005: 331-337
3		Baruch Awerbuch, Yossi Azar, Amir Epstein: Large the price of routing unsplittable flow. STOC 2005: 57-66
2		Yossi Azar, Amir Epstein: The Hardness of Network Design for Unsplittable Flow with Selfish Users. WAOA 2005: 41-54
1		Yossi Azar, Amir Epstein, Leah Epstein: Load Balancing of Temporary Tasks in the l_p Norm. WAOA 2003: 53-66