1. Aiello, W., Kushilevitz, E., Ostrovsky, R.: Adaptive packet routing for bursty adversarial traffic. In: Proc. of the 30th ACM Symp. on Theory of Computing (STOC), pp. 359–368 (1998)
2. Aiello, W., Ostrovsky, R., Kushilevitz, E., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 771–780 (2003)
3. Ajtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L.J., Waarts, O.: Fairness in scheduling. Journal of Algorithms 29(2), 306–357 (1998)
4. Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 35–44 (2004)
5. Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proc. 37th IEEE Symp. on Found. of Comp. Science, pp. 380–389 (1996)