Here is a
pdf catalogue with my citations.
80 citations:

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.

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

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.

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

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

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

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. 3441, Haifa, Israel, June 2005.

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. 196205, June 2004.

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. 5766, May
2005.

B. Awerbuch,
Y. Azar,
Y. Richter and
D. Tsur, "Tradeoffs
in WorstCase Equilibria", Proceedings of the 1st
International Workshop on Approximation and Online Algorithms (WAOA
2003),
K. Jansen and
R. SolisOba eds., pp. 4152,
Vol. 2909, Lecture Notes in Computer Science, SpringerVerlag,
Budapest, Hungary, September 2003.

B. Awerbuch,
Y. Azar,
Y. Richter and
D. Tsur, "Tradeoffs
in WorstCase Equilibria",
Theoretical Computer Science,
Vol. 361, Nos. 23, pp. 200209, September 2006.

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

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

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

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

V. Bilo, M.
Flammini and L. Moscardelli, "On Nash Equilibria in
Noncooperative AllOptical Networks", Proceedings of the22nd
Annual Symposium on Theoretical Aspects of Computer Science (STACS
2005), V. Diekert and
B. Durand eds., pp. 448459,
Vol. 3404, Lecture Notes in Computer Science, SpringerVerlag,
Stuttgart, Germany, February 2005.

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

C. Busch and
M. MagdonIsmail, "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, SpringerVerlag, Hong Kong,
China, June 2006.

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. 311322, Vol. 4051, Lecture Notes in Computer
Science, SpringerVerlag, Venice, Italy, July 2006.

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, SpringerVerlag, Zurich, Switzerland,
September 2006, to appear.

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

I. Chatzigiannakis,
S. Nikoletseas
and
P. G. Spirakis,
"On the Average and Worstcase Efficiency of Some New Distributed
Communication and Control Algorithms for Adhoc Mobile Networks",
Proceedings of the 1st ACM Workshop on Principles of Mobile
Computing (POMC 2001),
pp. 119, August 2001.

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. 6773, May
2005.

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.
5970, Vol. 3669, Lecture Notes in Computer Science, SpringerVerlag,
Palma de Mayorca, Spain, October 2005.

J. R. Correa,
A. S. Schulz and
N. E. StierMoses, "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. 5973, Vol.
3064, Lecture Notes in Computer Science, SpringerVerlag, New York,
June 2004.

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

A. Czumaj and
B. Vocking, "Tight Bounds for WorstCase Equilibria",
Proceedings of the 13th Annual ACMSIAM Symposium on Discrete
Algorithms (SODA 2002), pp. 413420, January 2002.

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. 287296, May
2002.

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. 319330, Vol. 4286, Lecture Notes in
Computer Science, SpringerVerlag, Patras, Greece, December 2006.

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. 347351, July 2003.

P. Fanelli,
M. Flammini,
G. Melideo and L. Moscardelli, "Multicast Transmissions in Noncooperative
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. 363374, Vol. 4162, Lecture Notes in Computer Science,
SpringerVerlag, Stara Lesna, Slovakia, August/September 2006.

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. 514526, Vol. 2719, Lecture Notes
in Computer Science, SpringerVerlag, Eindhoven, The Netherlands,
June/July 2003.

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

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

R. Feldmann,
M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in NonCooperative 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. 373401, World
Scientific Company, 2004.

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.

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. 4960, Vol. 3104, Lecture Notes in Computer Science, SpringerVerlag,
Smolenice Castle, Slovak Republic, June 2004.

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. 323334, Vol. 3221,
Lecture Notes in Computer Science, SpringerVerlag, Bergen, Norway,
September 2004.

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

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

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. 572583, Vol. 4051, Lecture Notes in
Computer Science, SpringerVerlag, Venice, Italy, July 2006.

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. 593605, Vol. 3142, Lecture Notes in Computer
Science, SpringerVerlag, Turku, Finland, July 2004.

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.

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. 161175, Vol. 3879, Lecture Notes in Computer
Science, SpringerVerlag, Ibiza, Spain, October 2005.

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. 5165, Vol. 3580,
Lecture Notes in Computer Science, SpringerVerlag, Lisboa,
Portugal, July 2005.

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. 203212, June 2005.

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

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

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

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. 501510, April 2002.

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. *

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

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

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. 696704, Vol. 2906, Lecture
Notes in Computer Science, SpringerVerlag, Kyoto, Japan, December
2003.

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. 7788, Vol. 3503, Lecture Notes in Computer
Science, SpringerVerlag, Santorini, Greece, May 2005.

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

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.
1928, July/August 2006.

S. Kontogiannis,
"MultipleChoice Assignments on Uniformly Related Machines",
Technical Report ALCOMFTTR0239, ALCOMFT Technical Report Series,
2002.

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

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

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. 9891002, Vol. 3828, Lecture Notes in
Computer Science, SpringerVerlag, Hong Kong, China, December 2005.

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

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

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.

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.

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

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. 48, October 2001.

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.

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

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

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. 428437, May 2002.

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

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

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

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

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

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

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. 94101, March 2004.

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. MeinecheSchmidt eds., pp. 197228, Vol. 2547,
Lecture Notes in Computer Science, SpringerVerlag, January 2002.

N. E. StierMoses,
"Selfish versus Coordinated Routing in Network Games",
Ph. D. Thesis, Sloan School of Management, Massachusetts Institute
of Technology, Cambridge, June 2004.
(C24)
D. Fotakis,
S. Kontogiannis,
E. Koutsoupias, M. Mavronicolas and
P. G. Spirakis,
"The
Structure and Complexity of Nash Equilibria for a Selfish Routing Game",
Proceedings of the 29th International Colloquium on Automata, Languages
and Programming (ICALP 2002),
P. Widmayer, F. Triguero, R. Morales,
M.
Hennessy,
S. Eidenbenz and R. Conejo eds., pp. 123134, Vol.
2380,
Lecture Notes in Computer Science,
SpringerVerlag, Malaga, Spain,
July 2002.

60 citations

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.

S. Albers,
S.
Eilts, E. EvenDar,
Y. Mansour and
L. Roditty,
"On Nash Equilibria for a Network Creation Game",
Proceedings of the17th Annual ACMSIAM Symposium on Discrete
Algorithms (SODA 2006), pp. 8998, February 2006.

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 TR05031, March
2005.

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. 95106, Vol. 3618, Lecture Notes in
Computer Science, SpringerVerlag, Gdansk, Poland, August/September
2005.

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. 634643, Vol. 3827, Lecture Notes
in Computer Science, SpringerVerlag, Hainan, China, December 2005.

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

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. 196205, June 2004.

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

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

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

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

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

V. Bilo, M.
Flammini and L. Moscardelli, "On Nash Equilibria
in Noncooperative AllOptical Networks", Proceedings of the
22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS
2005), V. Diekert and
B. Durand eds., pp.
448459, Vol. 3404, Lecture Notes in Computer Science, SpringerVerlag,
Stuttgart, Germany, February 2005.

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

C. Busch
and
M. MagdonIsmail, "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, SpringerVerlag, Hong Kong,
China, June 2006.

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. 311322, Vol. 4051, Lecture Notes in Computer
Science, SpringerVerlag, Venice, Italy, July 2006.

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. 809818, Vol. 3827, Lecture Notes in Computer Science,
SpringerVerlag, Hainan, China, December 2005.

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, SpringerVerlag, Zurich, Switzerland, September
2006, to appear.

J. R. Correa,
A. S. Schulz and N.
E. StierMoses, "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. 5973, Vol.
3064, Lecture Notes in Computer Science, SpringerVerlag, New York,
New York, June 2004.

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

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.

E. EvenDar,
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. 502513, Vol. 2719, Lecture Notes in
Computer Science, SpringerVerlag, Eindhoven, The Netherlands,
June/July 2003.

E. EvenDar and
Y. Mansour, "Fast Convergence of Selfish Rerouting",
Proceedings of the
16th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2005),
pp. 772781, January 2005.

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. 604612, June 2004.

P. Fanelli,
M. Flammini, G. Melideo and L. Moscardelli,
"Multicast Transmissions in Noncooperative 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. 363374, Vol. 4162, Lecture Notes in Computer Science,
SpringerVerlag, Stara Lesna, Slovakia, August/September 2006.

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. 514526, Vol. 2719, Lecture Notes in
Computer Science, SpringerVerlag, Eindhoven, The Netherlands,
June/July 2003.

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

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

R. Feldmann,
M. Gairing, T. Lucking, B. Monien and M. Rode,
"Selfish Routing in NonCooperative 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. 373401, World
Scientific Company, 2004.

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. 4960, Vol. 3104, Lecture Notes in Computer Science, SpringerVerlag,
Smolenice Castle, Slovak Republic, June 2004.

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. 323334, Vol. 3221, Lecture Notes in Computer Science, SpringerVerlag, Bergen,
Norway, September 2004.

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

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

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. 572583, Vol. 4051, Lecture
Notes in Computer Science, SpringerVerlag, Venice, Italy, July 2006

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. 593605, Vol. 3142, Lecture Notes in Computer
Science, SpringerVerlag, Turku, Finland, July 2004.

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.

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.
161175, Vol. 3879, Lecture Notes in Computer Science, SpringerVerlag,
Ibiza, Spain,
October 2005.

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. 5165, Vol. 3580,
Lecture Notes in Computer Science, SpringerVerlag, Lisboa,
Portugal, July 2005.

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. 203212, June 2005.

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

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

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

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

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. 215230, Bloomington, Indiana, June 2003.

G. Gottlob,
G. Greco and
F. Scarcello, "Pure Nash Equilibria: Hard
and Easy Games", Journal of Artificial Intelligence Research,
pp. 357406, Vol. 24, JulyDecember 2005.

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. 7788, Vol. 3503, Lecture Notes in Computer
Science, SpringerVerlag, Santorini, Greece, May 2005.

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

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.
1928, July/August 2006.

A. Kesselman,
S. Leonardi and V. Bonifaci, "GameTheoretic 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. 236245,
Vol. 3828, Lecture Notes in Computer Science, SpringerVerlag, Hong
Kong, China, December 2005.

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

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. 9891002, Vol. 3828,
Lecture Notes in Computer Science, SpringerVerlag, Hong Kong,
China, December 2005.

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. LopezOrtiz and A.
M. Hamel eds., pp. 1327, Vol. 3045, Lecture Notes in Computer
Science, SpringerVerlag, Banff, Alberta, Canada, August 2004.

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

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

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.

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.
203215, Vol. 3502,
Lecture Notes in Computer Science, SpringerVerlag, Santorini,
Greece, May 2005.

C. H. Papadimitriou,
"Computing Correlated Equilibria in MultiPlayer Games",
Proceedings of the 37th Annual ACM Symposium on Theory of Computing
(STOC 2005), pp. 4956, May 2005.

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.

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

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

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

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.

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, SpringerVerlag,
Marseille, France, February 2006.

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

C. Busch
and
M. MagdonIsmail, "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, SpringerVerlag, Hong Kong, China, June
2006.

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. 311322, Vol. 4051, Lecture Notes in
Computer Science, SpringerVerlag, Venice, Italy, July 2006

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. 809818, Vol. 3827, Lecture Notes in Computer Science,
SpringerVerlag, Hainan, China, December 2005.

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, SpringerVerlag, Zurich, Switzerland, September
2006, to appear.

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. 6773, May
2005.

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. 5970, Vol. 3669, Lecture Notes in Computer Science, SpringerVerlag,
Palma de Mayorca, Spain, October 2005.

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.

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. 4960, Vol. 3104, Lecture Notes in Computer Science, SpringerVerlag,
Smolenice Castle, Slovak Republic, June 2004.

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. 323334, Vol. 3221, Lecture Notes in Computer Science, SpringerVerlag, Bergen,
Norway, September 2004.

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

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

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. 161175, Vol. 3879, Lecture Notes in Computer
Science, SpringerVerlag, Ibiza, Spain, October 2005.

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. 5165, Vol. 3580, Lecture Notes in Computer Science,
SpringerVerlag, Lisboa, Portugal, July 2005.

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. 828839, Vol. 3580, Lecture Notes in Computer
Science, SpringerVerlag, Lisboa, Portugal, July 2005.

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. 203212, June 2005.

M. Gairing,
B. Monien
and K. Tiemann, "Routing (Un)Splittable
Flow in Games with PlayerSpecific 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. 501512, Vol. 4051, Lecture Notes in Computer
Science, SpringerVerlag, Venice, Italy, July 2006.

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. 5569, Vol. 3828, Lecture Notes in Computer Science,
SpringerVerlag, Hong Kong, China, December 2005.

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. 17779, Vol. 3153, Lecture Notes in
Computer Science, SpringerVerlag, Prague, Czech Republic, August
2004.

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.

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.

T. Roughgarden,
"Selfish Routing and the Price of Anarchy",
The MIT
Press, 2004.
(J16)
E. Koutsoupias, M. Mavronicolas
and P. G. Spirakis,
"Approximate Equilibria and Ball Fusion",
Theory of Computing Systems,
Special Issue with
selected papers from
9th International Colloquium on Structural Information and
Communication Complexity (SIROCCO 2002) (Andros, Greece, June 2002),
Ch. Kaklamanis
and
L. M. Kirousis guests eds., Vol. 36, No. 6,
pp. 683693, November 2003.

25 citations:

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.

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, SpringerVerlag, Marseille,
France, February 2006.

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

P. Berenbrink,
T. Friedetzky,
Z. Hu and R. Martin,
"On
Weighted BallsintoBins Games", Proceedings of the 22nd
Annual Symposium on Theoretical Aspects of Computer Science (STACS
2005), V. Diekert and
B. Durand
eds., pp. 231243,
Vol. 3404, Lecture Notes in Computer Science, SpringerVerlag,
Stuttgart, Germany, February 2005.

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. 311322, Vol. 4051, Lecture Notes in Computer
Science, SpringerVerlag, Venice, Italy, July 2006.

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, SpringerVerlag, Zurich, Switzerland,
September 2006, to appear.

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. 287296, May
2002.

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.

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

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

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. 572583, Vol. 4051,
Lecture Notes in Computer Science, SpringerVerlag, Venice, Italy,
July 2006.

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. 593605, Vol. 3142, Lecture Notes in Computer
Science, SpringerVerlag, Turku, Finland, July 2004.

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.

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. 161175, Vol. 3879, Lecture Notes in Computer
Science, SpringerVerlag, Ibiza, Spain, October 2005.

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. 5165, Vol. 3580, Lecture Notes in Computer Science, SpringerVerlag,
Lisboa, Portugal, July 2005.

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.
203212, June 2005.

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

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

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

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. 9891002, Vol. 3828, Lecture Notes in Computer Science, SpringerVerlag,
Hong Kong, China, December 2005.

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.

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.

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.

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

N. E. StierMoses, "Selfish versus Coordinated Routing in Network
Games", Ph. D. Thesis, Sloan School of Management, Massachusetts Institute
of Technology, Cambridge, June 2004.
(C33)
T. Lucking,
M. Mavronicolas, B. Monien and
M. Rode,
"A New Model for Selfish Routing",
Proceedings of the 21st International Symposium on Theoretical Aspects Of Computer
Science (STACS 2004),
V. Diekert and
M. Habib eds., pp.
547558, Vol. 2996,
Lecture Notes in Computer Science,
SpringerVerlag,
Montpellier, France, March 2004.

20 citations:

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.

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, SpringerVerlag, Marseille,
France, February 2006.

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. 5766, May
2005.

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

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

C. Busch and
M. MagdonIsmail, "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, SpringerVerlag, Hong Kong,
China, June 2006.

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. 311322, Vol. 4051, Lecture Notes in Computer
Science, SpringerVerlag, Venice, Italy, July 2006

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, SpringerVerlag, Zurich, Switzerland,
September 2006, to appear.

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. 6773, May
2005.

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.
5970, Vol. 3669, Lecture Notes in Computer Science, SpringerVerlag,
Palma de Mayorca, Spain, October 2005.

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. 593605, Vol. 3142, Lecture Notes in Computer
Science, SpringerVerlag, Turku, Finland, July 2004.

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. 161175, Vol. 3879, Lecture Notes in Computer
Science, SpringerVerlag, Ibiza, Spain, October 2005.

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.
203212, June 2005.

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. 10661075, Vol. 3828, Lecture
Notes in Computer Science, SpringerVerlag, Hong Kong, China,
December 2005.

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

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

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

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. 9891002, Vol. 3828, Lecture Notes in
Computer Science, SpringerVerlag, Hong Kong, China, December 2005.

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.

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.
(C32)
M. Gairing,
T. Lucking,
M. Mavronicolas, B. Monien and
P. G. Spirakis,
"Extreme Nash Equilibria",
Proceedings of the 8th Italian Conference on Theoretical Computer Science
(ICTCS 2003),
C. Blundo and
C.
Laneve eds., pp. 120,
Vol. 2841,
Lecture Notes in Computer Science,
SpringerVerlag, Bertinoro,
Italy, October 2003.

21 citations:

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

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

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

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. 514526, Vol. 2719, Lecture Notes
in Computer Science, SpringerVerlag, Eindhoven, The Netherlands,
June/July 2003.

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

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

R. Feldmann,
M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in NonCooperative 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. 373401, World
Scientific Company, 2004.

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

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

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. 593605, Vol. 3142, Lecture Notes
in Computer Science, SpringerVerlag, Turku, Finland, July 2004.

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. 5165, Vol. 3580,
Lecture Notes in Computer Science, SpringerVerlag, Lisboa,
Portugal, July 2005.

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. 203212, June 2005.

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

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

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

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. 9891002, Vol. 3828, Lecture Notes in Computer
Science, SpringerVerlag, Hong Kong, China, December 2005.

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.

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.

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.

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

N. E. StierMoses,
"Selfish versus Coordinated Routing in Network Games", Ph. D.
Thesis, Sloan School of Management, Massachusetts Institute of
Technology, Cambridge, June 2004.
(C30)
T. Lucking,
M. Mavronicolas,
B. Monien,
M. Rode,
P. G. Spirakis and
I. Vrto,
"Which is the WorstCase
Nash Equilibrium?", Proceedings of the 26th International Symposium
on Mathematical Foundations of Computer Science (MFCS 2003),
B. Rovan
and P. Vojtas eds., pp. 551561, Vol. 2747,
Lecture Notes in Computer Science,
SpringerVerlag, Bratislava, Slovak Republic, August
2003.

20 citations:

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.

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

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

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

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

R. Feldmann,
M. Gairing, T. Lucking, B. Monien and M. Rode, "Selfish Routing in NonCooperative 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. 373401, World
Scientific Company, 2004.

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. 593605, Vol. 3142, Lecture Notes
in Computer Science, SpringerVerlag, Turku, Finland, July 2004.

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. 5165, Vol. 3580,
Lecture Notes in Computer Science, SpringerVerlag, Lisboa,
Portugal, July 2005.

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. 203212, June 2005.

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

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

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

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. 9891002, Vol. 3828, Lecture Notes in Computer
Science, SpringerVerlag, Hong Kong, China, December 2005.

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

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

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.

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.

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.

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

N. E. StierMoses,
"Selfish versus Coordinated Routing in Network Games", Ph. D.
Thesis, Sloan School of Management, Massachusetts Institute of
Technology, Cambridge, June 2004.
(C25)
E. Koutsoupias, M. Mavronicolas
and
P. G. Spirakis, "Approximate Equilibria and Ball Fusion",
Proceedings of the 9th International Colloquium on Structural Information
and Communication Complexity (SIROCCO 2002),
Ch. Kaklamanis and
L. M. Kirousis eds., pp. 223235,
Proceedings in Informatics 13,
Carleton Scientific, Andros, Greece, June 2002.

16 citations:

C. Busch and
M. MagdonIsmail, "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, SpringerVerlag, Hong Kong,
China, June 2006.

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. 6773, May
2005.

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.
5970, Vol. 3669, Lecture Notes in Computer Science, SpringerVerlag,
Palma de Mayorca, Spain, October 2005.

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. 345357, Vol. 3142, Lecture Notes in Computer Science, SpringerVerlag,
Turku, Finland, July 2004.

J. R. Correa,
A. S. Schulz and N. E. StierMoses, "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. 5973, Vol.
3064, Lecture Notes in Computer Science, SpringerVerlag, New York,
New York, June 2004.

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

A. Czumaj and
B. Vocking, "Tight Bounds for WorstCase Equilibria",
Proceedings of the 13th Annual ACMSIAM Symposium on Discrete
Algorithms (SODA 2002), pp. 413420, January 2002.

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. 287296, May 2002.

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

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

R. Feldmann,
M. Gairing, T. Lucking, B. Monien and M. Rode,
"Selfish Routing in NonCooperative 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. 373401, World
Scientific Company, 2004.

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. 4960, Vol. 3104, Lecture Notes in Computer Science, SpringerVerlag,
Smolenice Castle, Slovak Republic, June 2004.

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

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

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

T. Roughgarden,
"Stackelberg Scheduling Strategies",
SIAM Journal on Computing, Vol. 33, No. 2, pp. 332350, January/March 2004.
(C36)
M. Gairing,
T. Lucking,
M. Mavronicolas, B. Monien and
M. Rode,
"Nash Equilibria in Discrete Routing
Games with Convex Latency Functions", Proceedings of the 36th International Colloquium
on Automata, Languages and Programming (ICALP
2004), J. Diaz,
J. Karhumaki, A. Lepisto,
D. Sanella
eds., pp. 645657, Vol. 3142,
Lecture Notes in Computer Science,
SpringerVerlag, Turku, Finland,
July 2004.

15 citations:

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.

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, SpringerVerlag, Marseille,
France, February 2006.

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 TR05031, March
2005.

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.95106, Vol.3618, Lecture Notes in
Computer Science, SpringerVerlag, Gdansk, Poland, August/September
2005.

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.634643, Vol.3827, Lecture Notes in
Computer Science, SpringerVerlag, Hainan, China, December 2005.

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.5766, May
2005.

C. Busch and M. MagdonIsmail, "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, SpringerVerlag, Hong
Kong, China, June 2006.

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.
6773, May 2005.

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. 5970, Vol. 3669, Lecture Notes in Computer Science,
SpringerVerlag, Palma de Mayorca, Spain, October 2005.

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. 161175, Vol. 3879, Lecture Notes in Computer
Science, SpringerVerlag, Ibiza, Spain, October 2005.

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. 5165, Vol. 3580,
Lecture Notes in Computer Science, SpringerVerlag, Lisboa,
Portugal, July 2005.

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. 203212, June 2005.

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.

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.

T. Roughgarden,
"Selfish Routing and the Price of Anarchy",
The MIT
Press,
2004.
(C1)
H. Attiya and M.
Mavronicolas, "Efficiency of
SemiSynchronous versus Asynchronous Networks",
Proceedings of the 28th Annual Allerton Conference on Communication,
Control and Computing (ALLERTON 1990), pp. 578587, Allerton,
Illinois, October 1990.

12 citations:

H. Attiya and
T. DjerassiShintel, "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. 204218, Vol. 725, Lecture
Notes in Computer Science SpringerVerlag, Lausanne, Switzerland,
September 1993.

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.
122152, January 1994.

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. 359369, May 1991.

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

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

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. 4251, May
1993.

T.
DjerassiShintel, "Lower Bounds for Decision Problems in
SemiSynchronous Systems", Master's Thesis, Faculty of Computer
Science, The Technion  Israel Institute of Technology, Haifa,
October 1993.

N. Lynch and
B. PattShamir, "Distributed Algorithms", Lecture Notes
for 6.852, MIT/LCS/RSS20, Research Seminar Series, Laboratory for
Computer Science, Massachusetts Institute of Technology, Cambridge,
January 1993.

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

S. Ponzio,
"The RealTime 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.

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. 125138, August 1991.

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. 191202, August 1992.
12 citations:

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

H. Attiya and
J. L. Welch, "Distributed Computing: Fundamentals,
Simulations, and Advanced Topics", McGrawHill, June 1998.
***

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

F. Fich,
V.
Luchangco, M. Moir and
N. Shavit,
"ObstructionFree Algorithms Can Be Practically WaitFree",
Proceedings of the 19th International Symposium on DIStributed
Computing (DISC 2005),
P. Fraigniaud ed., pp. 7892, Vol.
3724, Lecture Notes in Computer Science, SpringerVerlag, Cracow,
Poland, September 2005.

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

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. 8195, Vol. 1320, Lecture Notes in Computer Science,
SpringerVerlag, Saarbrucken, Germany, September 1997.

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. 247266, June
1999.

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

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

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.

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

I. Rhee and
J. L. Welch, "The Impact of Timing Knowledge on the Session
Problem",
SIAM Journal on Computing, Vol. 32, No. 4, pp.
10071039, June/July 2003.
(C19) S. Georgiades, M. Mavronicolas and
P. G. Spirakis,
"Optimal, Distributed DecisionMaking: The Case of
No Communication", Proceedings of the 12th International Symposium
on Fundamentals of Computation Theory (FCT 1999),
G. Ciobanu and
G.
Paun eds., pp. 293303, Vol. 1684,
Lecture Notes in Computer Science,
SpringerVerlag, Iasi, Romania, August/September 1999.

12 citations:

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

Ch. Georgiou,
A. Russell and
A. A. Shvartsman, "WorkCompetitive
Scheduling for Cooperative Computing with Dynamic Groups",
SIAM Journal on Computing, Vol. 34, No. 4, pp. 848862,
April/May 2005.

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

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

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. 119133, Vol. 1914, Lecture
Notes in Computer Science SpringerVerlag, Toledo, Spain, October
2000.

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.

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. 305307, August 2001.

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. 244255, October 2001.

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. 259274, Vall de Nuria,
Spain, July 2001.

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

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. 120131, June
2002.

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. 315336, World Scientific Company, 2004.
(C31)
I. Chatzigiannakis,
T. Dimitriou, M.
Mavronicolas, S. Nikoletseas
and
P. G. Spirakis,
"A Comparative Study of Protocols
for Efficient Data Propagation in Smart Dust Networks",
Proceedings of the 9th European Conference on Parallel Processing (EuroPar
2003),
H. Kosch,
L. Boszormenyi
and
H. Hellwagner
eds., pp. 10031016, Vol. 2790,
Lecture Notes in Computer Science,
SpringerVerlag, Klagenfurt, Austria, August 2003. (Note:
Accepted as
distinguished paper). 
11 citations:

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

A. Boukerche,
I. Chatzigiannakis and S. Nikoletseas,
"PowerEfficient 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.

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.

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.

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

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.

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.

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 IFIPTC6
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,
SpringerVerlag, Athens, Greece, May 2004.

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.

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.

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 SpringerVerlag, Turku, Finland,
July 2004.
(C12)
C. Busch and M.
Mavronicolas, "An Efficient
Counting Network", Proceedings of
the 1st Merged Symposium
IPPS/SPDP 1998 (12th International Parallel Processing Symposium & 9th
IEEE Symposium on Parallel and Distributed Processing), pp. 380384,
Orlando, Florida, March/April 1998. 
11 citations:

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

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.

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

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.

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.

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, SpringerVerlag, Lisbon, Portugal,
October 2001.

P. Fatourou
and
M.
Herlihy, “ReadModifyWrite Networks",
Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.

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.

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.

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.

R. Wattenhofer,
"Distributed Counting: How to Bypass Bottlenecks", Ph.D.
Thesis, Swiss Federal Institute of Technology, Zurich, 1998.
(C3) M. Mavronicolas and
D. Roth,
"Efficient, Strongly Consistent
Implementations of Shared Memory",
Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG
1992), A. Segall and
S. Zaks eds., pp. 346361,
Lecture Notes in Computer Science, Vol. 486,
SpringerVerlag, Haifa,
Israel, November 1992. 
11 citations:

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.

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

H. Attiya and
J. L. Welch, “Distributed Computing: Fundamentals,
Simulations, and Advanced Topics", McGrawHill, June 1998.

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

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

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

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. ***

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, SpringerVerlag, Saarbrucken,
Germany, September 1997.

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.

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.

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:

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

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.

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.

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

P. Fatourou
and
M.
Herlihy, “ReadModifyWrite Networks",
Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.

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

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

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

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

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

M. Younis,
M. Youssef and K. Arisha, "EnergyAware Routing in
ClusterBased 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.
(C8) M. Mavronicolas,
M.
Papatriantafilou and
Ph. Tsigas, "The Impact of Timing on Linearizability in
Counting Networks", Proceedings of
the 11th International Parallel Processing Symposium (IPPS
1997), pp. 684688, Geneva, Switzerland, April 1997. 
10 citations:

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.

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

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.

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.

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.

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

F. Fich,
V.
Luchangco, M. Moir and
N. Shavit,
"ObstructionFree Algorithms Can Be Practically WaitFree",
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.

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.

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

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:

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.

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, TelAviv, Israel, January 1995.

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.

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

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

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.

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.

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

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

N. Shavit and
A. Zemach, “Diffracting Trees",
ACM Transactions on Computer Systems, Vol. 14, No. 4, pp. 385–428, November 1996.
(BA3)
C. Busch,
N. Hardavellas and
M. Mavronicolas, "Contention in
Counting Networks", Proceedings of
the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC
1994), p. 404, Los Angeles, California, August 1994. 
9 citations:

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.

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

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.

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.

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.

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.

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.

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

N. Shavit,
E. Upfal and A. Zemach, "A Waitfree Sorting
Algorithm",
Theory of Computing Systems, pp. 519–544,
Vol. 34, No. 6, November/December 2001.
(C38)
M. Gairing,
T. Lucking,
M. Mavronicolas
and
B. Monien, "The Price of Anarchy for Polynomial Social Cost",
Proceedings of the 29th International Symposium on Mathematical Foundations of Computer
Science (MFCS 2004),
J.
Fiala, V. Koubek and
J. Kratochvil eds.,
pp. 574585, Vol. 3153,
Lecture Notes in Computer Science,
SpringerVerlag,
Prague, Czech Republic, August 2004. 
9 citations:

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.

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, SpringerVerlag, Marseille,
France, February 2006.

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.

C. Busch and
M. MagdonIsmail, "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, SpringerVerlag, Hong Kong,
China, June 2006.

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.

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, SpringerVerlag,
Palma de Mayorca, Spain, October 2005.

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. 319330, Vol. 4286, Lecture Notes in
Computer Science, SpringerVerlag, Patras, Greece, December 2006.

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, SpringerVerlag, Ibiza, Spain, October 2005.

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.
(J17)
I. Chatzigiannakis,
T. Dimitriou, M.
Mavronicolas, S. Nikoletseas
and
P. G. Spirakis,
"A Comparative Study of Protocols for
Efficient Data Propagation in Smart Dust Networks",
Parallel Processing
Letters,
Special Issue with
selected papers from
9th European Conference on Parallel Processing (EuroPar
2003), (Klagenfurt, Austria, August 2003),
H. Kosch,
L. Boszormenyi
and
H. Hellwagner
guest eds., Vol. 13, No. 4 pp. 615627, November 2003. 
7 citations:

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

A. Boukerche,
I. Chatzigiannakis and S. Nikoletseas,
"PowerEfficient 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.

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.

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.

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.

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, SpringerVerlag, Santorini,
Greece, May 2005.

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:

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.

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

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.

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.

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, SpringerVerlag, Lisbon, Portugal,
October 2001.

P. Fatourou
and
M.
Herlihy, “ReadModifyWrite Networks",
Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.
(C26)
D. Koukopoulos,
M. Mavronicolas, S. Nikoletseas
and
P. G. Spirakis,
"On the Stability of
Compositions of Universally Stable, Greedy ContentionResolution Protocols",
Proceedings of the 16th International Symposium on DIStibuted Computing
(DISC 2002),
(formerly
International Workshop on Distributed Algorithms),
D. Malkhi ed., pp. 88102, Vol. 2508,
Lecture Notes in Computer Science,
SpringerVerlag, Toulouse, France, October 2002. 
6 citations:

C. Alvarez,
M. Blesa,
J. Diaz,
A. Fernandez and
M. Serna, “Adversarial
Models for PriorityBased
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, SpringerVerlag, Bratislava, Slovak Republic,
August 2003.

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

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.

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.

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.

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, SpringerVerlag, Rome, Italy, May 2006.
(C16)
W. Aiello,
C. Busch,
M. Herlihy, M.
Mavronicolas,
N. Shavit and
D. Touitou,
"Supporting Increment and Decrement
Operations in Balancing Networks",
Proceedings of the 16th International Symposium on Theoretical Aspects of
Computer Science (STACS 1999),
G. Meinel and S. Tison eds., pp. 377386, Vol. 1563,
Lecture Notes in Computer Science,
SpringerVerlag, Trier, Germany, March 1999. 
5 citations:

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

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.

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, SpringerVerlag, Lisbon, Portugal, October 2001.

P. Fatourou and
M.
Herlihy, “ReadModifyWrite Networks",
Distributed Computing, Vol. 17, No. 1, pp. 33–46, February 2004.

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.
(C5)
N. Hardavellas,
D. Karakos and
M. Mavronicolas, "Notes on
Sorting and Counting Networks",
Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG
1993), A. Schiper, ed., pp.234248,
Lecture Notes in Computer Science, Vol. 725,
SpringerVerlag, Lausanne, Switzerland, September 1993. 
5 citations:

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

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.

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

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.

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:

C. Alvarez,
M. Blesa,
J. Diaz,
A. Fernandez and M. Serna, “Adversarial
Models for PriorityBased
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, SpringerVerlag, Bratislava, Slovak Republic,
August 2003.

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.

M. Blesa, "Deciding Stability in PacketSwitched 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.

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, SpringerVerlag, Gdansk, Poland, August/September 2005.

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:

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.

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.

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.

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.
(J23)
M. Gairing,
T. Lucking, M. Mavronicolas, B. Monien and
P. G. Spirakis,
"Structure and Complexity of
Extreme Nash Equilibria",
Theoretical Computer Science (Special Issue titled "Game Theory Meets Theoretical Computer Science",
M. Mavronicolas and
S. Abramsky guest eds.), Vol. 343, Nos. 12, pp. 133157, October 2005.

5 citations:

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.

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

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

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

N. E. StierMoses,
"Selfish versus Coordinated Routing in Network Games",
Ph. D. Thesis, Sloan School of Management, Massachusetts Institute of
Technology, Cambridge, June 2004.
(BA6)
C. Busch and M.
Mavronicolas, "The Strength of
Counting Networks", Proceedings of
the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC
1996), p. 311, Philadelphia, Philadelphia, May 1996. 
3 citations:

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

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.

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.
(C29)
D. Koukopoulos,
M. Mavronicolas
and
P. G. Spirakis,
"Instability of Networks with QuasiStatic Link
Capacities", Proceedings of the 10th International Colloquium on
Structural Information and Communication Complexity (SIROCCO 2003),
J. F. Sibeyn ed., pp. 179194,
Proceedings in Informatics 17,
Carleton Scientific, Umeå, Sweden, June 2003. 
3 citations:

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.

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.

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, SpringerVerlag, Rome, Italy, May 2006.
(C27)
D. Koukopoulos,
M. Mavronicolas, S. Nikoletseas
and
P. G. Spirakis,
"The Impact of Network
Structure on the Stability of Greedy Protocols", Proceedings of the
5th Italian Conference on Algorithms and Complexity (CIAC 2003),
R. Petreschi,
G. Persiano and R. Silvestri eds., pp. 251263, Vol.
2653,
Lecture Notes in Computer Science,
SpringerVerlag, Rome, Italy, May
2003. 
2 citations:

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

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:

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

P. Fatourou,
"Algorithmic Foundations of Fair, RateBased Flow Control",
Ph. D. Thesis, Department of Computer Engineering and Informatics,
University of Patras, Rion, June 1999.
(C7)
S. Kapidakis and M.
Mavronicolas, "Distributed, Low
Contention Task Allocation",
Proceedings of the 8th IEEE Symposium on Parallel and Distributed
Processing (SPDP
1996), pp. 358365, New Orleans, Louisiana, October 1996. 
2 citations:

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

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.
(C2) M. Mavronicolas and
D. Roth,
"Sequential Consistency and
Linearizability: Read/Write Objects",
Proceedings of the 29th Annual Allerton Conference on Communication,
Control and Computing (ALLERTON 1991), pp. 683692, Allerton,
Illinois, October 1991. 
2 citations:

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

S. Moriya, K. Suda,
M. Inoue, T. Masuzawa and H. Fujiwara, "Waitfree Linearizable Distributed
Shared Memory", IEICE Transactions on Information and Systems, pp.
1611–1621, Vol. E83D,
No. 8, August 2000.
2 citations:

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

F. Fich and
E. Ruppert,
“Hundreds of Impossibility Results in
Distributed Computing",
Distributed Computing, Vol. 16, Nos. 2&3,
pp. 121–163, September 2003.
(BA7) M. Mavronicolas, "WaitFree Solvability Via Combinatorial
Topology", Proceedings of the 15th
Annual ACM Symposium on Principles of Distributed Computing (PODC
1996), p. 277, Philadelphia, Philadelphia, May 1996. 
2 citations:

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

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.
(BA5)
C. Busch and M.
Mavronicolas, "A Logarithmic Depth
Counting Network", Proceedings of
the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC
1995), p. 275, Ottawa, Canada, August 1995. 
2 citations:

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

N. Shavit and
A. Zemach, “Diffracting Trees",
ACM Transactions on Computer Systems, Vol. 14, No. 4, pp. 385–428, November 1996.
(C40)
C. Busch,
M. MagdonIsmail and M.
Mavronicolas, "Universal Bufferless
Routing", Proceedings of the 2nd Workshop on Approximation and Online Algorithms
(WAOA 2004),
G. Persiano and
R. SolisOba
eds., pp. 239252, Vol. 3351,
Lecture Notes in Computer Science,
SpringerVerlag,
Bergen, Norway, September 2004. 
1 citation:

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

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. 319330, Vol. 4286, Lecture Notes in
Computer Science, SpringerVerlag, Patras, Greece, December 2006.
(C39)
C. Busch,
M. MagdonIsmail, M.
Mavronicolas and P. G.
Spirakis, "Direct Routing: Algorithms
and Complexity", Proceedings of
the 12th Annual European Symposium on Algorithms (ESA
2004), S. Albers
and
T. Radzik eds., pp. 134145, Vol. 3221,
Lecture Notes in Computer Science,
SpringerVerlag,
Bergen, Norway, September 2004. 
1 citation:

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, SpringerVerlag, UC
Berkeley, August 2005.
(C37)
C. Busch,
M. MagdonIsmail, M.
Mavronicolas and R. Wattenhofer, "NearOptimal HotPotato
Routing on Trees", Proceedings of the 10th European Conference on Parallel Processing
(EuroPar 2004),
M. Danelutto,
M. Vanneschi and
D.
Laforenza eds., pp. 820827, Vol. 3149,
Lecture Notes in Computer Science,
SpringerVerlag,
Pisa, Italy, August/September 2004. 
1 citation:

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

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, SpringerVerlag, Gdansk, Poland, August/September 2005.
(C28)
C. Busch,
M. Mavronicolas and
P. G. Spirakis,
"The Cost of Concurrent, LowContention ReadModifyWrite",
Proceedings of the 10th International Colloquium on Structural
Information and Communication Complexity (SIROCCO 2003),
J. F. Sibeyn
ed., pp. 5772,
Proceedings in Informatics 17,
Carleton Scientific, Umeå, Sweden, June 2003. 
1 citation:

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.
(C21)
C. Busch,
N. Demetriou, M.
Herlihy and M. Mavronicolas, "A Combinatorial Characterization of
Properties Preserved by Antitokens", Proceedings of the 6th
European Conference on Parallel Processing (EuroPar 2000). A. Bode, T.
Ludwig, W. Karl and R. Wismüller eds., pp. 575582, Vol. 1900,
Lecture Notes in Computer Science,
SpringerVerlag, Munich, Germany,
August/September 2000. 
1 citation:

C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department
of Computer Science, Brown University, Providence, April 2000.
(C18)
C. Busch,
N. Demetriou, M.
Herlihy and M. Mavronicolas, "Threshold Counters with Increments and
Decrements", Proceedings of the 6th International Colloquium on
Structural Information and Communication Complexity (SIROCCO 1999),
C. Gavoille,
J. C. Bermond and A. Raspalid eds., pp. 4761,
Proceedings in Informatics 5,
Carleton Scientific, Lacanau, France,
June/July 1999. 
1 citation:

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

P. Fatourou,
"Algorithmic Foundations of Fair, RateBased Flow Control",
Ph. D. Thesis, Department of Computer Engineering and Informatics,
University of Patras, Rion, June 1999.
(C13)
P. Fatourou, M. Mavronicolas
and
P. G. Spirakis, "The Global
Efficiency of Distributed, RateBased, Flow Control Algorithms",
Proceedings of the 5th International Colloquium on Structural
Information and Communication Complexity (SIROCCO 1998), pp. 244258,
Amalfi, Italy, June 1998. 
1 citation:

P. Fatourou,
"Algorithmic Foundations of Fair, RateBased Flow Control",
Ph. D. Thesis, Department of Computer Engineering and Informatics,
University of Patras, Rion, June 1999.
(C11) M. Mavronicolas and
N.
Papadakis, "Tradeoff Results for
Connection Management", Proceedings
of the 11th International Symposium on Fundamentals of Computation Theory
(FCT
1997), B. S. Chlebus and L. Csaja eds., pp. 340351,
Lecture Notes in Computer Science, Vol. 1279,
SpringerVerlag, Krakow,
Poland, September 1997. 
1 citation:

M. Smith, "Reliable Message Delivery and ConditionallyFast 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.
(C9)
P. Fatourou, M. Mavronicolas
and
P. G. Spirakis, "Advances in
RateBased Flow Control",
Proceedings of the 4th International Colloquium on Structural Information
and Communication Complexity (SIROCCO 1997), Carleton University
Press, pp. 266281, June 1997. 
1 citation:

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

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:

C. Busch, "A Study on Distributed Structures", Ph. D. Thesis, Department
of Computer Science, Brown University, Providence, April 2000.
(BA4)
S. Kapidakis and M.
Mavronicolas, "Load Balancing
Networks", Proceedings of the 14th
Annual ACM Symposium on Principles of Distributed Computing (PODC
1995), p. 276, Ottawa, Canada, August 1995. 
1 citation:

N. Shavit and
A. Zemach, “Diffracting Trees",
ACM Transactions on Computer Systems, Vol. 14, No. 4, pp. 385–428, November 1996.
(J19)
C. Busch,
M. Mavronicolas and P.
G. Spirakis, "The Cost of Concurrent, LowContention ReadModifyWrite",
Theoretical Computer Science,
Special Issue with
selected papers
from 10th International Colloquium on Structural Information and
Communication Complexity (SIROCCO 2003) (Umea, Sweden, June 2003),
J. F. Sibeyn
and
D. Peleg guest eds.,
Vol. 333, No. 3, pp. 373400, March 2005.

1 citation:

S. Tirthapura and
C. Busch, "Concurrent Counting is Harder than Queuing",
CDROM Proceedings of the 21st IEEE International Parallel and
Distributed Processing Symposium (IPDPS
2006),
Rhodes, Greece, April 2006.
(J22)
D. Koukopoulos, M. Mavronicolas, S. Nikoletseas
and P. G. Spirakis,
"The Impact of Network Structure on the
Stability of Greedy Protocols",
Theory of Computing Systems,
Special Issue with selected papers from 5th Italian Conference on
Algorithms and Complexity (CIAC 2003) (Rome, Italy, May 2003),
G. Persiano guest ed.,
Vol. 39, No. 4, pp. 425460, July 2005.

1 citation:

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, SpringerVerlag, Rome, Italy, May 2006.
1 citation:

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.
