(BC3)
M. Mavronicolas,
V.
Papadopoulou and
P. Spirakis,
"Algorithmic Game Theory and
Applications", in
Handbook of
Applied Algorithms: Solving Scientific, Engineering, and Practical
Problems, A.
Nayak and I.
Stojmenovic eds.,
John Wiley and
Sons, pp.
287316, March 2008.
(BC2)
C. Busch,
N. Demetriou, M.
Herlihy and M. Mavronicolas,
"A Combinatorial Characterization
of Properties Preserved by Antitokens",
Current Trends
in Theoretical Computer Science, Vol. I: Algorithms And Complexity,
G. Paun,
G. Rozenberg and
A. Salomaa
eds., pp. 297314, World Scientific Publishing, 2004.
(BC1) M. Mavronicolas,
"Stability
in Routing: Networks and Protocols"
Current Trends
in Theoretical Computer Science, Vol. I: Algorithms And Complexity,
G. Paun,
G. Rozenberg and
A. Salomaa
eds., pp. 435450, World Scientific Publishing, 2004.
To top of page
(J43)
M. Mavronicolas and
T. Sauerwald, "The
Impact of Randomization in Smoothing Networks",
Distributed Computing,
Special Issue with selected
papers from the
27th Annual ACM Symposium on Principles of
Distributed Computing
(PODC
2008),
(Toronto, Canada, August
2008), March
2009, accepted.
(J42)
R. Feldmann,
M. Mavronicolas and
A. Pieris,
"Facets of the Fully Mixed Nash
Equilibrium Conjecture",
Theory of Computing Systems, Special Issue with selected
papers from the
1st International Symposium on Algorithmic Game Theory
(SAGT
2008),
(Paderborn, Germany,
April/May
2008),
B. Monien and
U.– P. Schroeder eds.,
March
2009, accepted.
(J41)
M. Gairing,
T. Lucking,
M. Mavronicolas and
B. Monien,
"Computing Nash Equilibria for Scheduling on
Restricted Parallel Links",
Theory of Computing Systems,
January 2009, accepted.
(J40) M. Mavronicolas and
L. Michael, "A
Substitution Theorem for Graceful Trees and its Applications",
Discrete Mathematics, December 2008, accepted.
(J39)
M. Gairing,
T. Lucking,
M. Mavronicolas,
B. Monien
and
M. Rode,
"Nash Equilibria in Discrete Routing
Games with Convex Latency Functions",
Journal of
Computer and System Sciences, Vol. 74, No. 7, pp.
11991225,
November 2008.
(J38)
M. Mavronicolas,
V. Papadopoulou,
A. Philippou
and
P. Spirakis,
"A GraphTheoretic Network Security Game",
International Journal of Autonomous and Adaptive Communications Systems, Special Issue on "Algorithmic Game
Theory", R. Kannan
and C.
Busch, eds., Vol. 1, No. 4 pp. 390  410, 2008.
(J37) M. Mavronicolas,
M. Merritt and
G.
Taubenfeld, "Sequentially Consistent versus
Linearizable Counting Networks",
Distributed Computing,
Vol. 21, No. 4, pp. 249269, October 2008.
(J36) M. Mavronicolas,
L. Michael
and P. Spirakis,
"Computing on a Partially
Eponymous Ring",
Theoretical
Computer Science, Special Issue with selected papers from the 10th
International Conference On Principles Of Distributed Systems (OPODIS
2006), (Bordeaux & SaintEmilion, France,
December 2006), A.
A. Shvartsman guest ed., Vol. 410, No. 67, pp. 595613,
February 2009.
(J35)
D. Fotakis,
S. Kontogiannis,
E. Koutsoupias, M. Mavronicolas
and
P. Spirakis,
"The
Structure and Complexity of Nash Equilibria for a Selfish Routing Game",
Theoretical Computer Science,
Vol. 343, No. 12, pp. 133157, October 2005
.
(J34)
C. Busch,
M. MagdonIsmail
and M. Mavronicolas,
"Efficient Bufferless Packet Switching on Trees and Leveled Networks",
Journal of Parallel and Distributed Computing, Vol.
67, No. 11, pp. 11681186, November 2007.
(J33)
D.
Koukopoulos, M. Mavronicolas and
P. Spirakis,
"The
Increase of the Instability of Networks due to QuasiStatic Link Capacities",
Theoretical Computer Science, Vol.
381, No. 13, pp. 4456,
August 2007.
(J32)
C. Busch,
M. MagdonIsmail
and M. Mavronicolas,
"Universal Bufferless Packet
Switching",
SIAM Journal on Computing, Vol.
37, No. 4, pp. 11391162,
2007.
(J31)
D. Koukopoulos,
M. Mavronicolas and
P. Spirakis,
"Performance and Stability Bounds for Dynamic
Networks",
Journal of Parallel and Distributed Computing,
Vol. 67,
No. 4, pp. 386399, April 2007.
(J30) M. Mavronicolas,
V.
Papadopoulou,
A. Philippou
and P. Spirakis,
"A Network Game with Attackers and a
Defender",
Algorithmica,
Special Issue with selected papers from the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005)
(Hainan, China, December 2005),
X. Deng
and D. Du guest eds.,
Vol. 51, No. 3, pp. 315341,
July 2008.
(J29) M. Mavronicolas,
P. Panagopoulou
and P. Spirakis,
"Cost Sharing Mechanisms for Fair Pricing of Resource Usage",
Algorithmica,
Special Issue with selected papers from the 1st International Workshop on Internet and Network Economics (WINE
2005) (Hong Kong, China, December 2005),
X. Deng
and Y. Ye guest eds.,
Vol. 52, No. 1, pp. 1943, September 2008.
(J28)
M. Gairing,
T. Lucking,
M. Mavronicolas and
B. Monien,
"The Price of Anarchy for Polynomial
Social Cost",
Theoretical Computer Science,
Vol. 369, No. 13, pp. 116135,
December 2006.
(J27)
T. Lucking,
M. Mavronicolas,
B. Monien
and
M. Rode,
"A New Model for Selfish Routing",
Theoretical Computer Science,
Special Issue on Algorithmic Aspects of Global Computing,
Ch.
Kaklamanis guest ed., Vol. 406, No 3,pp.187206, October 2008
.
(J26)
C. Busch,
M. MagdonIsmail,
M. Mavronicolas and P. Spirakis, "Direct Routing: Algorithms
and Complexity",
Algorithmica, Special Issue with selected papers from the
12th Annual European Symposium on Algorithms (ESA
2004) (Bergen, Norway, September 2004),
S. Albers and
T. Radzik guest
eds., Vol. 45, No. 1, pp. 4568, June 2006.
(J25)
M. Gairing,
T. Lucking,
M. Mavronicolas
and
B. Monien,
"The Price of Anarchy for Restricted
Parallel Links",
Parallel Processing
Letters,
Vol. 16, No. 1, pp. 117132, March 2006.
(J24) M. Mavronicolas
and
P. Spirakis,
"The Price of Selfish
Routing",
Algorithmica,
Vol. 48, No. 1, pp. 91126, June 2007.
(J23)
M. Gairing,
T. Lucking, M. Mavronicolas,
B. Monien
and P. 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.
(J22)
D. Koukopoulos, M. Mavronicolas,
S. Nikoletseas and
P. Spirakis,
"The Impact of Network Structure on the
Stability of Greedy Protocols",
Theory of Computing Systems,
Special Issue with selected papers from the 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.
(J21)
P. Fatourou, M. Mavronicolas
and P.
Spirakis, "Efficiency of Oblivious versus Nonoblivious
Schedulers for Optimistic, RateBased Flow Control",
SIAM Journal
on Computing, Vol. 34, No. 5, pp. 12161252, July 2005.
(J20)
P. Fatourou,
M. Mavronicolas and P.
Spirakis,
"MaxMin Fair Flow Control Sensitive to Priorities",
Journal of Interconnection Networks,
Vol. 6, No. 2, pp. 85114, June 2005.
(J19)
C. Busch,
M. Mavronicolas and P.
Spirakis,
"The Cost of Concurrent, LowContention ReadModifyWrite",
Theoretical Computer Science,
Special Issue with
selected papers
from the 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.
(J18)
C. Busch,
M. Mavronicolas and P.
Spirakis,
"An Application of the
Monotone Linearizability Lemma",
Bulletin of the European
Association for Theoretical Computer Science, No. 85, pp. 7080,
February 2005.
(J17)
I. Chatzigiannakis,
T. Dimitriou, M.
Mavronicolas, S. Nikoletseas
and P. Spirakis,
"A Comparative Study of Protocols for
Efficient Data Propagation in Smart Dust Networks",
Parallel Processing
Letters, Special Issue with
selected papers from
the
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.
(J16)
E. Koutsoupias, M. Mavronicolas
and P. 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.
(J15) M. Mavronicolas
and N.
Papadakis, "Tradeoff Results for Connection Management",
Theoretical Computer Science,
Vol. 290, No. 1, pp.157, January 2003.
(J14)
C. Busch,
N. Demetriou, M.
Herlihy and M. Mavronicolas,
"Threshold Counters with
Increments and Decrements",
Theoretical Computer Science, Vol.
270, Nos. 1 & 2, pp. 811826, January 2002.
(J13) M. Mavronicolas,
"Stability
in Routing: Networks and Protocols",
Bulletin of the European
Association for Theoretical Computer Science, No. 74, pp. 119133,
June 2001.
(J12) M. Mavronicolas,
"Distributed
Computing Theory To Date",
Bulletin of the European
Association for Theoretical Computer Science, No. 73, pp. 99106, February 2001.
(J11)
W. Aiello,
C. Busch,
M. Herlihy, M. Mavronicolas,
N. Shavit and
D. Touitou,
"Supporting
Increment and Decrement Operations in Balancing Networks",
Chicago
Journal of Theoretical Computer Science, 20024, December 14, 2000
(electronic).
(J10)
C. Busch,
N. Demetriou, M.
Herlihy and M. Mavronicolas,
"A Combinatorial Characterization
of Properties Preserved by Antitokens",
Bulletin of the European
Association for Theoretical Computer Science,, Number 71, pp. 114132,
June 2000.
(J9) M. Mavronicolas
and
D. Roth,
"Linearizable Read/Write Objects",
Theoretical Computer Science,
Vol. 220, No. 1, pp. 267319, June 1999.
(J8)
M. Mavronicolas, "TimingBased
Connection Management", in M. Mavronicolas,
M. Merritt
and
N. Shavit, eds., "Networks in Distributed Computing",
DIMACS
Series in Discrete Mathematics and Theoretical Computer Science, Volume 45, pp. 113134,
American Mathematical
Society, October 1998. (In
memory of late Professor Paris C. Kanellakis.)
(J7) M. Mavronicolas,
"A
qAnalog
of Approximate InclusionExclusion",
Advances in Applied
Mathematics, Vol. 20, No. 1, pp. 108129, January 1998.
(J6)
C. Busch
and M.
Mavronicolas,
"Impossibility Results for Weak Threshold Networks",
Information Processing Letters, Vol. 63, No. 2, pp. 125157, March
1997.
(J5) M. Mavronicolas,
"Balancing
Networks: StateoftheArt",
Information Sciences: An International
Journal, invited paper in
Special Issue
on Load Balancing, C.
Nikolaou and L. Richter eds., Vol. 97, No. 1/2, pp. 125157,
March 1997.
(J4)
C. Busch
and M.
Mavronicolas,
"A Combinatorial Treatment of Balancing Networks",
Journal of the ACM, Vol. 43, No. 5, pp. 794839, September 1996.
(J3)
C. Busch
and M.
Mavronicolas,
"Proving Correctness for Balancing
Networks", in
P. M. Pardalos, K. G. Ramakrishnan
and M. G. C. Resende
eds., "Parallel Processing of Discrete Optimization Problems",
DIMACS
Series in Discrete Mathematics and Theoretical Computer Science,
Volume 22, pp. 132,
American Mathematical
Society, July 1995.
(J2)
H. Attiya
and M.
Mavronicolas,
"Efficiency of SemiSynchronous versus Asynchronous
Networks", Mathematical Systems Theory (currently
Theory of Computing Systems), Vol. 27, No. 6, pp. 547571, November/December
1994.
(J1) M. Mavronicolas,
"Efficiency
of SemiSynchronous versus Asynchronous Systems: Atomic Shared Memory",
Computers and Mathematics with Applications, Vol. 25, No. 2, pp.
8191, January 1993.
To top of page
To top of page
(JS4) M. Mavronicolas,
B. Monien and
V. Papadopoulou, "How Many
Attackers Can Selfish Defenders Catch?", submitted
to
Discrete Applied Mathematics, November 2008.
(JS3)
C. Busch
and M. Mavronicolas,
"An Efficient Counting Network", submitted to
Theoretical Computer Science.
(JS1) M. Mavronicolas,
"A Bound on the Rounds to Reach Lattice
Agreement", submitted to
Information Processing Letters.
To top of page
(C58)
R. Feldmann,
M. Mavronicolas and
B. Monien,
"Nash Equilibria for Voronoi Games on Transitive Graphs",
Proceedings of the 5th International
Workshop on Internet and Network Economics
(WINE
2009), ,
Lecture Notes in Computer Science,
SpringerVerlag,
S. Leonardi ed.,
Rome, Italy,
December 2009, to appear
.
(C57)
M. Mavronicolas and
T. Sauerwald,
"A Randomized, O(log
w)Depth 2Smoothing Network",
Proceedings of the 21st ACM Symposium on Parallelism in
Algorithms and Architectures (SPAA
2009), Calgary, Canada, August
2009, to appear
.
(C56)
M. Mavronicolas,
B. Monien,
V. Papadopoulou
and
F.
Schoppmann,
"Voronoi Games on Cycle Graphs",
Proceedings of the 33rd International Symposium on Mathematical
Foundations of Computer Science (MFCS
2008), eds.,
pp. 503514, Vol. 5162,
Lecture Notes in Computer Science,
SpringerVerlag,
Ed. Ochmanski and
J. Tyszkiewicz eds.,
Toruń, Poland,
August
2008.
(C55)
M. Mavronicolas and
T. Sauerwald, "The
Impact of Randomization in Smoothing Networks",
Proceedings of the
27th Annual ACM Symposium on Principles of
Distributed Computing
(PODC
2008),
R. Bazzi,
B. PattShamir
eds., pp. 345354,
Toronto, Canada, August
2008.
(C54)
R. Feldmann,
M. Mavronicolas and
A. Pieris,
"Facets of the Fully Mixed Nash
Equilibrium Conjecture",
Proceedings of the
1st International Symposium on Algorithmic Game Theory
(SAGT
2008),
B. Monien and
U. P. Schroeder eds., pp. 145157,
Vol. 4997,
Lecture Notes in Computer Science,
SpringerVerlag,
Paderborn, Germany,
April/May
2008.
Slide show presentation available
(pdf).
(C53) M. Mavronicolas,
B. Monien
and
V. Papadopoulou,
"How Many Attackers Can Selfish Defenders Catch?",
CDROM Proceedings of the 41st Hawaii International Conference on System Sciences (JHICSS41),
Track on Software Technology, Minitrack on Algorithmic Challenges in
Emerging Applications of Computing, Big Island, Hawaii, January 2008.
(C52) M. Mavronicolas,
B. Monien
and
K. Wagner,
"Weighted Boolean Formula Games",
Proceedings of the 3rd International Workshop on Internet and Network Economics
(WINE 2007),
X. Deng
and F. C. Graham
eds.,
pp. 469481, Vol. 4858,
Lecture Notes in Computer Science,
SpringerVerlag,
San Diego, USA, December 2007.
(C51) M. Mavronicolas,
I. Milchtaich,
B. Monien
and K. Tiemann,
"Congestion Games with PlayerSpecific Constants",
Proceedings of the 32nd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2007),
L.
Kucera and
A. Kucera
eds., pp. 633644, Vol. 4708,
Lecture Notes in Computer Science,
SpringerVerlag, Český
Krumlov, Czech Republic, August 2007.
(C50) M. Mavronicolas,
L.
Michael
and P. Spirakis,
"Computing on a Partially Eponymous Ring",
Proceedings of the 10th International Conference On Principles Of Distributed Systems
(OPODIS 2006),
A. A. Shvartsman
ed.,
pp. 380394, Vol. 4305,
Lecture Notes in Computer Science,
SpringerVerlag,
Bordeaux & SaintEmilion, France,
December 2006.
(C49) M. Mavronicolas,
V. Papadopoulou,
G. Persiano,
A. Philippou
and P. Spirakis,
"The Price of Defense and Fractional Matchings",
Proceedings of the 8th International
Conference on Distributed Computing and Networking
(ICDCN 2006),
S. Chaudhuri,
S. R. Das,
H. Sekhar
and S. Tirthapura eds., pp.
115126, Vol. 4308,
Lecture Notes in Computer Science,
SpringerVerlag, Guwahati, India, December 2006.
(C48) M. Mavronicolas,
V.
Papadopoulou,
A. Philippou
and P. Spirakis,
"A Network Game with Attackers and a Defender: A Survey",
CDROM
Proceedings of the 2nd
European Conference on Complex Systems 2006 (ECCS
2006), Oxford, Great Britain, September 2006.
(C47) M. Mavronicolas,
L. Michael,
V. Papadopoulou,
A. Philippou
and P. Spirakis,
"The Price of Defense",
Proceedings of the 31st International Symposium on Mathematical
Foundations of Computer Science
(MFCS 2006),
R. Kralovic and
P. Urzyczyn eds., pp.
717728, Vol. 4162,
Lecture Notes in Computer Science,
SpringerVerlag, Bratislava, Slovakia, August/September 2006.
Slide show presentation available (ppt)
(pdf).
(C46) M. Gelastou, M. Mavronicolas,
V.
Papadopoulou,
A. Philippou
and P. Spirakis,
"The Power of the Defender",
CDROM
Proceedings of the
2nd International Workshop on IncentiveBased Computing (IBC
2006), in conjunction with the
26th IEEE International Conference on Distributed Computing (ICDCS
2006), Lisboa, Portugal, July 2006. (6 pages)
Slide show presentation
available (ppt) (pdf)
(C45) M. Mavronicolas,
V.
Papadopoulou,
A. Philippou
and P. Spirakis,
"A Network Game with Attacker and Protector Entities",
Proceedings of the
16th Annual International Symposium on Algorithms and
Computation (ISAAC 2005),
X. Deng
and D. Du eds., pp.
288297, Vol. 3827,
Lecture Notes in Computer Science,
SpringerVerlag,
Hainan, China, December 2005.
Slide show presentation
available (ppt) (pdf)
(C44)
R. Elsasser,
M. Gairing,
T. Lucking,
M. Mavronicolas
and
B. Monien,
"A Simple GraphTheoretic Model for Selfish Restricted Scheduling",
Proceedings of the 1st International Workshop on Internet and Network Economics (WINE
2005), X. Deng
and Y. Ye eds., pp. 195209, Vol. 3828,
Lecture Notes in Computer Science,
SpringerVerlag,
Hong Kong, China, December 2005.
Slide show presentation
available (pdf)
(C43) M. Mavronicolas,
P. Panagopoulou
and P. Spirakis,
"A Cost Mechanism for Fair Pricing of Resource Usage",
Proceedings of the 1st International Workshop on Internet and Network Economics (WINE
2005), X. Deng
and Y. Ye eds., pp. 210224, Vol. 3828,
Lecture Notes in Computer Science,
SpringerVerlag,
Hong Kong, China, December 2005.
Slide show presentation
available (pdf)
(C42) M. Mavronicolas,
V.
Papadopoulou,
A. Philippou
and P. Spirakis,
"A GraphTheoretic Network Security Game",
Proceedings of the 1st International Workshop on Internet and Network Economics (WINE
2005), X. Deng
and Y. Ye eds., pp. 969978, Vol. 3828,
Lecture Notes in Computer Science,
SpringerVerlag,
Hong Kong, China, December 2005.
Slide show presentation
available (ppt) (pdf)
(C41)
C. Busch,
M. Mavronicolas and P. Spirakis,
"Monotone Operations and Monotone Groups",
Proceedings of the 1st
International Conference on Algebraic Informatics 2005,
S. Bozapalidis,
A. Kalampakas
and
G. Rahonis
eds., pp.
175195, Aristotle
University of Thessaloniki, Thessaloniki, Greece, October 2005.
(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.
Slideshow presentation
available (ppt) (pdf)
(C39)
C. Busch,
M. MagdonIsmail, M.
Mavronicolas and P. 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.
(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.
(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.
(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.
(C35)
M. Gairing,
T. Lucking,
M. Mavronicolas and
B. Monien,
"Computing Nash Equilibria for Scheduling on
Restricted Parallel Links", Proceedings of the 36th Annual
ACM Symposium on Theory of Computing (STOC
2004), pp. 613622, June 2004.
(C34)
D. Koukopoulos,
M. Mavronicolas and
P. Spirakis,
"Performance and Stability Bounds for Dynamic
Networks", Proceedings of the 7th International Symposium on
Parallel Architectures, Algorithms and Networks (ISPAN 2004), pp.
239246, Hong Kong, SAR, China, May 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.
(C32)
M. Gairing,
T. Lucking,
M. Mavronicolas,
B. Monien
and
P. 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.
(C31)
I. Chatzigiannakis,
T. Dimitriou, M.
Mavronicolas, S. Nikoletseas
and
P. 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).
(C30)
T. Lucking,
M. Mavronicolas,
B. Monien,
M. Rode,
P. 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.
(C29)
D. Koukopoulos,
M. Mavronicolas and
P. 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.
(C28)
C. Busch,
M. Mavronicolas and
P. 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.
(C27)
D. Koukopoulos,
M. Mavronicolas, S. Nikoletseas
and
P. 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.
(C26)
D. Koukopoulos,
M. Mavronicolas, S. Nikoletseas
and
P. 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.
(C25)
E. Koutsoupias, M. Mavronicolas
and
P. 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.
(C24)
D. Fotakis,
S. Kontogiannis,
E. Koutsoupias, M. Mavronicolas
and
P. 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.
(C23)
M. Mavronicolas, A. Mouskos and
P. Spirakis, "The Cost of Lack of Coordination in Distributed
Network Routing", Proceedings
of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE
2001),
Ch. Kaklamanis
ed., pp. 6584, Proceedings in Informatics 12,
Carleton Scientific, Aarhus, Denmark, August 2001.
(C22) M. Mavronicolas
and
P. Spirakis,
"The Price of Selfish Routing",
Proceedings of the 33rd
Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 510519,
July 2001.
(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.
(C20) M. Eleftheriou
and M.
Mavronicolas,
"Linearizability in the Presence of Drifting Clocks
and Under Different Delay Assumption", Proceedings of the 13th
International Symposium on DIStributed Computing (DISC 1999),
(formerly
International Workshop on Distributed Algorithms),
P. Jayanti
ed., pp. 327341, Vol. 1693,
Lecture Notes in Computer Science,
SpringerVerlag, Bratislava, Slovakia, September 1999.
(C19) S. Georgiades, M. Mavronicolas and
P. 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.
(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.
(C17) M. Mavronicolas,
M. Merritt and
G.
Taubenfeld,
"Sequentially Consistent versus
Linearizable Counting
Networks", Proceedings of the 18th Annual ACM Symposium on
Principles of Distributed Computing (PODC 1999), pp. 133142, Atlanta,
Georgia, May 1999.
(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.
(C15)
P. Fatourou, M. Mavronicolas
and
P. Spirakis,
"MaxMin Fair
Flow Control Sensitive to Priorities",
Proceedings of the 2nd International Conference on Principles of
Distributed Systems (OPODIS
1998), pp. 4559,
Hermes Science Publications 1999, Amiens, France, December 1998.
(C14) L. Hadjimitsis
and M.
Mavronicolas, "Contention in
Balancing Networks Resolved", Proceedings of the 17th Annual ACM Symposium on Principles of Distributed
Computing (PODC 1998), pp.
4150, Puerto Vallarta, Mexico, June/July 1998.
(C13)
P. Fatourou, M. Mavronicolas
and
P. 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.
(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.
(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.
(C10)
P. Fatourou, M.
Mavronicolas and
P. Spirakis,
"Efficiency of Oblivious versus NonOblivious Schedulers for
Optimistic, RateBased Flow Control",
Proceedings of the 16th Annual ACM Symposium on Principles of
Distributed Computing (PODC 1997),
pp. 139148, Santa Barbara, California, August 1997.
(C9)
P. Fatourou, M. Mavronicolas
and
P. 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.
(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.
(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.
(C6)
C. Busch
and M.
Mavronicolas,
"A Combinatorial
Treatment of Balancing Networks", Proceedings of the 13th Annual ACM Symposium on Principles of Distributed
Computing (PODC
1994), pp. 206215, Los Angeles, California, August 1994.
(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.
(C4) M. Mavronicolas,
"An Upper and a Lower Bound for Tick
Synchronization", Proceedings of
the 13th IEEE RealTime Systems Symposium (RTSS
1992), pp. 246255, Phoenix, Arizona, December 1992.
(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.
(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.
(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.
To top of page
(BA11) M. Mavronicolas,
P. Panagopoulou
and P. Spirakis,
"Cost Sharing Mechanisms for Fair
Pricing of Resources Usage", Proceedings of the Dagstuhl Seminar on Algorithmic Aspects of Large and
Complex Networks (Dagstuhl
Seminar Series 05361), September 2005.
(BA10)
M. Gairing,
T. Lucking,
M. Mavronicolas
and B. Monien, "The Price of Anarchy for Polynomial Social Cost",
Proceedings of the Dagstuhl Seminar on Computing and Markets 2005 (Dagstuhl
Seminar Series 05011), January 2005.
(BA9)
M. Mavronicolas and
P. Spirakis, "Optimal, Distributed
DecisionMaking: The Case of No Communication",
Proceedings of the 18th Annual ACM Symposium on Principles of
Distributed Computing (PODC 1999),
p. 279, Atlanta, Georgia, May 1999.
(BA8)
P. Fatourou, M. Mavronicolas
and
P. Spirakis, "The Global
Efficiency of Distributed, RateBased, Flow Control Algorithms",
Proceedings of the 17th Annual ACM Symposium on Principles of
Distributed Computing (PODC 1998),
p. 311, Puerto Vallarta, Mexico, June/July 1998.
(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.
(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.
(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.
(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.
(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.
(BA2) M. Mavronicolas,
"The Impact of Synchronization on the Session
Problem", Proceedings of the 13th
Annual ACM Symposium on Principles of Distributed Computing (PODC
1994), p. 379, Los Angeles, California, August 1994.
(BA1) M. Mavronicolas,
"A qAnalog of Approximate
InclusionExclusion", Proceedings
of the 7th SIAM Conference on Discrete Mathematics, Albuquerque, New
Mexico, June 1994.
To top of page
To top of page
(TR1)
D. Koukopoulos,
M. Mavronicolas and
P. Spirakis, "FIFO is
Unstable at Arbitrarily Low Rates (Even in Planar Networks)",
Electronic Colloquium on Computational Complexity (ECCS)
(ISSN
14338092), Technical Report TR03016, accepted on April 8, 2003.
To top of page
To top of page
