Balanced allocations Y Azar, AZ Broder, AR Karlin, E Upfal Proceedings of the twenty-sixth annual ACM symposium on theory of computing …, 1994 | 995 | 1994 |

Throughput-competitive on-line routing B Awerbuch, Y Azar, S Plotkin Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 32-40, 1993 | 470 | 1993 |

The price of routing unsplittable flow B Awerbuch, Y Azar, A Epstein Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 399 | 2005 |

Spectral analysis of data Y Azar, A Fiat, A Karlin, F McSherry, J Saia Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 356 | 2001 |

On-line routing of virtual circuits with applications to load balancing and machine scheduling J Aspnes, Y Azar, A Fiat, S Plotkin, O Waarts Journal of the ACM (JACM) 44 (3), 486-504, 1997 | 307 | 1997 |

The competitiveness of on-line assignments Y Azar, J Naor, R Rom Journal of Algorithms 18 (2), 221-237, 1995 | 298 | 1995 |

On-line load balancing Y Azar Online algorithms, 178-195, 1998 | 286 | 1998 |

New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen B Awerbuch, Y Azar, A Blum, S Vempala SIAM Journal on computing 28 (1), 254-262, 1998 | 276 | 1998 |

Optimal oblivious routing in polynomial time Y Azar, E Cohen, A Fiat, H Kaplan, H Räcke Journal of Computer and System Sciences 69 (3), 383-394, 2004 | 254 | 2004 |

Buy-at-bulk network design B Awerbuch, Y Azar Proceedings 38th Annual Symposium on Foundations of Computer Science, 542-547, 1997 | 242 | 1997 |

Approximation schemes for scheduling on parallel machines N Alon, Y Azar, GJ Woeginger, T Yadid Journal of Scheduling 1 (1), 55-66, 1998 | 221 | 1998 |

On-line load balancing with applications to machine scheduling and virtual circuit routing J Aspnes, Y Azar, A Fiat, S Plotkin, O Waarts Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 191 | 1993 |

The online set cover problem N Alon, B Awerbuch, Y Azar Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 163 | 2003 |

A general approach to online network optimization problems N Alon, B Awerbuch, Y Azar, N Buchbinder, J Naor ACM Transactions on Algorithms (TALG) 2 (4), 640-660, 2006 | 152 | 2006 |

Load balancing in the L/sub p/norm B Awerbuch, Y Azar, EF Grove, MY Kao, P Krishnan, JS Vitter Proceedings of IEEE 36th Annual Foundations of Computer Science, 383-391, 1995 | 152 | 1995 |

Cache and index refreshing strategies for variably dynamic items and accesses JY Azar, E Horvitz, E Lubetzky, D Shahaf US Patent 9,213,780, 2015 | 147 | 2015 |

On-line generalized Steiner problem B Awerbuch, Y Azar, Y Bartal Theoretical Computer Science 324 (2-3), 313-324, 2004 | 135 | 2004 |

On-line bin-stretching Y Azar, O Regev Theoretical Computer Science 268 (1), 17-41, 2001 | 125 | 2001 |

Approximation schemes for scheduling N Alon, Y Azar, GJ Woeginger, T Yadid SODA, 493-500, 1997 | 125 | 1997 |

Fast convergence to nearly optimal solutions in potential games B Awerbuch, Y Azar, A Epstein, VS Mirrokni, A Skopalik Proceedings of the 9th ACM conference on Electronic commerce, 264-273, 2008 | 124 | 2008 |