An upper and a lower bound for tick synchronization. - Marios Mavronicolas (RTSS, 1992)

Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract). - Marios Mavronicolas; Dan Roth 001 (WDAG, 1992)

Notes on Sorting and Counting Networks (Extended Abstract). - Nikos Hardavellas; Damianos G. Karakos; Marios Mavronicolas (WDAG, 1993)

Proving Correctness for Balancing Networks. - Costas Busch; Marios Mavronicolas (Parallel Processing of Discrete Optimization Problems, 1994)

Contention in Counting Networks. - Costas Busch; Nikos Hardavellas; Marios Mavronicolas (PODC, 1994)

The Impact of Synchronization on the Session Problem. - Marios Mavronicolas (PODC, 1994)

Efficiency of Semisynchronous Versus. - Hagit Attiya; Marios Mavronicolas (Math. Syst. Theory, 1994)

A Logarithmic Depth Counting Network (Abstract). - Costas Busch; Marios Mavronicolas (PODC, 1995)

Load Balancing Networks (Abstract). - Sarantos Kapidakis; Marios Mavronicolas (PODC, 1995)

The Strength of Counting Networks (Abstract). - Costas Busch; Marios Mavronicolas (PODC, 1996)

Wait-Free Solvability Via Combinatorial Topology (Abstract). - Marios Mavronicolas (PODC, 1996)

Distributed, low contention task allocation. - Sarantos Kapidakis; Marios Mavronicolas (SPDP, 1996)

A Combinatorial Treatment of Balancing Networks. - Costas Busch; Marios Mavronicolas (J. ACM, 1996)

Timing-based connection management. - Marios Mavronicolas (Networks in Distributed Computing, 1997)

The Impact of Timing on Linearizability in Counting Networks. - Marios Mavronicolas; Marina Papatriantafilou; Philippas Tsigas (IPPS, 1997)

Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (PODC, 1997)

Advances in Rate-Based Flow Control. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (SIROCCO, 1997)

Impossibility Results for Weak Threshold Networks. - Costas Busch; Marios Mavronicolas (Inf. Process. Lett., 1997)

Balancing Networks: State of the Art. - Marios Mavronicolas (Inf. Sci., 1997)

MaxMin Fair Flow Control Sensitive to Priorities. - Pimitris Fatourou; Marios Mavronicolas; Paul G. Spirakis (OPODIS, 1998)

Contention in Balancing Networks Resolved (Extended Abstract). - Leonidas Hadjimitsis; Marios Mavronicolas (PODC, 1998)

The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (SIROCCO, 1998)

Optimal, Distributed Decision-Making: The Case of No Communication. - Stavros Georgiades; Marios Mavronicolas; Paul G. Spirakis (FCT, 1999)

Optimal, Distributed Decision-Making: The Case of no Communication. - Marios Mavronicolas; Paul G. Spirakis (PODC, 1999)

Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions. - Maria Eleftheriou; Marios Mavronicolas (DISC, 1999)

Linearizable Read/Write Objects. - Marios Mavronicolas; Dan Roth 001 (Theor. Comput. Sci., 1999)

Supporting Increment and Decrement Operations in Balancing Networks. - William Aiello; Costas Busch; Maurice Herlihy; Marios Mavronicolas; Nir Shavit; Dan Touitou (Chic. J. Theor. Comput. Sci., 2000)

A Combinatorial Characterization of Properties Preserved by Antitokens. - Costas Busch; Neophytos Demetriou; Maurice Herlihy; Marios Mavronicolas (Bull. EATCS, 2000)

Annotated Bibliography on Counting Networks. - Marios Mavronicolas (Bull. EATCS, 2000)

Stability in Routing: Networks and Protocols. - Marios Mavronicolas (Bull. EATCS, 2001)

The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example). - Marios Mavronicolas (Bull. EATCS, 2001)

Distributed Systems and Algorithms. - Marios Mavronicolas; André Schiper (Euro-Par, 2002)

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. - Dimitrios Koukopoulos; Marios Mavronicolas; Sotiris E. Nikoletseas; Paul G. Spirakis (DISC, 2002)

Review of Introduction to Distributed Algorithms. - Marios Mavronicolas (SIGACT News, 2002)

Threshold counters with increments and decrements. - Costas Busch; Neophytos Demetriou; Maurice Herlihy; Marios Mavronicolas (Theor. Comput. Sci., 2002)

Extreme Nash Equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (ICTCS, 2003)

Which Is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode; Paul G. Spirakis; Imrich Vrto (MFCS, 2003)

Instability of Networks with Quasi-Static Link Capacities. - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (SIROCCO, 2003)

FIFO is Unstable at Arbitrarily Low Rates - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (Electron. Colloquium Comput. Complex., 2003)

Approximate Equilibria and Ball Fusion. - Elias Koutsoupias; Marios Mavronicolas; Paul G. Spirakis (Theory Comput. Syst., 2003)

A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks. - Ioannis Chatzigiannakis; Tassos Dimitriou; Marios Mavronicolas; Sotiris E. Nikoletseas; Paul G. Spirakis (Parallel Process. Lett., 2003)

Trade-off results for connection management. - Marios Mavronicolas; Nikos Papadakis (Theor. Comput. Sci., 2003)

Near-Optimal Hot-Potato Routing on Trees. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas; Roger Wattenhofer (Euro-Par, 2004)

Universal Bufferless Routing. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas (WAOA, 2004)

A Cost Mechanism for Fair Pricing of Resource Usage. - Marios Mavronicolas; Panagiota N. Panagopoulou; Paul G. Spirakis (Algorithmic Aspects of Large and Complex Networks, 2005)

Cost Sharing Mechanisms for Fair Pricing of Resources Usage. - Marios Mavronicolas; Panagiota N. Panagopoulou; Paul G. Spirakis (Algorithmic Aspects of Large and Complex Networks, 2005)

Network Game with Attacker and Protector Entities. - Marios Mavronicolas; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (ISAAC, 2005)

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. - Robert Elsässer; Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (WINE, 2005)

An Application of the Monotone Linearizability Lemma. - Costas Busch; Marios Mavronicolas; Paul G. Spirakis (Bull. EATCS, 2005)

Max-min Fair Flow Control Sensitive to Priorities. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (J. Interconnect. Networks, 2005)

The Impact of Network Structure on the Stability of Greedy Protocols. - Dimitrios Koukopoulos; Marios Mavronicolas; Sotiris E. Nikoletseas; Paul G. Spirakis (Theory Comput. Syst., 2005)

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. - Panagiota Fatourou; Marios Mavronicolas; Paul G. Spirakis (SIAM J. Comput., 2005)

Game Theory Meets Theoretical Computer Science. - Samson Abramsky; Marios Mavronicolas (Theor. Comput. Sci., 2005)

The cost of concurrent, low-contention Read&Modify&Write. - Costas Busch; Marios Mavronicolas; Paul G. Spirakis (Theor. Comput. Sci., 2005)

Structure and complexity of extreme Nash equilibria. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis (Theor. Comput. Sci., 2005)

The Price of Defense and Fractional Matchings. - Marios Mavronicolas; Vicky G. Papadopoulou; Giuseppe Persiano; Anna Philippou; Paul G. Spirakis (ICDCN, 2006)

The Power of the Defender. - Marina Gelastou; Marios Mavronicolas; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (ICDCS Workshops, 2006)

The Price of Defense. - Marios Mavronicolas; Loizos Michael; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (MFCS, 2006)

Direct Routing: Algorithms and Complexity. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas; Paul G. Spirakis (Algorithmica, 2006)

The Price of Anarchy for Restricted Parallel Links. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Parallel Process. Lett., 2006)

The price of anarchy for polynomial social cost. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2006)

Congestion Games with Player-Specific Constants. - Marios Mavronicolas; Igal Milchtaich; Burkhard Monien; Karsten Tiemann (MFCS, 2007)

The Price of Selfish Routing. - Marios Mavronicolas; Paul G. Spirakis (Algorithmica, 2007)

Efficient bufferless packet switching on trees and leveled networks. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas (J. Parallel Distributed Comput., 2007)

Performance and stability bounds for dynamic networks. - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (J. Parallel Distributed Comput., 2007)

Universal Bufferless Packet Switching. - Costas Busch; Malik Magdon-Ismail; Marios Mavronicolas (SIAM J. Comput., 2007)

The increase of the instability of networks due to Quasi-Static link capacities. - Dimitrios Koukopoulos; Marios Mavronicolas; Paul G. Spirakis (Theor. Comput. Sci., 2007)

Voronoi Games on Cycle Graphs. - Marios Mavronicolas; Burkhard Monien; Vicky G. Papadopoulou; Florian Schoppmann (MFCS, 2008)

A Network Game with Attackers and a Defender. - Marios Mavronicolas; Vicky Papadopoulou; Anna Philippou; Paul G. Spirakis (Algorithmica, 2008)

Cost Sharing Mechanisms for Fair Pricing of Resource Usage. - Marios Mavronicolas; Panagiota N. Panagopoulou; Paul G. Spirakis (Algorithmica, 2008)

Sequentially consistent versus linearizable counting networks. - Marios Mavronicolas; Michael Merritt; Gadi Taubenfeld (Distributed Comput., 2008)

A graph-theoretic network security game. - Marios Mavronicolas; Vicky G. Papadopoulou; Anna Philippou; Paul G. Spirakis (Int. J. Auton. Adapt. Commun. Syst., 2008)

Nash equilibria in discrete routing games with convex latency functions. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode (J. Comput. Syst. Sci., 2008)

A new model for selfish routing. - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Manuel Rode (Theor. Comput. Sci., 2008)

A randomized, o(log w)-depth 2 smoothing network. - Marios Mavronicolas; Thomas Sauerwald (SPAA, 2009)

Nash Equilibria for Voronoi Games on Transitive Graphs. - Rainer Feldmann; Marios Mavronicolas; Burkhard Monien (WINE, 2009)

A glimpse at Christos H. Papadimitriou. - Marios Mavronicolas; Paul G. Spirakis (Comput. Sci. Rev., 2009)

A substitution theorem for graceful trees and its applications. - Marios Mavronicolas; Loizos Michael (Discret. Math., 2009)

Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer). - Marios Mavronicolas (SIGACT News, 2009)

The structure and complexity of Nash equilibria for a selfish routing game. - Dimitris Fotakis 001; Spyros C. Kontogiannis; Elias Koutsoupias; Marios Mavronicolas; Paul G. Spirakis (Theor. Comput. Sci., 2009)

Preface. - Marios Mavronicolas (Theor. Comput. Sci., 2009)

Computing on a partially eponymous ring. - Marios Mavronicolas; Loizos Michael; Paul G. Spirakis (Theor. Comput. Sci., 2009)

Preface. - Paul G. Spirakis; Marios Mavronicolas; Spyros C. Kontogiannis (Theor. Comput. Sci., 2009)

The impact of randomization in smoothing networks. - Marios Mavronicolas; Thomas Sauerwald (Distributed Comput., 2010)

Some Algorithmic Questions About Nash Equilibria. - Marios Mavronicolas (Bull. EATCS, 2010)

Facets of the Fully Mixed Nash Equilibrium Conjecture. - Rainer Feldmann; Marios Mavronicolas; Andreas Pieris (Theory Comput. Syst., 2010)

Computing Nash Equilibria for Scheduling on Restricted Parallel Links. - Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (Theory Comput. Syst., 2010)

An efficient counting network. - Costas Busch; Marios Mavronicolas (Theor. Comput. Sci., 2010)

Preface: Algorithmic Game Theory. - Marios Mavronicolas (Theory Comput. Syst., 2011)

Topic 8: Distributed Systems and Algorithms. - Andrzej Goscinski; Marios Mavronicolas; Weisong Shi; Yong Meng Teo (Euro-Par, 2012)

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games. - Vittorio Bilò; Marios Mavronicolas (SAGT, 2012)

A distributed algorithm for gathering many fat mobile robots in the plane. - Chrysovalandis Agathangelou; Chryssis Georgiou; Marios Mavronicolas (PODC, 2013)

How many attackers can selfish defenders catch? - Marios Mavronicolas; Burkhard Monien; Vicky Papadopoulou Lesta (Discret. Appl. Math., 2013)

Complexity of Rational and Irrational Nash Equilibria. - Vittorio Bilò; Marios Mavronicolas (Theory Comput. Syst., 2014)

Weighted Boolean Formula Games. - Marios Mavronicolas; Burkhard Monien; Klaus W. Wagner (Algorithms, Probability, Networks, and Games, 2015)

The complexity of pure equilibria in mix-weighted congestion games on parallel links. - Marios Mavronicolas; Burkhard Monien (Inf. Process. Lett., 2015)

Minimizing Expectation Plus Variance. - Marios Mavronicolas; Burkhard Monien (Theory Comput. Syst., 2015)

A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. - Vittorio Bilò; Marios Mavronicolas (STACS, 2016)

The complexity of equilibria for risk-modeling valuations. - Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2016)

Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. - Vittorio Bilò; Marios Mavronicolas (STACS, 2017)

NP NP -Hardness of Equilibria in Case of Risk-Averse Players. - Marios Mavronicolas; Burkhard Monien (Adventures Between Lower Bounds and Higher Altitudes, 2018)

(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations. - Chryssis Georgiou; Marios Mavronicolas; Burkhard Monien (CoRR, 2020)

Conditional Value-at-Risk: Structure and complexity of equilibria. - Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2020)

The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games. - Vittorio Bilò; Marios Mavronicolas (Algorithmica, 2021)

The Price of Defense. - Marios Mavronicolas; Loizos Michael; Vicky Papadopoulou Lesta; Giuseppe Persiano; Anna Philippou; Paul G. Spirakis (Algorithmica, 2021)

The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values. - Chryssis Georgiou; Marios Mavronicolas; Burkhard Monien (Theor. Comput. Sci., 2021)

∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games. - Vittorio Bilò; Marios Mavronicolas (ACM Trans. Economics and Comput., 2021)

(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions. - Chryssis Georgiou; Marios Mavronicolas; Burkhard Monien (Theory Comput. Syst., 2022)

Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games. - Vittorio Bilò; Kristoffer Arnsfelt Hansen; Marios Mavronicolas (SAGT, 2023)

The Contest Game for Crowdsourcing Reviews. - Marios Mavronicolas; Paul G. Spirakis (SAGT, 2023)

Which is the Worst-Case Nash Equilibrium? - Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien; Paul G. Spirakis; Imrich Vrto (SIAM J. Discret. Math., 2024)

Mixed Nash Equilibria in Discrete Tullock Contests. - Vittorio Bilò; Marios Mavronicolas; Paul G. Spirakis; Daniel Windisch (SAGT, 2025)