Here is a pdf catalogue with my citations.

80 citations:

1. A. Akella, S. Chawla and S. Seshan, "Realistic Models for Selfish Routing on the Internet", available at http://www.cse.cuhk.edu.hk/ cslui/STUDY_GROUP/realistic_models.pdf, October 2005.

2. A. Akella, S. Chawla and S. Seshan, "Selfish Routing on the Internet: Modelling TCP-Like Flows", available at http://www.cs.cmu.edu/simaditya/papers/selfishrouting.ps, October 2005.

3. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

4. E. Angel, E. Bampis and F. Pascual, "Algorithmic Game Theory and Scheduling", Chapter 81 in Handbook of Approximation Algorithms and Metaheuristics, pp. 81-1---81-20, Chapman & Hall/CRC, Computer and Information Science Series, 2007.

5. K. G. Anagnostakis, "Exchange Mechanisms and Cooperative Distributed System Design", Ph.D. Thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, 2005.

6. E. Anshelevich, A. Dasgupta, E. Tardos, and T. Wexler, "Near-Optimal Network Design with Selfish Agents", Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 511-520, June 2003.

7. I. Ashlagi, D. Monderer and M. Tennenholtz, "On the Value of Correlation", Proceedings of the 8th Biennial Israeli Symposium on the Foundations of Artificial Intelligence (BISFAI 2005), pp. 34-41, Haifa, Israel, June 2005.

8. V. Auletta, R. De Prisco, P. Penna and P. Persiano, "How to Route and Tax Selfish Unsplittable Traffic", Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pp. 196-205, June 2004.

9. B. Awerbuch, Y. Azar and A. Epstein, "The Price of Routing Unsplittable Flow", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57-66, May 2005.

10. B. Awerbuch, Y. Azar, Y. Richter and D. Tsur, "Tradeoffs in Worst-Case Equilibria", Proceedings of the 1st International Workshop on Approximation and Online Algorithms (WAOA 2003), K. Jansen and R. Solis-Oba eds., pp. 41-52, Vol. 2909, Lecture Notes in Computer Science, Springer-Verlag, Budapest, Hungary, September 2003.

11. B. Awerbuch, Y. Azar, Y. Richter and D. Tsur, "Tradeoffs in Worst-Case Equilibria", Theoretical Computer Science, Vol. 361, Nos. 2-3, pp. 200-209, September 2006.

12. P. Berenbrink, T. Friedetzky, L. A. Goldberg, P. Goldberg, Z. Hu and R. Martin, "Distributed Selfish Load Balancing", Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 354 - 363, January 2006.Also available from the Mathematics ArXiv (Article cs.GT/0506098).

13. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Journal of Discrete Algorithms, to appear, 2006.

14. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Research Report CS-RR-405, Department of Computer Science, University of Warwick, March 2005. Also available from the Mathematics ArXiv (Article cs.GT/0410018).

15. V. Bilo, M. Flammini, G. Melideo and L. Moscardelli, "On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks", Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC 2004), R. Fleischer and G. Trippen eds., pp. 172-183, Vol. 3341, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2004.

16. V. Bilo, M. Flammini and L. Moscardelli, "On Nash Equilibria in Non-cooperative All-Optical Networks", Proceedings of the22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2005), V. Diekert and B. Durand eds., pp. 448-459, Vol. 3404, Lecture Notes in Computer Science, Springer-Verlag, Stuttgart, Germany, February 2005.

17. V. Bilo and L. Moscardelli, "The Price of Anarchy in All-Optical Networks", Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), R. Kralovic and O. Sykora eds., pp. 13-22, Vol. 3104, Lecture Notes in Computer Science, Springer-Verlag, Smolenice Castle, Slowakia, June 2004.

18. C. Busch and M. Magdon-Ismail, "Atomic Routing Games on Maximum Congestion", Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), S. Cheng and C. K. Poon eds., pp. 79 - 91, Vol. 4041, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, June 2006.

19. I. Caragiannis, M. Flammini, Ch. Kaklamanis, P. Kanellopoulos and L. Moscardelli, "Tight Bounds for Selfish and Greedy Load Balancing", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 311-322, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006.

20. I. Caragiannis, Ch. Kaklamanis and P. Kanellopoulos, "Taxes for Linear Atomic Congestion Games", Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), Lecture Notes in Computer Science, Springer-Verlag, Zurich, Switzerland, September 2006, to appear.

21. I. Chatzigiannakis, "Design and Analysis of Distributed Algorithms for Basic Communication in Ad-Hoc Mobile Networks", Master's Thesis, Department of Computer Engineering and Informatics, University of Patras, Rion, March 2005.

22. I. Chatzigiannakis, S. Nikoletseas and P. G. Spirakis, "On the Average and Worst-case Efficiency of Some New Distributed Communication and Control Algorithms for Ad-hoc Mobile Networks", Proceedings of the 1st ACM Workshop on Principles of Mobile Computing (POMC 2001), pp. 1-19, August 2001.

23. G. Christodoulou and E. Koutsoupias, "The Price of Anarchy of Finite Congestion Games", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67-73, May 2005.

24. G. Christodoulou and E. Koutsoupias, "On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games", Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), G. S. Brodal and S. Leonardi eds., pp. 59-70, Vol. 3669, Lecture Notes in Computer Science, Springer-Verlag, Palma de Mayorca, Spain, October 2005.

25. J. R. Correa, A. S. Schulz and N. E. Stier-Moses, "Computational Complexity, Fairness and the rice of Anarchy of the Maximum Latency Problem", Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2004), G. L. Nemhauser and D. Bienstock eds., pp. 59-73, Vol. 3064, Lecture Notes in Computer Science, Springer-Verlag, New York, June 2004.

26. A. Czumaj, "Selfish Routing on the Internet", Chapter 42 in Handbook of Scheduling; Algorithms, Models and Performance Analysis, J. Leung ed., CRC Press, 2004.

27. A. Czumaj and B. Vocking, "Tight Bounds for Worst-Case Equilibria", Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 413-420, January 2002.

28. A. Czumaj, P. Krysta and B. Vocking, "Selfish Traffic Allocation for Server Farms", Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 287-296, May 2002.

29. D. Dumrauf and M. Gairing, "Price of Anarchy for Polynomial Wardrop Games", Proceedings of the 2nd International Workshop on Internet and Network Economics (WINE 2006), P. Spirakis, M. Mavronicolas and S. Kontogiannis eds., pp. 319-330, Vol. 4286, Lecture Notes in Computer Science, Springer-Verlag, Patras, Greece, December 2006.

30. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou and S. Shenker, "On a Network Creation Game", Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 347-351, July 2003.

31. P. Fanelli, M. Flammini, G. Melideo and L. Moscardelli, "Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves", Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), R. Kralovich and P. Urzyczyn eds., pp. 363-374, Vol. 4162, Lecture Notes in Computer Science, Springer-Verlag, Stara Lesna, Slovakia, August/September 2006.

32. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Nashification and the Coordination Ratio for a Selfish Routing Game", Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), J. C. M. Baeten, J. K. Lenstra, J. Parrow and G. J. Woeginger eds., pp. 514-526, Vol. 2719, Lecture Notes in Computer Science, Springer-Verlag, Eindhoven, The Netherlands, June/July 2003.

33. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtas eds., pp. 21-45, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

34. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in The Distributed Computing Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 137-164, October 2003.

35. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in Chapter 3 ( Distributed Computing) of Current Trends in Theoretical Computer Science - The Challenge of the New Century, Vol. 1 (Algorithms and Complexity), G. Paun, G. Rozenberg and A. Salomaa eds., pp. 373-401, World Scientific Company, 2004.

36. A. Ferrante, "Nash Equilibria in Selfish Routing Networks", Tesi di Laurea, Dipartimento di Informatica ed Applicazioni "R. M. Capocelli", Universita degli Studi di Salerno, Salerno,October 2002.

37. A. Ferrante and M. Parente, "Existence of Nash Equilibria in Selfish Routing Problems", Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), R. Kralovic and O. Sykora eds., pp. 49-60, Vol. 3104, Lecture Notes in Computer Science, Springer-Verlag, Smolenice Castle, Slovak Republic, June 2004.

38. S. Fischer and B. Vocking, "On the Evolution of Selfish Routing", Proceedings of the 12th European Symposium on Algorithms (ESA 2004), S. Albers and T. Radzik eds., pp. 323-334, Vol. 3221, Lecture Notes in Computer Science, Springer-Verlag, Bergen, Norway, September 2004.

39. S. Fischer and B. Vocking, "A Counterexample to the Fully Mixed Nash Equilibrium Conjecture", Technical Report AIB-2005-11, Department of Computer Science, RWTH Aachen, May 2005.

40. S. Fischer and B. Vocking, "On the Structure and Complexity of Worst-Case Equilibria", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 151-160, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

41. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Atomic Congestion Games among Coalitions", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 572-583, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006.

42. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Selfish Unsplittable Flows", Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), J. Diaz, J. Karhumaki, A. Lepisto and D. Sannella eds., pp. 593-605, Vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, Turku, Finland, July 2004.

43. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "The Maximum Latency of Unsplittable Flows in Capacitated Networks", RACTI Technical Report TR2004/11/04, Research and Academic Computer Technology Institute, Rion, 2004.

44. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost", Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA 2005), T. Erlebach and G. Persiano eds., pp. 161-175, Vol. 3879, Lecture Notes in Computer Science, Springer-Verlag, Ibiza, Spain, October 2005.

45. M. Gairing, T. Lucking, B. Monien and K. Tiemann, "Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung eds., pp. 51-65, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

46. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

47. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", Technical Report TR-05-15, Department of Computer Science, University of Cyprus, Nicosia, October 2005.

48. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", CD-ROM Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes, Greece, April 2006.

49. P. W. Goldberg, "Bounds for the Convergence Rate of Randomized Local Search in a Multiplayer, Load-Balancing Game", Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 131-140, July 2004.

50. D. Grosu, A. T. Chronopoulos and M. Y. Leung, "Load Balancing in Distributed Systems: An Approach Using Cooperative Games", Proceedings of the 16th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2002), pp. 501-510, April 2002.

51. R. Johari, "Efficiency Loss in Market Mechanisms for Resource Allocation", Ph. D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, June 2004. *

52. R. Johari, S. Mannor and J. N. Tsitsiklis, "Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply", Technical Report LIDS-P-2605, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, June 2004.

53. R. Johari and J. N. Tsitsiklis, "Characterization Theorems for Smooth Market-Clearing Mechanisms", November 2005, available at: http://www.stanford.edu/simrjohari/pubs/char.pdf.

54. G. Karakostas and A. Viglas, "Equilibria for Networks with Malicious Users", Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC 2003), T. Ibaraki, N. Katoh and H. Ono eds., pp. 696-704, Vol. 2906, Lecture Notes in Computer Science, Springer-Verlag, Kyoto, Japan, December 2003.

55. A. C. Kaporis, L. M. Kirousis, E. I. Politopoulou and P. G. Spirakis, "Experimental Results for Stackelberg Scheduling Strategies", Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA 2005), S. Nikoletseas ed., pp. 77-88, Vol. 3503, Lecture Notes in Computer Science, Springer-Verlag, Santorini, Greece, May 2005.

56. A. C. Kaporis, E. I. Politopoulou and P. G. Spirakis, "The Price of Optimum in Stackelberg Games", Electronic Colloquium on Computational Complexity, Report TR05-056, May 2005.

57. A. C. Kaporis and P. G. Spirakis, "The Price of Optimum in Stackelberg Games", Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2006), pp. 19-28, July/August 2006.

58. S. Kontogiannis, "Multiple-Choice Assignments on Uniformly Related Machines", Technical Report ALCOMFT-TR-02-39, ALCOM-FT Technical Report Series, 2002.

59. S. Kontogiannis, "Lower Bounds and Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines", Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 124-133, May 2002.

60. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Technical Report DELIS-TR-0180, DELIS Technical Report Series, 2005.

61. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 989-1002, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

62. E. Koutsoupias, "Selfish Task Allocation", in The Algorithmics Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 79-88, October 2003.

63. E. Koutsoupias, "Coordination Mechanisms for Congestion Games", in The Online Algorithms Column of SIGACT News, Vol. 35, No. 4, pp. 58-71, December 2004.

64. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

65. C. Meyers, "Network Flow Problems and Congestion Games: Complexity and Approximation Results", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2006.

66. C. H. Papadimitriou, "Algorithms, Games, and the Internet", Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749-753, July 2001.

67. C. H. Papadimitriou, "Game Theory and Mathematical Economics: A Theoretical Computer Scientist's Introduction", Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 4-8, October 2001.

68. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

69. T. Roughgarden, "Designing Networks for Selfish Users is Hard", Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 472-381, October 2001.

70. T. Roughgarden, "On the Severity of Braess's Paradox: Designing Networks for Selfish Users is Hard", Journal of Computer and System Sciences, pp. 922-953, August 2006.

71. T. Roughgarden, "The Price of Anarchy is Independent of the Network Topology", Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 428-437, May 2002.

72. T. Roughgarden, "The Price of Anarchy is Independent of the Network Topology", Journal of Computer and System Sciences, Vol. 67, No. 2, pp. 341-364, September 2003.

73. T. Roughgarden, "Selfish Routing", Ph. D. Thesis, Department of Computer Science, Cornell University, Ithaca, May 2002. **

74. T. Roughgarden, "Stackelberg Scheduling Strategies", SIAM Journal on Computing, Vol. 33, No. 2, pp. 332-350, January/March 2004.

75. T. Roughgarden, "Selfish Routing and the Price of Anarchy", The MIT Press, 2004.

76. T. Roughgarden and E. Tardos, "How Bad is Selfish Routing?", Journal of the ACM, Vol. 49, No. 2, pp. 236-259, March 2002.

77. S. Shukla, "An Adaptive Probabilistic Routing Algorithm", Ph.D. Thesis, Department of Electrical Engineering, Indian Institute of Technology, Kanpur, May 2005.

78. J. Song, C. Sha and H. Zhu, "Nash Equilibria in Parallel Downloading with Multiple Clients", Proceedings of the 24th IEEE International Conference on Distributed Computing Systems (ICDCS 2004), pp. 94-101, March 2004.

79. P. G. Spirakis and Ch. Zaroliagis, "Distributed Algorithm Engineering", Chapter 10 in Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software, R. Fleischer, B. Moret and E. Meineche-Schmidt eds., pp. 197-228, Vol. 2547, Lecture Notes in Computer Science, Springer-Verlag, January 2002.

80. N. E. Stier-Moses, "Selfish versus Coordinated Routing in Network Games", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2004.

60 citations

1. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

2. S. Albers, S. Eilts, E. Even-Dar, Y. Mansour and L. Roditty, "On Nash Equilibria for a Network Creation Game", Proceedings of the17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 89-98, February 2006.

3. C. Alvarez, J. Gabarro and M. Serna, "Pure Nash Equilibria in Games with a Large Number of Actions", Electronic Colloquium on Computational Complexity, Technical Report TR05-031, March 2005.

4. C. Alvarez, J. Gabarro and M. Serna, "Pure Nash Equilibria in Games with a Large Number of Actions", Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), J. Jedrzejowicz and A. Szepietowski eds., pp. 95-106, Vol. 3618, Lecture Notes in Computer Science, Springer-Verlag, Gdansk, Poland, August/September 2005.

5. C. Alvarez, J. Gabarro and M. Serna, "Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees", Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), X. Deng and D. Du eds., pp. 634-643, Vol. 3827, Lecture Notes in Computer Science, Springer-Verlag, Hainan, China, December 2005.

6. E. Angel, E. Bampis and F. Pascual, "Algorithmic Game Theory and Scheduling", Chapter 81 in Handbook of Approximation Algorithms and Metaheuristics, pp. 81-1---81-20, Chapman & Hall/CRC, Computer and Information Science Series, 2007.

7. V. Auletta, R. De Prisco, P. Penna and P. Persiano, "How to Route and TaxSelfish Unsplittable Traffic", Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pp. 196-205, June 2004.

8. R. Beier, A. Czumaj, P. Krysta and B. Vocking, "Computing Equilibria for Congestion Games with (Im)perfect Information", Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 739-748, January 2004.

9. P. Berenbrink, T. Friedetzky, L. A. Goldberg, P. Goldberg, Z. Hu and R. Martin, "Distributed Selfish Load Balancing", Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 354 - 363, January 2006. Also available from the Mathematics ArXiv
   (Article cs.GT/0506098).

10. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Journal of Discrete Algorithms, to appear, 2006.

11. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Research Report CS-RR-405, Department of Computer Science, University of Warwick, March 2005. Also available from the Mathematics ArXiv (Article cs.GT/0410018).

12. V. Bilo, M. Flammini, G. Melideo and L. Moscardelli, "On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks", Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC 2004), R. Fleischer and G. Trippen eds., pp. 172-183, Vol. 3341, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2004.

13. V. Bilo, M. Flammini and L. Moscardelli, "On Nash Equilibria in Non-cooperative All-Optical Networks", Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2005), V. Diekert and B. Durand eds., pp. 448-459, Vol. 3404, Lecture Notes in Computer Science, Springer-Verlag, Stuttgart, Germany, February 2005.

14. V. Bilo and L. Moscardelli, "The Price of Anarchy in All-Optical Networks", Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), R. Kralovic and O. Sykora eds., pp. 13-22, Vol. 3104, Lecture Notes in Computer Science, Springer-Verlag, Smolenice Castle, Slovakia, June 2004.

15. C. Busch and M. Magdon-Ismail, "Atomic Routing Games on Maximum Congestion", Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), S. Cheng and C. K. Poon eds., pp. 79 - 91, Vol. 4041, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, June 2006.

16. I. Caragiannis, M. Flammini, Ch. Kaklamanis, P. Kanellopoulos and L. Moscardelli, "Tight Bounds for Selfish and Greedy Load Balancing", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B.Preneel, V. Sassone and I. Wegener eds., pp. 311-322, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006.

17. I. Caragiannis, C. Galdi and Ch. Kaklamanis, "Network Load Games", Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), X. Deng and D. Du eds., pp. 809-818, Vol. 3827, Lecture Notes in Computer Science, Springer-Verlag, Hainan, China, December 2005.

18. I. Caragiannis, Ch. Kaklamanis and P. Kanellopoulos, "Taxes for Linear Atomic Congestion Games", Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), Lecture Notes in Computer Science, Springer-Verlag, Zurich, Switzerland, September 2006, to appear.

19. J. R. Correa, A. S. Schulz and N. E. Stier-Moses, "Computational Complexity, Fairness and the Price of Anarchy of the Maximum Latency Problem", Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2004), G. L. Nemhauser and D. Bienstock eds., pp. 59-73, Vol. 3064, Lecture Notes in Computer Science, Springer-Verlag, New York, New York, June 2004.

20. A. Czumaj, "Selfish Routing on the Internet", Chapter 42 in Handbook of Scheduling; Algorithms, Models and Performance Analysis, J. Leung ed., CRC Press, 2004.

21. K. Daskalakis, "On the Existence of Pure Nash Equilibria in Graphical Games with Succinct Description", Diploma Thesis, Department of Electrical and Computer Engineering, National Technical University of Athens, Athens, July 2004.

22. E. Even-Dar, A. Kesselman and Y. Mansour, "Convergence Time to Nash Equilibria", Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), J. C. M. Baeten, J. K. Lenstra, J. Parrow and G. J. Woeginger eds., pp. 502-513, Vol. 2719, Lecture Notes in Computer Science, Springer-Verlag, Eindhoven, The Netherlands, June/July 2003.

23. E. Even-Dar and Y. Mansour, "Fast Convergence of Selfish Rerouting", Proceedings of the
    16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 772-781, January 2005.

24. A. Fabrikant, C. H. Papadimitriou and K. Talwar, "The Complexity of Pure Nash Equilibria",
     Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 604-612, June 2004.

25. P. Fanelli, M. Flammini, G. Melideo and L. Moscardelli, "Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves", Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), R. Kralovic and P. Urzyczyn eds., pp. 363-374, Vol. 4162, Lecture Notes in Computer Science, Springer-Verlag, Stara Lesna, Slovakia, August/September 2006.

26. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Nashification and the Coordination Ratio for a Selfish Routing Game", Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), J. C. M. Baeten, J. K. Lenstra, J. Parrow and G. J. Woeginger eds., pp. 514-526, Vol. 2719, Lecture Notes in Computer Science, Springer-Verlag, Eindhoven, The Netherlands, June/July 2003.

27. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtas eds., pp. 21-45, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

28. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in The Distributed Computing Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 137-164, October 2003.

29. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in Chapter 3 (Distributed Computing) of Current Trends in Theoretical Computer Science - The Challenge of the New Century, Vol. 1 (Algorithms and Complexity), G. Paun, G. Rozenberg and A. Salomaa eds., pp. 373-401, World Scientific Company, 2004.

30. A. Ferrante and M. Parente, "Existence of Nash Equilibria in Selfish Routing Problems", Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), R. Kralovic and O. Sykora eds., pp. 49-60, Vol. 3104, Lecture Notes in Computer Science, Springer-Verlag, Smolenice Castle, Slovak Republic, June 2004.

31. S. Fischer and B. Vocking, "On the Evolution of Selfish Routing", Proceedings of the 12th European Symposium on Algorithms (ESA 2004), S. Albers and T. Radzik eds., pp. 323-334, Vol. 3221, Lecture Notes in Computer Science, Springer-Verlag, Bergen, Norway, September 2004.

32. S. Fischer and B. Vocking, "A Counterexample to the Fully Mixed Nash Equilibrium Conjecture", Technical Report AIB-2005-11, Department of Computer Science, RWTH Aachen, May 2005.

33. S. Fischer and B. Vocking, "On the Structure and Complexity of Worst-Case Equilibria", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 151-160, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

34. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Atomic Congestion Games among Coalitions", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 572-583, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006

35. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Selfish Unsplittable Flows", Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), J. Diaz, J. Karhumaki, A. Lepisto and D. Sannella eds., pp. 593-605, Vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, Turku, Finland, July 2004.

36. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "The Maximum Latency of Unsplittable Flows
    in Capacitated Networks", RACTI Technical Report TR2004/11/04, Research and Academic Comoputer Technology Institute, Rion, 2004.

37. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Symmetry in Network Congestion Games:
    Pure Equilibria and Anarchy Cost", Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA 2005), T. Erlebach and G. Persiano eds., pp. 161-175, Vol. 3879, Lecture Notes in Computer Science, Springer-Verlag, Ibiza, Spain, October 2005.

38. M. Gairing, T. Lucking, B. Monien and K. Tiemann, "Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung eds., pp. 51-65, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

39. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

40. G. Georgakopoulos, D. J. Kavvadias and L. Siouris, "Nash Equilibria in All-Optical Networks", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 1033-1045, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

41. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", Technical Report TR-05-15, Department of Computer Science, University of Cyprus, Nicosia, October 2005.

42. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", CD-ROM Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes, Greece, April 2006.

43. P. W. Goldberg, "Bounds for the Convergence Rate of Randomized Local Search in a Multiplayer, Load-Balancing Game", Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 131-140, July 2004.

44. G. Gottlob, G. Greco and F. Scarcello, "Pure Nash Equilibria: Hard and Easy Games", Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2003), pp. 215-230, Bloomington, Indiana, June 2003.

45. G. Gottlob, G. Greco and F. Scarcello, "Pure Nash Equilibria: Hard and Easy Games", Journal of Artificial Intelligence Research, pp. 357-406, Vol. 24, July-December 2005.

46. A. C. Kaporis, L. M. Kirousis, E. I. Politopoulou and P. G. Spirakis, "Experimental Results for Stackelberg Scheduling Strategies", Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA 2005), S. Nikoletseas ed., pp. 77-88, Vol. 3503, Lecture Notes in Computer Science, Springer-Verlag, Santorini, Greece, May 2005.

47. A. C. Kaporis, E. I. Politopoulou and P. G. Spirakis, "The Price of Optimum in Stackelberg Games", Electronic Colloquium on Computational Complexity, Report TR05-056, May 2005.

48. A. C. Kaporis and P. G. Spirakis, "The Price of Optimum in Stackelberg Games", Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2006), pp. 19-28, July/August 2006.

49. A. Kesselman, S. Leonardi and V. Bonifaci, "Game-Theoretic Analysis of Internet Switching with Selfish Users", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 236-245, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

50. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Technical Report DELIS-TR-0180, DELIS Technical Report Series, 2005.

51. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 989-1002, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

52. A. Kothari, S. Suri, C. D. Toth and Y. Zhou, "Congestion Games, Load Balancing and Price of Anarchy", Proceedings of the Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2004), A. Lopez-Ortiz and A. M. Hamel eds., pp. 13-27, Vol. 3045, Lecture Notes in Computer Science, Springer-Verlag, Banff, Alberta, Canada, August 2004.

53. E. Koutsoupias, "Selfish Task Allocation", in The Algorithmics Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 79-88, October 2003.

54. E. Koutsoupias, "Coordination Mechanisms for Congestion Games", in The Online Algorithms Column of SIGACT News, Vol. 35, No. 4, pp. 58-71, December 2004.

55. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn,
    June 2005.

56. P. N. Panagopoulou and P. G. Spirakis, "Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games", Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA 2005), S. Nikoletseas ed., pp. 203-215, Vol. 3502,
    Lecture Notes in Computer Science, Springer-Verlag, Santorini, Greece, May 2005.

57. C. H. Papadimitriou, "Computing Correlated Equilibria in Multi-Player Games", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 49-56, May 2005.

58. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

59. T. Roughgarden, "Selfish Routing and the Price of Anarchy", The MIT Press, 2004.

60. N. E. Stier-Moses, "Selfish versus Coordinated Routing in Network Games", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2004.
     

25 citations:

1. H. Ackermann, H. Roglin and B. Vocking,  "Pure Nash Equilibria in Player-Specific and Weighted Congestion Games", Proceedings of the 2nd International Workshop on Internet and Network Economics (WINE 2006), Lecture Notes in Computer Science, Springer-Verlag, Patras, Greece, December 2006, to appear.

2. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

3. S. Aland, D. Dumrauf, M. Gairing, B. Monien and F. Schoppmann, "Exact Price of Anarchy
   for Polynomial Congestion Games", Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), B. Durand and W. Thomas eds., pp. 218 - 229, Vol. 3884, Lecture Notes in Computer Science, Springer-Verlag, Marseille, France, February 2006.

4. E. Angel, E. Bampis and F. Pascual, "Algorithmic Game Theory and Scheduling", Chapter 81 in Handbook of Approximation Algorithms and Metaheuristics, pp. 81-1---81-20, Chapman & Hall/CRC, Computer and Information Science Series, 2007.

5. C. Busch and M. Magdon-Ismail, "Atomic Routing Games on Maximum Congestion", Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), S. Cheng and C. K. Poon eds., pp. 79 - 91, Vol. 4041, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, June 2006.

6. I. Caragiannis, M. Flammini, Ch. Kaklamanis, P. Kanellopoulos and L. Moscardelli, "Tight Bounds for Selfish and Greedy Load Balancing", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 311-322, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006

7. I. Caragiannis, C. Galdi and Ch. Kaklamanis, "Network Load Games", Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), X. Deng and D. Du eds., pp. 809-818, Vol. 3827, Lecture Notes in Computer Science, Springer-Verlag, Hainan, China, December 2005.

8. I. Caragiannis, Ch. Kaklamanis and P. Kanellopoulos, "Taxes for Linear Atomic Congestion Games", Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), Lecture Notes in Computer Science, Springer-Verlag, Zurich, Switzerland, September 2006, to appear.

9. G. Christodoulou and E. Koutsoupias, "The Price of Anarchy of Finite Congestion Games", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67-73, May 2005.

10. G. Christodoulou and E. Koutsoupias, "On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games", Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), G. S. Brodal and S. Leonardi eds., pp. 59-70, Vol. 3669, Lecture Notes in Computer Science, Springer-Verlag, Palma de Mayorca, Spain, October 2005.

11. D. Dumrauf, "Congestion Games and Wardrop Games with Polynomial Latency Functions: Price of Anarchy and Complexity Results", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, May 2006.

12. A. Ferrante and M. Parente, "Existence of Nash Equilibria in Selfish Routing Problems", Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), R. Kralovic and O. Sykora eds., pp. 49-60, Vol. 3104, Lecture Notes in Computer Science, Springer-Verlag, Smolenice Castle, Slovak Republic, June 2004.

13. S. Fischer and B. Vocking, "On the Evolution of Selfish Routing", Proceedings of the 12th European Symposium on Algorithms (ESA 2004), S. Albers and T. Radzik eds., pp. 323-334, Vol. 3221, Lecture Notes in Computer Science, Springer-Verlag, Bergen, Norway, September 2004.

14. S. Fischer and B. Vocking, "A Counterexample to the Fully Mixed Nash Equilibrium Conjecture", Technical Report AIB-2005-11, Department of Computer Science, RWTH Aachen, May 2005.

15. S. Fischer and B. Vocking, "On the Structure and Complexity of Worst-Case Equilibria", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 151-160, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

16. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost", Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA 2005), T. Erlebach and G. Persiano eds., pp. 161-175, Vol. 3879, Lecture Notes in Computer Science, Springer-Verlag, Ibiza, Spain, October 2005.

17. M. Gairing, T. Lucking, B. Monien and K. Tiemann, "Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano,
     L. Monteiro, C. Palamidessi and M. Yung eds., pp. 51-65, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

18. M. Gairing, B. Monien and A. Woclaw, "A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines", Proceedings of the 32nd International Colloquium
    on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung eds., pp. 828-839, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

19. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

20. M. Gairing, B. Monien and K. Tiemann, "Routing (Un-)Splittable Flow in Games with Player-Specific Linear Latency Functions", Proceedings of the 33rd International Colloquium On Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 501-512, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006.

21. N. Immorlica, L. Li, V. S. Mirrokni and A. S. Schulz, "Coordination Mechanisms for Selfish Scheduling", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 55-69, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

22. E. Koutsoupias, "Congestion Games and Coordination Mechanisms", Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), J. Fiala, V. Koubek and J. Kratochvil eds., pp. 177-79, Vol. 3153, Lecture Notes in Computer Science, Springer-Verlag, Prague, Czech Republic, August 2004.

23. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

24. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

25. T. Roughgarden, "Selfish Routing and the Price of Anarchy", The MIT Press, 2004.

25 citations:

1. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

2. S. Aland, D. Dumrauf, M. Gairing, B. Monien and F. Schoppmann, "Exact Price of Anarchy for Polynomial Congestion Games", Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), B. Durand and W. Thomas eds., pp. 218 - 229, Vol. 3884, Lecture Notes in Computer Science, Springer-Verlag, Marseille, France, February 2006.

3. E. Angel, E. Bampis and F. Pascual, "Algorithmic Game Theory and Scheduling", Chapter 81 in Handbook of Approximation Algorithms and Metaheuristics, pp. 81-1---81-20, Chapman & Hall/CRC, Computer and Information Science Series, 2007.

4. P. Berenbrink, T. Friedetzky, Z. Hu and R. Martin, "On Weighted Balls-into-Bins Games", Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2005), V. Diekert and B. Durand eds., pp. 231-243, Vol. 3404, Lecture Notes in Computer Science, Springer-Verlag, Stuttgart, Germany, February 2005.

5. I. Caragiannis, M. Flammini, Ch. Kaklamanis, P. Kanellopoulos and L. Moscardelli, "Tight Bounds for Selfish and Greedy Load Balancing", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 311-322, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006.

6. I. Caragiannis, Ch. Kaklamanis and P. Kanellopoulos, "Taxes for Linear Atomic Congestion Games", Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), Lecture Notes in Computer Science, Springer-Verlag, Zurich, Switzerland, September 2006, to appear.

7. A. Czumaj, P. Krysta and B. Vocking, "Selfish Traffic Allocation for Server Farms", Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 287-296, May 2002.

8. D. Dumrauf, "Congestion Games and Wardrop Games with Polynomial Latency Functions: Price of Anarchy and Complexity Results", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, May 2006.

9. S. Fischer and B. Vocking, "A Counterexample to the Fully Mixed Nash Equilibrium Conjecture", Technical Report AIB-2005-11, Department of Computer Science, RWTH Aachen, May 2005.

10. S. Fischer and B. Vocking, "On the Structure and Complexity of Worst-Case Equilibria", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 151-160, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

11. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Atomic Congestion Games among Coalitions", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 572-583, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006.

12. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Selfish Unsplittable Flows", Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), J. Diaz, J. Karhumaki, A. Lepisto and D. Sannella eds., pp. 593-605, Vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, Turku, Finland, July 2004.

13. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "The Maximum Latency of Unsplittable Flows in Capacitated Networks", RACTI Technical Report TR2004/11/04, Research and Academic Comoputer Technology Institute, Rion, 2004.

14. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost", Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA 2005), T. Erlebach and G. Persiano eds., pp. 161-175, Vol. 3879, Lecture Notes in Computer Science, Springer-Verlag, Ibiza, Spain, October 2005.

15. M. Gairing, T. Lucking, B. Monien and K. Tiemann, "Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung eds., pp. 51-65, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

16. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

17. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", Technical Report TR-05-15, Department of Computer Science, University of Cyprus, Nicosia, October 2005.

18. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", CD-ROM Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes, Greece, April 2006.

19. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Technical Report DELIS-TR-0180, DELIS Technical Report Series, 2005.

20. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 989-1002, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

21. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

22. C. Meyers, "Network Flow Problems and Congestion Games: Complexity and Approximation Results", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2006.

23. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

24. T. Roughgarden, "Selfish Routing and the Price of Anarchy", The MIT Press, 2004.

25. N. E. Stier-Moses, "Selfish versus Coordinated Routing in Network Games", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2004.

20 citations:

1. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

2. S. Aland, D. Dumrauf, M. Gairing, B. Monien and F. Schoppmann, "Exact Price of Anarchy for Polynomial Congestion Games", Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), B. Durand and W. Thomas eds., pp. 218 - 229, Vol. 3884, Lecture Notes in Computer Science, Springer-Verlag, Marseille, France, February 2006.

3. B. Awerbuch, Y. Azar and A. Epstein, "The Price of Routing Unsplittable Flow", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57-66, May 2005.

4. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Journal of Discrete Algorithms, to appear, 2006.

5. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Research Report CS-RR-405, Department of Computer Science, University of Warwick, March 2005. Also available from the Mathematics ArXiv (Article cs.GT/0410018).

6. C. Busch and M. Magdon-Ismail, "Atomic Routing Games on Maximum Congestion", Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), S. Cheng and C. K. Poon eds., pp. 79 - 91, Vol. 4041, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, June 2006.

7. I. Caragiannis, M. Flammini, Ch. Kaklamanis, P. Kanellopoulos and L. Moscardelli, "Tight Bounds for Selfish and Greedy Load Balancing", Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone and I. Wegener eds., pp. 311-322, Vol. 4051, Lecture Notes in Computer Science, Springer-Verlag, Venice, Italy, July 2006

8. I. Caragiannis, Ch. Kaklamanis and P. Kanellopoulos, "Taxes for Linear Atomic Congestion Games", Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), Lecture Notes in Computer Science, Springer-Verlag, Zurich, Switzerland, September 2006, to appear.

9. G. Christodoulou and E. Koutsoupias, "The Price of Anarchy of Finite Congestion Games", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67-73, May 2005.

10. G. Christodoulou and E. Koutsoupias, "On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games", Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), G. S. Brodal and S. Leonardi eds., pp. 59-70, Vol. 3669, Lecture Notes in Computer Science, Springer-Verlag, Palma de Mayorca, Spain, October 2005.

11. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Selfish Unsplittable Flows", Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), J. Diaz, J. Karhumaki, A. Lepisto and D. Sannella eds., pp. 593-605, Vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, Turku, Finland, July 2004.

12. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost", Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA 2005), T. Erlebach and G. Persiano eds., pp. 161-175, Vol. 3879, Lecture Notes in Computer Science, Springer-Verlag, Ibiza, Spain, October 2005.

13. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

14. D. Garg and Y. Narahari, "Price of Anarchy of Network Routing Games with Incomplete Information", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 1066-1075, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

15. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", Technical Report TR-05-15, Department of Computer Science, University of Cyprus, Nicosia, October 2005.

16. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", CD-ROM Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes, Greece, April 2006.

17. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Technical Report DELIS-TR-0180, DELIS Technical Report Series, 2005.

18. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 989-1002, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

19. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

20. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.
     

21 citations:

1. E. Angel, E. Bampis and F. Pascual, "Algorithmic Game Theory and Scheduling", Chapter 81 in Handbook of Approximation Algorithms and Metaheuristics, pp. 81-1---81-20, Chapman & Hall/CRC, Computer and Information Science Series, 2007.

2. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Journal of Discrete Algorithms, to appear, 2006.

3. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Research Report CS-RR-405, Department of Computer Science, University of Warwick, March 2005. Also available from the Mathematics ArXiv (Article cs.GT/0410018).

4. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Nashification and the Coordination Ratio for a Selfish Routing Game", Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), J. C. M. Baeten, J. K. Lenstra, J. Parrow and G. J. Woeginger eds., pp. 514-526, Vol. 2719, Lecture Notes in Computer Science, Springer-Verlag, Eindhoven, The Netherlands, June/July 2003.

5. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtas eds., pp. 21-45, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

6. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in The Distributed Computing Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 137-164, October 2003.

7. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in Chapter 3 (Distributed Computing) of Current Trends in Theoretical Computer Science - The Challenge of the New Century, Vol. 1 (Algorithms and Complexity), G. Paun, G. Rozenberg and A. Salomaa eds., pp. 373-401, World Scientific Company, 2004.

8. S. Fischer and B. Vocking, "A Counterexample to the Fully Mixed Nash Equilibrium Conjecture", Technical Report AIB-2005-11, Department of Computer Science, RWTH Aachen, May 2005.

9. S. Fischer and B. Vocking, "On the Structure and Complexity of Worst-Case Equilibria", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 151-160, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

10. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Selfish Unsplittable Flows", Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), J. Diaz, J. Karhumaki, A. Lepisto and D. Sannella eds., pp. 593-605, Vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, Turku, Finland, July 2004.

11. M. Gairing, T. Lucking, B. Monien and K. Tiemann, "Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung eds., pp. 51-65, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

12. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

13. Ch. Georgiou, Th. Pavlidis andA. Philippou, "Network Uncertainty in Selfish Routing", Technical Report TR-05-15, Department of Computer Science, University of Cyprus, Nicosia, October 2005.

14. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", CD-ROM Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes, Greece, April 2006.

15. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Technical Report DELIS-TR-0180, DELIS Technical Report Series, 2005.

16. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 989-1002, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

17. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

18. C. Meyers, "Network Flow Problems and Congestion Games: Complexity and Approximation Results", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2006.

19. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

20. T. Roughgarden, "Selfish Routing and the Price of Anarchy", The MIT Press, 2004.

21. N. E. Stier-Moses, "Selfish versus Coordinated Routing in Network Games", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2004.

20 citations:

1. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

2. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Journal of Discrete Algorithms, to appear, 2006.

3. P. Berenbrink, L. A. Goldberg, P. W. Goldberg and R. Martin, "Utilitarian Resource Assignment", Research Report CS-RR-405, Department of Computer Science, University of Warwick, March 2005. Also available from the Mathematics ArXiv (Article cs.GT/0410018).

4. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtas eds., pp. 21-45, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

5. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in The Distributed Computing Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 137-164, October 2003.

6. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in Chapter 3 (Distributed Computing) of Current Trends in Theoretical Computer Science - The Challenge of the New Century, Vol. 1 (Algorithms and Complexity), G. Paun, G. Rozenberg and A. Salomaa eds., pp. 373-401, World Scientific Company, 2004.

7. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Selfish Unsplittable Flows", Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), J. Diaz, J. Karhumaki, A. Lepisto and D. Sannella eds., pp. 593-605, Vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, Turku, Finland, July 2004.

8. M. Gairing, T. Lucking, B. Monien and K. Tiemann, "Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung eds., pp. 51-65, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

9. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

10. Ch. Georgiou, Th. Pavlidis andA. Philippou, "Network Uncertainty in Selfish Routing", Technical Report TR-05-15, Department of Computer Science, University of Cyprus, Nicosia, October 2005.

11. Ch. Georgiou, Th. Pavlidis and A. Philippou, "Network Uncertainty in Selfish Routing", CD-ROM Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes, Greece, April 2006.

12. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Technical Report DELIS-TR-0180, DELIS Technical Report Series, 2005.

13. S. Kontogiannis and P. G. Spirakis, "Atomic Selfish Routing in Networks: A Survey", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 989-1002, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

14. E. Koutsoupias, "Selfish Task Allocation", in The Algorithmics Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 79-88, October 2003.

15. E. Koutsoupias, "Coordination Mechanisms for Congestion Games", in The Online Algorithms Column of SIGACT News, Vol. 35, No. 4, pp. 58-71, December 2004.

16. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

17. C. Meyers, "Network Flow Problems and Congestion Games: Complexity and Approximation Results", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2006.

18. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

19. T. Roughgarden, "Selfish Routing and the Price of Anarchy", The MIT Press, 2004.

20. N. E. Stier-Moses, "Selfish versus Coordinated Routing in Network Games", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2004.

16 citations:

1. C. Busch and M. Magdon-Ismail, "Atomic Routing Games on Maximum Congestion", Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), S. Cheng and C. K. Poon eds., pp. 79 - 91, Vol. 4041, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, June 2006.

2. G. Christodoulou and E. Koutsoupias, "The Price of Anarchy of Finite Congestion Games", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67-73, May 2005.

3. G. Christodoulou and E. Koutsoupias, "On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games", Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), G. S. Brodal and S. Leonardi eds., pp. 59-70, Vol. 3669, Lecture Notes in Computer Science, Springer-Verlag, Palma de Mayorca, Spain, October 2005.

4. G. Christodoulou, E. Koutsoupias and A. Nanavati, "Coordination Mechanisms", Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), J. Diaz, J. Karhumaki, A. Lepisto and D. Sannella eds., pp. 345-357, Vol. 3142, Lecture Notes in Computer Science, Springer-Verlag, Turku, Finland, July 2004.

5. J. R. Correa, A. S. Schulz and N. E. Stier-Moses, "Computational Complexity, Fairness and the Price of Anarchy of the Maximum Latency Problem", Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2004), G. L. Nemhauser and D. Bienstock eds., pp. 59-73, Vol. 3064, Lecture Notes in Computer Science, Springer-Verlag, New York, New York, June 2004.

6. A. Czumaj, "Selfish Routing on the Internet", Chapter 42 in Handbook of Scheduling; Algorithms, Models and Performance Analysis, J. Leung ed., CRC Press, 2004.

7. A. Czumaj and B. Vocking, "Tight Bounds for Worst-Case Equilibria", Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 413-420, January 2002.

8. A. Czumaj, P. Krysta and B. Vocking, "Selfish Traffic Allocation for Server Farms", Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 287-296, May 2002.

9. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtas eds., pp. 21-45, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

10. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in The Distributed Computing Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 137-164, October 2003.

11. R. Feldmann, M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in Non-Cooperative Networks: A Survey", in Chapter 3 (Distributed Computing) of Current Trends in Theoretical Computer Science - The Challenge of the New Century, Vol. 1 (Algorithms and Complexity), G. Paun, G. Rozenberg and A. Salomaa eds., pp. 373-401, World Scientific Company, 2004.

12. A. Ferrante and M. Parente, "Existence of Nash Equilibria in Selfish Routing Problems", Proceedings of the 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), R. Kralovic and O. Sykora eds., pp. 49-60, Vol. 3104, Lecture Notes in Computer Science, Springer-Verlag, Smolenice Castle, Slovak Republic, June 2004.

13. E. Koutsoupias, "Selfish Task Allocation", in The Algorithmics Column of Bulletin of the European Association for Theoretical Computer Science, No. 81, pp. 79-88, October 2003.

14. E. Koutsoupias, "Coordination Mechanisms for Congestion Games", in The Online Algorithms Column of SIGACT News, Vol. 35, No. 4, pp. 58-71, December 2004.

15. A. Nanavati, "Coordination Mechanisms and Online Matching", Ph. D. Thesis, Department of Computer Science, University of California at Los Angeles, Los Angeles, December 2003.

16. T. Roughgarden, "Stackelberg Scheduling Strategies", SIAM Journal on Computing, Vol. 33, No. 2, pp. 332-350, January/March 2004.

15 citations:

1. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

2. S. Aland, D. Dumrauf, M. Gairing, B. Monien and F. Schoppmann, "Exact Price of Anarchy for Polynomial Congestion Games", Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), B. Durand and W. Thomas eds., pp. 218 - 229, Vol. 3884, Lecture Notes in Computer Science, Springer-Verlag, Marseille, France, February 2006.

3. C. Alvarez, J. Gabarro and M. Serna, "Pure Nash Equilibria in Games with a Large Number of Actions", Electronic Colloquium on Computational Complexity, Technical Report TR05-031, March 2005.

4. C. Alvarez, J. Gabarro and M. Serna, "Pure Nash Equilibria in Games with a Large Number of Actions", Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), J. Jedrzejowicz and A. Szepietowski eds., pp.95-106, Vol.3618, Lecture Notes in Computer Science, Springer-Verlag, Gdansk, Poland, August/September 2005.

5. C. Alvarez, J. Gabarro and M. Serna, "Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees", Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), X. Deng and D. Du eds., pp.634-643, Vol.3827, Lecture Notes in Computer Science, Springer-Verlag, Hainan, China, December 2005.

6. B. Awerbuch, Y. Azar and A. Epstein, "The Price of Routing Unsplittable Flow", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp.57-66, May 2005.

7. C. Busch and M. Magdon-Ismail, "Atomic Routing Games on Maximum Congestion", Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), S. Cheng and C. K. Poon eds., pp. 79 - 91, Vol. 4041, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, June 2006.

8. G. Christodoulou and E. Koutsoupias, "The Price of Anarchy of Finite Congestion Games", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67-73, May 2005.

9. G. Christodoulou and E. Koutsoupias, "On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games", Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), G. S. Brodal and S. Leonardi eds., pp. 59-70, Vol. 3669, Lecture Notes in Computer Science, Springer-Verlag, Palma de Mayorca, Spain, October 2005.

10. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost", Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA 2005), T. Erlebach and G. Persiano eds., pp. 161-175, Vol. 3879, Lecture Notes in Computer Science, Springer-Verlag, Ibiza, Spain, October 2005.

11. M. Gairing, T. Lucking, B. Monien and K. Tiemann, "Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture", Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung eds., pp. 51-65, Vol. 3580, Lecture Notes in Computer Science, Springer-Verlag, Lisboa, Portugal, July 2005.

12. M. Gairing, B. Monien and K. Tiemann, "Selfish Routing with Incomplete Information", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 203-212, June 2005.

13. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

14. M. Rode, "Nash Equilibria in Discrete Routing Games", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.

15. T. Roughgarden, "Selfish Routing and the Price of Anarchy", The MIT Press, 2004.

12 citations:

1. H. Attiya and T. Djerassi-Shintel, "Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures", Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG 1993), A. Schiper ed., pp. 204-218, Vol. 725, Lecture Notes in Computer Science Springer-Verlag, Lausanne, Switzerland, September 1993.

2. H. Attiya, C. Dwork, N. Lynch and L. Stockmeyer, "Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty", Journal of the ACM, Vol. 41, No. 1, pp. 122-152, January 1994.

3. H. Attiya, C. Dwork, N. Lynch and L. Stockmeyer, "Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty", Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 1991), pp. 359-369, May 1991.

4. H. Attiya and N. Lynch, "Theory of Real-Time Systems - Project Survey", Chapter 5 in Foundations of Real-Time Computing: Formal Specifications and Methods, A. M. Van Tilborg and G. M. Koob eds., pp. 111-138, Kluwer Academic Publishers, 1991.

5. H. Attiya and N. Lynch, "Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty", Information and Computation, Vol. 110, No. 4, pp. 183-232, April 1994.

6. R. Canetti and T. Rabin, "Fast Asynchronous Byzantine Agreement with Optimal Resilience", Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp. 42-51, May 1993.

7. T. Djerassi-Shintel, "Lower Bounds for Decision Problems in Semi-Synchronous Systems", Master's Thesis, Faculty of Computer Science, The Technion - Israel Institute of Technology, Haifa, October 1993.

8. N. Lynch and B. Patt-Shamir, "Distributed Algorithms", Lecture Notes for 6.852, MIT/LCS/RSS-20, Research Seminar Series, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, January 1993.

9. N. Lynch and I. Saias, "Distributed Algorithms", Lecture Notes for 6.852, MIT/LCS/RSS-15, Research Seminar Series, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, February 1992.

10. S. Ponzio, "The Real-Time Cost of Timing Uncertainty: Consensus and Failure Detection", S. M. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, June 1991.

11. S. Ponzio, "Consensus in the Presence of Timing Uncertainty: Omission and Byzantine Failures", Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (PODC 1991), pp. 125-138, August 1991.

12. I. Rhee and J. L. Welch, "The Impact of Time on the Session Problem", Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing (PODC 1992), pp. 191-202, August 1992.

12 citations:

1. H. Attiya, "Distributed Algorithms", Lecture Notes for Course # 236357, Technical Report, Department of Computer Science, The Technion, Haifa 32000, Israel, January 1994.

2. H. Attiya and J. L. Welch, "Distributed Computing: Fundamentals, Simulations, and Advanced Topics", McGraw-Hill, June 1998. ***

3. H. Attiya and J. L. Welch, "Distributed Computing: Fundamentals, Simulations, and Advanced Topics", 2nd edition, John Wiley and Sons Inc., March 2004. ****

4. F. Fich, V. Luchangco, M. Moir and N. Shavit, "Obstruction-Free Algorithms Can Be Practically Wait-Free", Proceedings of the 19th International Symposium on DIStributed Computing (DISC 2005), P. Fraigniaud ed., pp. 78-92, Vol. 3724, Lecture Notes in Computer Science, Springer-Verlag, Cracow, Poland, September 2005.

5. F. Fich and E. Ruppert, "Hundreds of Impossibility Results in Distributed Computing", Distributed Computing, Vol. 16, Nos. 2&3, pp. 121-163, September 2003.

6. J. E. Gehrke, C. G. Plaxton, and R. Rajaraman, "Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings", Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 1997), M. Mavronicolas and Ph. Tsigas eds., pp. 81-95, Vol. 1320, Lecture Notes in Computer Science, Springer-Verlag, Saarbrucken, Germany, September 1997.

7. J. E. Gehrke, C. G. Plaxton, and R. Rajaraman, "Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings", Theoretical Computer Science, Vol. 220, No. 1, pp. 247-266, June 1999.

8. N. Lynch, "Distributed Algorithms", Morgan Kaufmann, January 1996. *****

9. R. Rajaraman, "Sharing Resources in Distributed Systems", Ph. D. Dissertation, Department of Computer Science, University of Texas at Austin, Austin, December 1997.

10. I. Rhee, "Efficiency of Partial Synchrony, and Resource Allocation in Distributed Systems", Ph. D. Dissertation, Department of Computer Science, University of North Carolina, Chapel Hill, June 1994.

11. I. Rhee and J. L. Welch, "Time Bounds on Synchronization in a Periodic Distributed System", Information Processing Letters, Vol. 64, No. 2, pp. 87-93, October 1997.

12. I. Rhee and J. L. Welch, "The Impact of Timing Knowledge on the Session Problem", SIAM Journal on Computing, Vol. 32, No. 4, pp. 1007-1039, June/July 2003.

12 citations:

1. Ch. Georgiou, A. Russell and A. A. Shvartsman, "Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups", Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 251-258, June 2003.

2. Ch. Georgiou, A. Russell and A. A. Shvartsman, "Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups", SIAM Journal on Computing, Vol. 34, No. 4, pp. 848-862, April/May 2005.

3. Ch. Georgiou, A. Russell and A. A. Shvartsman, "Distributed Cooperation and Adversity: Complexity Trade-offs", Proceedings of the Paris C. Kanellakis Memorial Workshop on Principles of Computing and Knowledge (ACMPCK50), pp. 60-71, June 2003.

4. G. G. Malewicz, "Distributed Scheduling for Disconnected Cooperation", Ph.D. Thesis, Department of Computer Science and Engineering, University of Connecticut, Storrs, July 2003.

5. G. G. Malewicz, A. Russell and A. A. Shvartsman, "Distributed Cooperation During the Absence of Communication", Proceedings of the 14th International Symposium on DIStributed Computing (DISC 2000), M. Herlihy ed., pp. 119-133, Vol. 1914, Lecture Notes in Computer Science Springer-Verlag, Toledo, Spain, October 2000.

6. G. G. Malewicz, A. Russell and A. A. Shvartsman, "Distributed Cooperation in the Absence of Communication", Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), p. 339, July 2000.

7. G. G. Malewicz, A. Russell and A. A. Shvartsman, "Optimal Scheduling for Disconnected Cooperation", Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 305-307, August 2001.

8. G. G. Malewicz, A. Russell and A. A. Shvartsman, "Local Scheduling for Distributed Cooperation", Proceedings of the 1st IEEE International Symposium on Network Computing and Applications (NCA 2001), pp. 244-255, October 2001.

9. G. G. Malewicz, A. Russell and A. A. Shvartsman, "Optimal Scheduling for Disconnected Cooperation", Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), Carleton Scientific, Proceedings in Informatics, Vol. 11, pp. 259-274, Vall de Nuria, Spain, July 2001.

10. G. G. Malewicz, A. Russell and A. A. Shvartsman, "Distributed Scheduling for Disconnected Cooperation", Distributed Computing, Vol. 18, No. 6, June 2006.

11. A. Russell and A. A. Shvartsman, "Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation", in The Distributed Computing Column of Bulletin of the European Association for Theoretical Computer Science, Vol. 75, pp. 120-131, June 2002.

12. A. Russell and A. A. Shvartsman, "Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation", Chapter 3 (Distributed Computing) in Current Trends in Theoretical Computer Science - The Challenge of the New Century, Vol. 1 (Algorithms and Complexity), G. Paun, G. Rozenberg and A. Salomaa eds., pp. 315-336, World Scientific Company, 2004.

11 citations:

1. T. Antoniou, I. Chatzigiannakis, G. Mylonas and A. Boukerche, "A New Energy Efficient and Fault-tolerant Protocol for Data Propagation in Smart Dust Networks Using Varying Transmission Range", Proceedings of the 37th Annual Simulation Symposium (ANSS 2004), pp. 43-53, Arlington, Virginia, April 2004.

2. A. Boukerche, I. Chatzigiannakis and S. Nikoletseas, "Power-Efficient Data Propagation Protocols for Wireless Sensor Networks", SIMULATION: Transactions of the Society for Modeling and Simulation, Special Issue on Modeling and Simulation of Emerging Wireless and Sensor Network Technologies and Applications, Vol. 81, No. 6, pp. 399–411, June 2005.

3. A. Boukerche and S. Nikoletseas, "Protocols for Data Propagation in Wireless Sensor Networks: A Survey", Book Chapter in Wireless Communications Systems and Networks, M. Guizani ed., pp. 23–51, Kluwer Academic Publishers, 2004.

4. I. Chatzigiannakis, T. Dimitriou, S. Nikoletseas and P. G. Spirakis, "A Probabilistic Algorithm for Efficient and Robust Data Propagation in Smart Dust Networks", Proceedings of the 5th European Wireless Conference on Mobile and Wireless Systems Beyond 3G (EW 2004), pp. 344–350, Barcelona, Spain, February 2004.

5. I. Chatzigiannakis, A. Kinalis and S. Nikoletseas, "Wireless Sensor Networks Protocols for Efficient Collision Avoidance in Multi-path Data Propagation", Proceedings of the 1st ACM Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks (PE-WASUN 2004) (held in conjunction with ACM MSWiM 2004), pp. 8–16, October 2004.

6. I. Chatzigiannakis, A. Kinalis and S. Nikoletseas, "Power Conservation Schemes for Energy Efficient Data Propagation in Heterogeneous Wireless Sensor Networks", Proceedings of the 38th Annual ACM/IEEE Simulation Symposium (ANSS 2005), pp. 60–71, April 2005.

7. I. Chatzigiannakis, A. Kinalis and S. Nikoletseas, "An Adaptive Power Conservation Scheme for Heterogeneous Wireless Sensor Networks with Node Redeployment", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 96–105, July 2005.

8. T. Dimitriou, I. Krontiris, F. Nikakis and P. G. Spirakis, "SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks", Proceedings of the 3rd International IFIP-TC6 Networking Conference, N. Mitrou, K. Kontovasilis, G. N. Rouskas, I. Iliadis and L. Merakos eds., pp. 1300– 1305, Vol. 3042, Lecture Notes in Computer Science, Springer-Verlag, Athens, Greece, May 2004.

9. C. Efthymiou, S. Nikoletseas and J. Rolim, "Energy Balanced Data Propagation in Wireless Sensor Networks", Proceedings of the 18th Parallel and Distributed Processing Symposium (IPDPS 2004), pp. 225–233, Santa Fe, New Mexico, April 2004.

10. S. Nikoletseas, I. Chatzigiannakis, C. Euthimiou, A. Kinalis, A. Antoniou and G. Mylonas, "Energy Efficient Protocols for Sensing Multiple Events in Smart Dust Networks", Proceedings of the 37th Annual Simulations Symposium 2004 (ANSS 2004), pp. 15–24, April 2004.

11. P. G. Spirakis, "Algorithmic and Foundational Aspects of Sensor Systems", Proceedings of the 1st International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2004), S. Nikoletseas and J. D. P. Rolim eds., pp. 3–8, Vol. 3121, Lecture Notes in Computer Science Springer-Verlag, Turku, Finland, July 2004.

11 citations:

1. E. Aharonson and H. Attiya, “Counting Networks with Arbitrary Fan-Out", Distributed Computing, Vol. 8, No. 4, pp. 163–169, 1995.

2. H. Brit, S. Moran and G. Taubenfeld, “Public Data Structures: Counters as a Special Case", Theoretical Computer Science, Vol. 289, No. 1, pp. 401–423, November 2002.

3. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

4. C. Busch and M. Herlihy, "A Survey on Counting Networks", Proceedings of Workshop on Distributed Data and Structures (WDAS 1998), pp. 13–20, Orlando, Florida, March 1998.

5. C. Dwork, M. Herlihy and O. Waarts, “Contention in Shared Memory Algorithms", Journal of the ACM, Vol. 44, No. 6, pp. 779–805, November 1997.

6. P. Fatourou and M. Herlihy, "Adding Networks", Proceedings of the 15th International Symposium on DIStributed Computing (DISC 2001), J. L. Welch ed., pp. 330–342, Vol. 2180, Lecture Notes in Computer Science, Springer-Verlag, Lisbon, Portugal, October 2001.

7. P. Fatourou and M. Herlihy, “Read-Modify-Write Networks", Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.

8. D. Hendler and N. Shavit, “Operation Valency and the Cost of Coordination", Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 84–91, July 2003.

9. N. Lynch, N. Shavit, A. A. Shvartsman and D. Touitou, "Timing Conditions for Linearizability in Uniform Counting Networks", Theoretical Computer Science, Vol. 220, No. 1, pp. 67–92, June 1999.

10. N. Lynch, N. Shavit, A. A. Shvartsman and D. Touitou, “Counting Networks are Practically Linearizable", Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC 1996), pp. 280–289, May 1996.

11. R. Wattenhofer, "Distributed Counting: How to Bypass Bottlenecks", Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, 1998.

11 citations:

1. M. Ahamad, J. Burns, P. Hutto and G. Neiger, “Causal Memory: Definitions, Implementation and Programming", Distributed Computing, Vol. 9, No. 1, pp. 37–49, August 1995.

2. H. Attiya and J. L. Welch, “Sequential Consistency versus Linearizability", ACM Transactions on Computer Systems, Vol. 12, No. 2, pp. 91–122, May 1994.

3. H. Attiya and J. L. Welch, “Distributed Computing: Fundamentals, Simulations, and Advanced Topics", McGraw-Hill, June 1998.

4. R. Friedman, “Implementing Hybrid Consistency with High-Level Synchronization Operations", Distributed Computing, Vol. 9, No. 3, pp. 119–129, December 1995.

5. R. Friedman, “Implementing Hybrid Consistency with High-Level Synchronization Operations", Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 229–240, August 1993.

6. R. Friedman, “Consistency Conditions for Distributed Shared Memories", Ph. D. Thesis, Faculty of Computer Science, The Technion – Israel Institute of Technology, Haifa, June 1994.

7. M. Inoue, T. Masuzawa and N. Tokura, “Efficient Linearizable Implementation of Shared FIFO Queues and General Objects on a Distributed System", IEICE Transactions on Fundamentals of Electronics, Communications, and Computer Sciences, Vol. E81A, No. 5, pp. 768–775, May 1998. ***

8. J. James and A. K. Singh, “Fault Tolerance Bounds for Memory Consistency", Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 1997), M. Mavronicolas and Ph. Tsigas eds., pp. 200–214, Vol. 1320, Lecture Notes in Computer Science, Springer-Verlag, Saarbrucken, Germany, September 1997.

9. M. J. Kosa, “Consistency Conditions for Concurrent Shared Objects: Upper and Lower Bounds", Ph. D. Dissertation, Department of Computer Science, University of North Carolina, Chapel Hill, February 1994.

10. M. J. Kosa, “Making Operations of Concurrent Data Types Fast", Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC 1994), pp. 32–41, August 1994.

11. M. J. Kosa, "Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types", Chicago Journal of Theoretical Computer Science (electronic), Article 9, 1999.

11 citations:

1. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

2. C. Busch and M. Herlihy, "A Survey on Counting Networks", Proceedings of Workshop on Distributed Data and Structures (WDAS 1998), pp. 13–20, Orlando, Florida, March 1998.

3. C. Busch and M. Herlihy, "Sorting and Counting Networks of Arbitrary Width and Small Depth", Theory of Computing Systems, Vol. 35, No. 2, pp. 99–128, January 2002.

4. G. Della-Libera and N. Shavit, "Reactive Diffracting Trees", Journal of Parallel and Distributed Computing, Vol. 60, No. 7, pp. 853–890, July 2000.

5. P. Fatourou and M. Herlihy, “Read-Modify-Write Networks", Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.

6. J. Giesen, R. Wattenhofer and A. Zollinger, “Towards a Theory of Peer-to-Peer Computability", Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002), pp. 115–132, Andros, Greece, June 2002.

7. M. Moir and N. Shavit, "Concurrent Data Structures", Sun Microsystems, Book Chapter, available at http://www.cs.tau.ac.il/Wafek/ConcurrentDS-MS04.pdf.

8. M. D. Riedel and J. Bruck, “Tolerating Faults in Counting Networks", Technical Report Paradise ETR-022, Department of Computer Science, California Institute of Technology, Pasadena, April 1998.

9. N. Shavit, E. Upfal and A. Zemach, "A Wait-free Sorting Algorithm", Theory of Computing Systems, pp. 519–544, Vol. 34, No. 6, November/December 2001.

10. R. Wattenhofer, "Distributed Counting: How to Bypass Bottlenecks", Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, 1998.

11. M. Younis, M. Youssef and K. Arisha, "Energy-Aware Routing in Cluster-Based Sensor Networks", Proceedings of the 10th IEEE International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2002), pp. 129–136, October 2002.

10 citations:

1. H. Brit, S. Moran and G. Taubenfeld, “Public Data Structures: Counters as a Special Case", Theoretical Computer Science, Vol. 289, No. 1, pp. 401–423, November 2002.

2. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

3. C. Busch and M. Herlihy, "A Survey on Counting Networks", Proceedings of Workshop on Distributed Data and Structures (WDAS 1998), pp. 13–20, Orlando, Florida, March 1998.

4. C. Busch and M. Herlihy, "Sorting and Counting Networks of Small Depth and Arbitrary Width", Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1999), pp. 64–73, June 1999.

5. C. Busch and M. Herlihy, "Sorting and Counting Networks of Arbitrary Width and Small Depth", Theory of Computing Systems, Vol. 35, No. 2, pp. 99–128, January 2002.

6. G. Della-Libera and N. Shavit, "Reactive Diffracting Trees", Journal of Parallel and Distributed Computing, Vol. 60, No. 7, pp. 853–890, July 2000.

7. F. Fich, V. Luchangco, M. Moir and N. Shavit, "Obstruction-Free Algorithms Can Be Practically Wait-Free", Proceedings of the 19th International Symposium on DIStributed Computing (DISC 2005), P. Fraigniaud ed., pp. 78–92, Vol. 3724, Lecture Notes in Computer Science, Springer- Verlag, Cracow, Poland, September 2005.

8. N. Lynch, N. Shavit, A. A. Shvartsman and D. Touitou, "Timing Conditions for Linearizability in Uniform Counting Networks", Theoretical Computer Science, Vol. 220, No. 1, pp. 67–92, June 1999.

9. R. Wattenhofer, "Distributed Counting: How to Bypass Bottlenecks", Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, 1998.

10. R. Wattenhofer and P. Widmayer, “Distributed Counting at Maximum Speed", Technical Report, Institut fur Theoretische Informatik, Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, January 1998.
     

10 citations:

1. H. Brit, “Public Data Structures and Public Counters as a Special Case", Master’s Thesis, Faculty of Computer Science, The Technion – Israel Institute of Technology, Haifa, June 1994.

2. H. Brit, S. Moran and G. Taubenfeld, “Public Data Structures: Counters as a Special Case", Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems (ISTCS 1995), pp. 98–110, Tel-Aviv, Israel, January 1995.

3. H. Brit, S. Moran and G. Taubenfeld, “Public Data Structures: Counters as a Special Case", Theoretical Computer Science, Vol. 289, No. 1, pp. 401–423, November 2002.

4. M. Herlihy, N. Shavit and O. Waarts, “Linearizable Counting Networks", Distributed Computing, Vol. 9, No. 4, pp. 193–203, February 1996.

5. M. Klugerman, “Small-Depth Counting Networks and Related Topics", Ph. D. Thesis, Department of Mathematics, Massachusetts Institute of Technology, Cambridge, September 1994.

6. N. Lynch, N. Shavit, A. A. Shvartsman and D. Touitou, "Timing Conditions for Linearizability in Uniform Counting Networks", Theoretical Computer Science, Vol. 220, No. 1, pp. 67–92, June 1999.

7. N. Lynch, N. Shavit, A. A. Shvartsman and D. Touitou, “Counting Networks are Practically Linearizable", Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC 1996), pp. 280–289, May 1996.

8. S. Moran, G. Taubenfeld and I. Yadin, “Concurrent Counting", Journal of Computer and System Sciences, Vol. 53, No. 1, pp. 61–78, January 1996.

9. Y. Rabani, A. Sinclair and R. Wanka, “Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes", Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 694–703, November 1998.

10. N. Shavit and A. Zemach, “Diffracting Trees", ACM Transactions on Computer Systems, Vol. 14, No. 4, pp. 385–428, November 1996.

9 citations:

1. H. Brit, S. Moran and G. Taubenfeld, “Public Data Structures: Counters as a Special Case", Theoretical Computer Science, Vol. 289, No. 1, pp. 401–423, November 2002.

2. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

3. C. Busch and M. Herlihy, "A Survey on Counting Networks", Proceedings of Workshop on Distributed Data and Structures (WDAS 1998), pp. 13–20, Orlando, Florida, March 1998.

4. C. Busch and M. Herlihy, "Sorting and Counting Networks of Small Depth and Arbitrary Width", Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1999), pp. 64–73, June 1999.

5. C. Busch and M. Herlihy, "Sorting and Counting Networks of Arbitrary Width and Small Depth", Theory of Computing Systems, Vol. 35, No. 2, pp. 99–128, January 2002.

6. C. Dwork, M. Herlihy and O. Waarts, “Contention in Shared Memory Algorithms", Journal of the ACM, Vol. 44, No. 6, pp. 779–805, November 1997.

7. D. Hendler and N. Shavit, “Operation Valency and the Cost of Coordination", Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 84–91, July 2003.

8. M. Herlihy and S. Tirthapura, "Self-Stabilizing Smoothing and Counting", Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS 2003), pp. 4–11, May 2003.

9. N. Shavit, E. Upfal and A. Zemach, "A Wait-free Sorting Algorithm", Theory of Computing Systems, pp. 519–544, Vol. 34, No. 6, November/December 2001.

9 citations:

1. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

2. S. Aland, D. Dumrauf, M. Gairing, B. Monien and F. Schoppmann, "Exact Price of Anarchy for Polynomial Congestion Games", Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), B. Durand and W. Thomas eds., pp. 218 - 229, Vol. 3884, Lecture Notes in Computer Science, Springer-Verlag, Marseille, France, February 2006.

3. B. Awerbuch, Y. Azar and A. Epstein, "The Price of Routing Unsplittable Flow", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57–66, May 2005.

4. C. Busch and M. Magdon-Ismail, "Atomic Routing Games on Maximum Congestion", Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006), S. Cheng and C. K. Poon eds., pp. 79 - 91, Vol. 4041, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, June 2006.

5. G. Christodoulou and E. Koutsoupias, "The Price of Anarchy of Finite Congestion Games", Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67–73, May 2005.

6. G. Christodoulou and E. Koutsoupias, "On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games", Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), G. S. Brodal and S. Leonardi eds., pp. 59–70, Vol. 3669, Lecture Notes in Computer Science, Springer-Verlag, Palma de Mayorca, Spain, October 2005.

7. D. Dumrauf and M. Gairing, "Price of Anarchy for Polynomial Wardrop Games", Proceedings of the 2nd International Workshop on Internet and Network Economics (WINE 2006), P. Spirakis, M. Mavronicolas and S. Kontogiannis eds., pp. 319-330, Vol. 4286, Lecture Notes in Computer Science, Springer-Verlag, Patras, Greece, December 2006.

8. D. Fotakis, S. Kontogiannis and P. G. Spirakis, "Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost", Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA 2005), T. Erlebach and G. Persiano eds., pp. 161–175, Vol. 3879, Lecture Notes in Computer Science, Springer-Verlag, Ibiza, Spain, October 2005.

9. T. Lucking, "Analyzing Models for Scheduling and Routing", Ph. D. Thesis, Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, June 2005.
    

7 citations:

1. T. Antoniou, I. Chatzigiannakis, G. Mylonas, S. Nikoletseas and A. Boukerche, "A New Energy Efficient and Fault-tolerant Protocol for Data Propagation in Smart Dust Networks Using Varying Transmission Range", Proceedings of the 37th Annual Simulation Symposium (ANSS 2004), pp. 43-53, Arlington, Virginia, April 2004.

2. A. Boukerche, I. Chatzigiannakis and S. Nikoletseas, "Power-Efficient Data Propagation Protocols for Wireless Sensor Networks", SIMULATION: Transactions of the Society for Modeling and Simulation, Special Issue on Modeling and Simulation of Emerging Wireless and Sensor Network Technologies and Applications, Vol. 81, No. 6, pp. 399–411, June 2005.

3. I. Chatzigiannakis, T. Dimitriou, S. Nikoletseas and P. G. Spirakis, "A Probabilistic Algorithm for Efficient and Robust Data Propagation in Smart Dust Networks", Proceedings of the 5th European Wireless Conference on Mobile and Wireless Systems Beyond 3G (EW 2004), pp. 344–350, Barcelona, Spain, February 2004.

4. I. Chatzigiannakis, S. Nikoletseas and P. G. Spirakis, "Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks", Mobile Networks and Applications, Vol. 10, No. 1–2, pp. 133–149, February 2005.

5. C. Efthymiou, S. Nikoletseas and J. Rolim, "Energy Balanced Data Propagation in Wireless Sensor Networks", Proceedings of the 18th Parallel and Distributed Processing Symposium (IPDPS 2004), pp. 225–233, Santa Fe, New Mexico, April 2004.

6. P. Leone, P. Albuquerque, C. Mazza and J. Rolim, "A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol", Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms (WEA 2005), S. Nikoletseas ed., pp. 341–353, Vol. 3505, Lecture Notes in Computer Science, Springer-Verlag, Santorini, Greece, May 2005.

7. P. Leone and J. Rolim, "Towards a Dynamical Model for Wireless Sensor Networks", Theoretical Computer Science, Vol. 344, No. 1, pp. 69–85, November 2005.
    

6 citations:

1. H. Brit, S. Moran and G. Taubenfeld, “Public Data Structures: Counters as a Special Case", Theoretical Computer Science, Vol. 289, No. 1, pp. 401–423, November 2002.

2. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

3. C. Busch and M. Herlihy, "Sorting and Counting Networks of Small Depth and Arbitrary Width", Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1999), pp. 64–73, June 1999.

4. C. Busch and M. Herlihy, "Sorting and Counting Networks of Arbitrary Width and Small Depth", Theory of Computing Systems, Vol. 35, No. 2, pp. 99–128, January 2002.

5. P. Fatourou and M. Herlihy, "Adding Networks", Proceedings of the 15th International Symposium on DIStributed Computing (DISC 2001), J. L. Welch ed., pp. 330–342, Vol. 2180, Lecture Notes in Computer Science, Springer-Verlag, Lisbon, Portugal, October 2001.

6. P. Fatourou and M. Herlihy, “Read-Modify-Write Networks", Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.
    

6 citations:

1. C. Alvarez, M. Blesa, J. Diaz, A. Fernandez and M. Serna, “Adversarial Models for Priority-Based Networks", Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtas eds., pp. 142–151, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

2. C. Alvarez, M. Blesa, J. Diaz, A. Fernandez and M. Serna, “Adversarial Models for Priority-Based Networks", Networks, Vol. 45, No. 1, pp. 23–35, January 2005.

3. C. Alvarez, M. Blesa and M. Serna, “A Characterization of Universal Stability in the Adversarial Queuing Model", SIAM Journal on Computing, Vol. 34, No. 1, pp. 41–66, October 2004.

4. C. Alvarez, M. Blesa and M. Serna, “The Impact of Failure Management on the Stability of Communication Networks", Proceedings of the 10th IEEE International Conference on Parallel and Distributed Systems (ICPADS 2004), pp. 153–160, July 2004.

5. D. Koukopoulos, "Network Stability under the Adversarial Queueing Theory Model", Ph. D. Thesis, Department of Computer Science and Engineering, University of Patras, Rion, October 2003.

6. D. Koukopoulos and S. D. Nikolopoulos, "Heterogenous Networks Can Be Unstable at Arbitrary Low Injection Rates", Proceedings of the 6th Conference on Algorithms and Complexity (CIAC 2006), T. Calamoneri, I. Finocchi and G. F. Italiano eds., pp. 93–104, Vol. 3998, Lecture Notes in Computer Science, Springer-Verlag, Rome, Italy, May 2006.

5 citations:

1. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

2. P. Fatourou and M. Herlihy, "Adding Networks", Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 308–310, August 2001.

3. P. Fatourou and M. Herlihy, "Adding Networks", Proceedings of the 15th International Symposium on DIStributed Computing (DISC 2001), J. L. Welch ed., pp. 330–342, Vol. 2180, Lecture Notes in Computer Science, Springer-Verlag, Lisbon, Portugal, October 2001.

4. P. Fatourou and M. Herlihy, “Read-Modify-Write Networks", Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.

5. M. Moir, D. Nussbaum, O. Shalev and N. Shavit, "Using Elimination to Implement Scalable FIFO Queues", Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 253–262, June 2005.
    

5 citations:

1. J. Aspnes, M. Herlihy and N. Shavit, “Counting Networks", Journal of the ACM, Vol. 41, No. 5, pp. 1020–1048, September 1994.

2. H. Brit, S. Moran and G. Taubenfeld, “Public Data Structures: Counters as a Special Case", Theoretical Computer Science, Vol. 289, No. 1, pp. 401–423, November 2002.

3. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

4. C. Busch and M. Herlihy, "A Survey on Counting Networks", Proceedings of Workshop on Distributed Data and Structures (WDAS 1998), pp. 13–20, Orlando, Florida, March 1998.

5. C. Dwork, M. Herlihy and O. Waarts, “Contention in Shared Memory Algorithms", Journal of the ACM, Vol. 44, No. 6, pp. 779–805, November 1997.
    

5 citations:

1. C. Alvarez, M. Blesa, J. Diaz, A. Fernandez and M. Serna, “Adversarial Models for Priority-Based Networks", Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), B. Rovan and P. Vojtas eds., pp. 142–151, Vol. 2747, Lecture Notes in Computer Science, Springer-Verlag, Bratislava, Slovak Republic, August 2003.

2. R. Bhattacharjee and A. Goel, "Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model", Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 160–167, October 2003.

3. M. Blesa, "Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model", Proceedings of the 19th International Symposium on DIStributed Computing (DISC 2005), P. Fraigniaud ed., pp. 429–441, Vol. 3724, Lecture Notes in Computer Science, Springer- Verlag, Cracow, Poland, September 2005.

4. M. Blesa, D. Calzada, A. Fernandez, L. Lopez, A. L. Martinez, A. Santos and M. J. Serna, "Adversarial Queueing Model for Continuous Network Dynamics", Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), J. Jedrzejowicz and A. Szepietowski eds., pp. 144–155, Vol. 3618, Lecture Notes in Computer Science, Springer-Verlag, Gdansk, Poland, August/September 2005.

5. J. Echague, V. Cholvi and A. Fernandez, "Universal Stability Results for Low Rate Adversaries in Packet Switched Networks", IEEE Communications Letters, Vol. 7, No. 12, pp. 578–580, December 2003.
    

4 citations:

1. I. Rhee, “Efficiency of Partial Synchrony, and Resource Allocation in Distributed Systems", Ph. D. Dissertation, Department of Computer Science, University of North Carolina, Chapel Hill, June 1994.

2. I. Rhee and J. L. Welch, “The Impact of Time on the Session Problem", Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing (PODC 1992), pp. 191–202, August 1992.

3. I. Rhee and J. L. Welch, “Time Bounds on Synchronization in a Periodic Distributed System", Information Processing Letters, Vol. 64, No. 2, pp. 87–93, October 1997.

4. I. Rhee and J. L. Welch, “The Impact of Timing Knowledge on the Session Problem", SIAM Journal on Computing, Vol. 32, No. 4, pp. 1007–1039, June/July 2003.
    

5 citations:

1. S. Aland, "The Price of Anarchy for Bayesian Routing Games and Polynomial Congestion Games", Diplomarbeit, Fakultat fur Elektrotechnic, Informatik und Mathematik, Universitat Parderborn, Paderborn, November 2006.

2. E. Angel, E. Bampis and F. Pascual, "Algorithmic Game Theory and Scheduling", Chapter 81 in Handbook of Approximation Algorithms and Metaheuristics, pp. 81-1---81-20, Chapman & Hall/CRC, Computer and Information Science Series, 2007.

3. S. Fischer and B. Vocking, "On the Structure and Complexity of Worst-Case Equilibria", Proceedings of the 1st International Workshop on Internet and Network Economics (WINE 2005), X. Deng and Y. Ye eds., pp. 151-160, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, Hong Kong, China, December 2005.

4. P. W. Goldberg, "Bounds for the Convergence Rate of Randomized Local Search in a Multiplayer, Load-Balancing Game", Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 131-140, July 2004.

5. N. E. Stier-Moses, "Selfish versus Coordinated Routing in Network Games", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, June 2004.

3 citations:

1. M. D. Riedel and J. Bruck, “Tolerating Faults in Counting Networks", Technical Report Paradise ETR-022, Department of Computer Science, California Institute of Technology, Pasadena, April 1998.

2. N. Shavit and D. Touitou, "Elimination Trees and the Construction of Pools and Stacks", Theory of Computing Systems, Vol. 30, No. 6, pp. 545–570, November/December 1997.

3. R. Wattenhofer and P. Widmayer, “Distributed Counting at Maximum Speed", Technical Report, Institut fur Theoretische Informatik, Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, January 1998.

3 citations:

1. R. Hoffmann, M. Korch and T. Rauber, "Performance Evaluation of Task Pools Based on Hardware Synchronization", Proceedings of the ACM/IEEE Conference on High Performance Networking and Computing, pp. 44–58, November 2004.

2. D. Koukopoulos, "Network Stability under the Adversarial Queueing Theory Model", Ph. D. Thesis, Department of Computer Science and Engineering, University of Patras, Rion, October 2003.

3. D. Koukopoulos and S. D. Nikolopoulos, "Heterogenous Networks Can Be Unstable at Arbitrary Low Injection Rates", Proceedings of the 6th Conference on Algorithms and Complexity (CIAC 2006), T. Calamoneri, I. Finocchi and G. F. Italiano eds., pp. 93–104, Vol. 3998, Lecture Notes in Computer Science, Springer-Verlag, Rome, Italy, May 2006.
    

2 citations:

1. M. Blesa, "On the Use of Topology Extensions for Provoking Instability in Communication Networks", Proceedings of Information Society 2004, subconference on Theoretical Computer Science (IS04-TCS), Slovenian ACM Chapter. pp. 197–199, October 2004.

2. D. Koukopoulos, "Network Stability under the Adversarial Queueing Theory Model", Ph. D. Thesis, Department of Computer Science and Engineering, University of Patras, Rion, October 2003.

2 citations:

1. B. Awerbuch and Y. Shavitt, “Convergence to Approximated Max-Min Flow Fairness in Logarithmic Time", Proceedings of IEEE Conference on Computer Communications (INFOCOM 1998), pp. 1350–1357, March/April 1998.

2. P. Fatourou, "Algorithmic Foundations of Fair, Rate-Based Flow Control", Ph. D. Thesis, Department of Computer Engineering and Informatics, University of Patras, Rion, June 1999.
    

2 citations:

1. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.

2. C. Busch and M. Herlihy, "A Survey on Counting Networks", Proceedings of Workshop on Distributed Data and Structures (WDAS 1998), pp. 13–20, Orlando, Florida, March 1998.
    

2 citations:

1. N. Mittal and V. K. Garg, "Consistency Conditions for Multi-Object Distributed Operations", Proceedings of the 18th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), pp. 582–599, May 1998.

2. S. Moriya, K. Suda, M. Inoue, T. Masuzawa and H. Fujiwara, "Wait-free Linearizable Distributed Shared Memory", IEICE Transactions on Information and Systems, pp. 1611–1621, Vol. E83-D, No. 8, August 2000.
    

2 citations:

1. H. Attiya and J. L. Welch, “Distributed Computing: Fundamentals, Simulations, and Advanced Topics", 2nd edition, John Wiley and Sons Inc., March 2004.****

2. F. Fich and E. Ruppert, “Hundreds of Impossibility Results in Distributed Computing", Distributed Computing, Vol. 16, Nos. 2&3, pp. 121–163, September 2003.
    

2 citations:

1. E. Borowsky and E. Gafni, “A Simple Algorithmically Reasoned Characterization of Wait-Free Computation", Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC 1997), pp. 189–198, August 1997.

2. E. Schenk, "Computability and Complexity Results for Agreement Problems in Shared Memory Distributed Systems", Ph. D. Thesis, Department of Computer Science, University of Toronto, Toronto, 1996.
    

2 citations:

1. G. Della-Libera and N. Shavit, "Reactive Diffracting Trees", Journal of Parallel and Distributed Computing, Vol. 60, No. 7, pp. 853–890, July 2000.

2. N. Shavit and A. Zemach, “Diffracting Trees", ACM Transactions on Computer Systems, Vol. 14, No. 4, pp. 385–428, November 1996.
    

1 citation:

1. C. Busch, S. Kelkar and M. Magdon-Ismail, "Efficient Bufferless Routing on Leveled Networks", Proceedings of the 11th European Conference on Parallel Processing (Euro-Par 2005), J. C. Cunha and P. D. Medeiros eds., pp. 931–940, Vol. 3648, Lecture Notes in Computer Science, Springer-Verlag, Portugal, Lisbon, August/September 2005.

1 citation:

1. D. Dumrauf and M. Gairing, "Price of Anarchy for Polynomial Wardrop Games", Proceedings of the 2nd International Workshop on Internet and Network Economics (WINE 2006), P. Spirakis, M. Mavronicolas and S. Kontogiannis eds., pp. 319-330, Vol. 4286, Lecture Notes in Computer Science, Springer-Verlag, Patras, Greece, December 2006.

1 citation:

1. S. Angelov, S. Khanna and K. Kunal, "The Network as a Storage Device: Dynamic Routing with Bounded Buffers", Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 9th International Workshop on Randomization and Computation (APPROX 2005 + RANDOM 2005), C. Chekuri, K. Jansen, J. D. P. Rolim and L. Trevisan eds., pp. 1–13, Vol. 3624, Lecture Notes in Computer Science, Springer-Verlag, UC Berkeley, August 2005.

1 citation:

1. C. Busch, S. Kelkar and M. Magdon-Ismail, "Efficient Bufferless Routing on Leveled Networks", Proceedings of the 11th European Conference on Parallel Processing (Euro-Par 2005), J. C. Cunha and P. D. Medeiros eds., pp. 931–940, Vol. 3648, Lecture Notes in Computer Science, Springer-Verlag, Portugal, Lisbon, August/September 2005.
    

1 citation:

1. M. Blesa, D. Calzada, A. Fernandez, L. Lopez, A. L. Martinez, A. Santos and M. J. Serna, "Adversarial Queueing Model for Continuous Network Dynamics", Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), J. Jedrzejowicz and A. Szepietowski eds., pp. 144–155, Vol. 3618, Lecture Notes in Computer Science, Springer-Verlag, Gdansk, Poland, August/September 2005.
    

1 citation:

1. C. Alvarez, M. Blesa and M. Serna, “The Impact of Failure Management on the Stability of Communication Networks", Proceedings of the 10th IEEE International Conference on Parallel and Distributed Systems (ICPADS 2004), pp. 153–160, July 2004.
    

1 citation:

1. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.
    

1 citation:

1. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.
    

1 citation:

1. P. Fatourou, "Algorithmic Foundations of Fair, Rate-Based Flow Control", Ph. D. Thesis, Department of Computer Engineering and Informatics, University of Patras, Rion, June 1999.
    

1 citation:

1. P. Fatourou, "Algorithmic Foundations of Fair, Rate-Based Flow Control", Ph. D. Thesis, Department of Computer Engineering and Informatics, University of Patras, Rion, June 1999.
    

1 citation:

1. M. Smith, "Reliable Message Delivery and Conditionally-Fast Transactions are not Possible without Accurate Clocks", Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 163–171, June/July 1998.
    

1 citation:

1. P. Fatourou, "Algorithmic Foundations of Fair, Rate-Based Flow Control", Ph. D. Thesis, Department of Computer Engineering and Informatics, University of Patras, Rion, June 1999.
    

1 citation:

1. D. Koukopoulos, "Network Stability under the Adversarial Queueing Theory Model", Ph. D. Thesis, Department of Computer Science and Engineering, University of Patras, Rion, October 2003.
    

1 citation:

1. C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department of Computer Science, Brown University, Providence, April 2000.
    

1 citation:

1. N. Shavit and A. Zemach, “Diffracting Trees", ACM Transactions on Computer Systems, Vol. 14, No. 4, pp. 385–428, November 1996.
    

1 citation:

1. S. Tirthapura and C. Busch, "Concurrent Counting is Harder than Queuing", CD-ROM Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes, Greece, April 2006.
    

1 citation:

1. D. Koukopoulos and S. D. Nikolopoulos, "Heterogenous Networks Can Be Unstable at Arbitrary Low Injection Rates", Proceedings of the 6th Conference on Algorithms and Complexity (CIAC 2006), T. Calamoneri, I. Finocchi and G. F. Italiano eds., pp. 93–104, Vol. 3998, Lecture Notes in Computer Science, Springer-Verlag, Rome, Italy, May 2006.
    

1 citation:

1. S. Chaudhuri, R. Gawlick and N. Lynch, “Designing Algorithms for Distributed Systems Using Partially Synchronized Clocks", Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 121–132, August 1993.
    

Foot notes

* This thesis received the 2004 George M. Sprowls Award for Best Doctoral Dissertation in Computer Science at Massachusetts Institute of Technology. It also received an Honorable Mention in 2004 ACM Doctoral Dissertation Award Competition.

** This thesis received an Honorable Mention in 2002 ACM Doctoral Dissertation Award Competition.

*** A result of H. Attiya and M. Mavronicolas from (J2) is stated and proved in this book as Theorem 6.11. Also, Exercise 9.6 in this book is based on a result of M. Mavronicolas and D. Roth from (C3)

**** A result of H. Attiya and M. Mavronicolas from (J2) is stated and proved in this book as Theorem 6.11. Also, Exercise 9.6 in this book is based on a result of M. Mavronicolas and D. Roth from (J9)

*****A result of H. Attiya and M. Mavronicolas from (J2) is stated and proved in this book as Theorem 16.11.