Filter Results:
- Full text PDF available (102)
Publication Year
1979
2018
- This year (10)
- Last 5 years (35)
- Last 10 years (68)
Publication Type
Co-author
Journals and Conferences
Learn More
- Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
- SIAM J. Comput.
- 1999
Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1))… (More)
- Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
- FOCS
- 1993
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, it has to proceed to… (More)
- James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
- J. ACM
- 1997
In this paper we study the problem of on-line allocation of routes to virtual circuits (both <italic>point-to-point</italic> and <italic>multicast</italic>) where the goal is to route all requests… (More)
- Baruch Awerbuch, Yossi Azar
- FOCS
- 1997
The essence of the simplest buy-at-bulk network design problem is buying network capacity "whole-sale" to guarantee connectivity from all network nodes to a certain central network switch. Capacity… (More)
- Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
- STOC
- 2003
Let <i>X=[1,2,•••,n]</i> be a ground set of <i>n</i> elements, and let <i>S</i> be a family of subsets of <i>X</i>, <i>|S|=m</i>, with a positive cost <i>c<sub>S</sub></i>… (More)
- Yossi Azar, Joseph Naor, Raphael Rom
- SODA
- 1992
Consider the on-line problem where a number of servers are ready to provide service to a set of customers. Each customer's job can be handled by any of a <italic>subset</italic> of the servers.… (More)
- Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia
- STOC
- 2001
Experimental evidence suggests that spectral techniques are valuable for a wide range of applications. A partial list of such applications include (i) semantic analysis of documents used to cluster… (More)
- Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
- SODA
- 2004
We study a wide range of online graph and network optimization problems, focusing on problems that arise in the study of connectivity and cuts in graphs. In a general online network design problem,… (More)
- James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
- STOC
- 1993
In this paper we study an idealized problem of on-line allocation of routes to virtual circuits where the goal is to minimize the required bandwidth. For the case where virtual circuits continue to… (More)
- Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
- STOC
- 2003
A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's construction is… (More)