Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Mavronicolas, Marios"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of rational and irrational Nash equilibria
Vittorio Bilò
,
Marios Mavronicolas
Theory of Computing Systems
54
(3), 2014, pp. 491-527
An efficient counting network
Costas Busch
,
Marios Mavronicolas
Theoretical Computer Science
411
(34-36), 2010, pp. 3001-3030
Facets of the fully mixed Nash equilibrium conjecture
Rainer Feldmann
,
Marios Mavronicolas
,
Andreas Pieris
Theory of Computing Systems
47
(1), 2010, pp. 60-112
Computing Nash equilibria for scheduling on restricted parallel links
Martin Gairing
,
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
Theory of Computing Systems
47
(2), 2010, pp. 405-432
The structure and complexity of Nash equilibria for a selfish routing game
Dimitris Fotakis
,
Spyros Kontogiannis
,
Elias Koutsoupias
,
Marios Mavronicolas
,
Paul Spirakis
Theoretical Computer Science
410
(36), 2009, pp. 3305-3326
Computing on a partially eponymous ring
Marios Mavronicolas
,
Loizos Michael
,
Paul Spirakis
Theoretical Computer Science
410
(6-7), 2009, pp. 595-613
A randomized,
O(\log w)
-depth 2 smoothing network
Marios Mavronicolas
,
Thomas Sauerwald
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 178-187
Nash equilibria in discrete routing games with convex latency functions
Martin Gairing
,
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
,
Manuel Rode
Journal of Computer and System Sciences
74
(7), 2008, pp. 1199-1225
A new model for selfish routing
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
,
Manuel Rode
Theoretical Computer Science
406
(3), 2008, pp. 187-206
Voronoi games on cycle graphs
Marios Mavronicolas
,
Burkhard Monien
,
Vicky G. Papadopoulou
,
Florian Schoppmann
Lecture Notes in Computer Science
5162
, 2008, pp. 503-514
Cost sharing mechanisms for fair pricing of resource usage
Marios Mavronicolas
,
Panagiota N. Panagopoulou
,
Paul G. Spirakis
Algorithmica
52
(1), 2008, pp. 19-43
A network game with attackers and a defender
Marios Mavronicolas
,
Vicky Papadopoulou
,
Anna Philippou
,
Paul Spirakis
Algorithmica
51
(3), 2008, pp. 315-341
Efficient bufferless packet switching on trees and leveled networks
Costas Busch
,
Malik Magdon-Ismail
,
Marios Mavronicolas
Journal Parallel Distributed Computing
67
(11), 2007, pp. 1168-1186
Universal bufferless packet switching
Costas Busch
,
Malik Magdon-Ismail
,
Marios Mavronicolas
SIAM Journal on Computing
37
(4), 2007, pp. 1139-1162
Performance and stability bounds for dynamic networks
Dimitrios Koukopoulos
,
Marios Mavronicolas
,
Paul Spirakis
Journal Parallel Distributed Computing
67
(4), 2007, pp. 386-399
The increase of the instability of networks due to quasi-static link capacities
Dimitrios Koukopoulos
,
Marios Mavronicolas
,
Paul Spirakis
Theoretical Computer Science
381
(1-3), 2007, pp. 44-56
Congestion games with player-specific constants
Marios Mavronicolas
,
Igal Milchtaich
,
Burkhard Monien
,
Karsten Tiemann
Lecture Notes in Computer Science
4708
, 2007, pp. 633-644
The price of selfish routing
Marios Mavronicolas
,
Paul Spirakis
Algorithmica
48
(1), 2007, pp. 91-126
Direct routing: Algorithms and complexity
Costas Busch
,
Malik Magdon-Ismail
,
Marios Mavronicolas
,
Paul Spirakis
Algorithmica
45
(1), 2006, pp. 45-68
The price of anarchy for restricted parallel links
Martin Gairing
,
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
Parallel Processing Letters
16
(1), 2006, pp. 117-131
The price of anarchy for polynomial social cost
Martin Gairing
,
Thomas Lücking
,
Marios Mavronicolas
,
Burkhard Monien
Theoretical Computer Science
369
(1-3), 2006, pp. 116-135
The price of defense
Marios Mavronicolas
,
Loizos Michael
,
Vicky Papadopoulou
,
Anna Philippou
,
Paul Spirakis
Lecture Notes in Computer Science
4162
, 2006, pp. 717-728
Universal bufferless routing
Costas Busch
,
Malik Magdon-Ismail
,
Marios Mavronicolas
Lecture Notes in Computer Science
3351
, 2005, pp. 239-252
The cost of concurrent, low-contention Read&Modify&Write
Costas Busch
,
Marios Mavronicolas
,
Paul Spirakis
Theoretical Computer Science
333
(3), 2005, pp. 373-400
Efficiency of oblivious versus nonoblivious schedulers for optimistic, rate-based flow control
Panagiota Fatourou
,
Marios Mavronicolas
,
Paul Spirakis
SIAM Journal on Computing
34
(5), 2005, pp. 1216-1252
Seiten 1
2
3
>