1. Universal stability results for greedy contention-resolution protocols;Andrews,1996
2. Slide—the key to polynomial end-to-end communication;Afek;J. Algorithms,1997
3. Approximate load balancing on dynamic and asynchronous networks;Aiello,1992
4. Throughput competitive one-line routing;Awerbuch,1993
5. Competitive routing of virtual circuits with unknown duration;Awerbuch,1994