These are my five favorite papers, ordered by publication date.

• H. Attiya and M. Mavronicolas, "Efficiency of Semi-Synchronous versus Asynchronous Networks", Mathematical Systems Theory (currently Theory of Computing Systems), Vol. 27, No. 6, pp. 547-571, November/December 1994.

• C. Busch and M. Mavronicolas, "A Combinatorial Treatment of Balancing Networks", Journal of the ACM, Vol. 43, No. 5, pp. 794-839, September 1996.

Preliminary Version: "A Combinatorial Treatment of Balancing Networks", Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC 1994), pp. 206-215, Los Angeles, California, August 1994.

• P. Fatourou, M. Mavronicolas and P. Spirakis, "Efficiency of Oblivious versus Non-Oblivious Schedulers for Optimistic, Rate-Based Flow Control", SIAM Journal on Computing, accepted, December 2004.

Preliminary Version: "Efficiency of Oblivious versus Non-Oblivious Schedulers for Optimistic, Rate-Based Flow Control", Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 139-148, Santa Barbara, California, August 1997.

• T. Lücking, M. Mavronicolas, B. Monien, M. Rode, P. Spirakis and I. Vrto, "Which is the Worst-Case Nash Equilibrium?", Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtáš eds., pp. 551-561, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

• T. Lücking, M. Mavronicolas, B. Monien and M. Rode, "A New Model for Selfish Routing", invited submission to Theoretical Computer Science, Special Issue on Global Computing, Ch. Kaklamanis guest ed., September 2004.

Preliminary Version: "A New Model for Selfish Routing", Proceedings of the 21st International Symposium on Theoretical Computer Science (STACS 2004), V. Diekert and M. Habib eds., pp. 547-558, Vol. 2996, Lecture Notes in Computer Science, Springer-Verlag, Montpellier, France, March 2004.