1. Afek, Y., Awerbuch, B., Gafni, E., Mansour, Y., Rosén, A., Shavit, N.: Slide-the key to polynomial end-to-end communication. J. Algorithms 22(1), 158–186 (1997)
2. Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differentiated services. In: INFOCOM 2000, vol. 2, pp. 431–440 (2000)
3. Andrews, M., Awerbuch, B., Fernández, A., Leighton, T., Liu, Z., Kleinberg, J.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48(1), 39–69 (2001)
4. Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple routing strategies for adversarial systems. In: 42nd Annual Symposium on Foundations of Computer Science FOCS, pp. 158–167. IEEE Computer Society (2001)
5. Awerbuch, B., Leighton, F.T.: A simple local-control approximation algorithm for multicommodity flow. In: 34th Annual Symposium on Foundations of Computer Science (FOCS), pp. 459–468 (1993)