Marios Mavronicolas

154 papers A* 18A 8B 27C 2Misc 1Journal 69Unranked 25
YearRankTypeTitle / Venue / Authors
2026 J jnl
Instant Runoff Voting on Graphs: Exclusion Zones and Distortion.
CoRR
Georgios Birmpas, Georgios Chionas, Efthyvoulos Drousiotis, Soodeh Habibi, Marios Mavronicolas, Pavlos G. Spirakis
2026 — ed.
Web and Internet Economics - 20th International Conference, WINE 2024, Edinburgh, UK, December 2-5, 2024, Proceedings
WINE
Marios Mavronicolas, Qi Qi, Grant Schoenebeck
2025 B conf
Mixed Nash Equilibria in Discrete Tullock Contests.
SAGT
Vittorio Bilò, Marios Mavronicolas, Paul G. Spirakis, Daniel Windisch
2024 J jnl
Which is the Worst-Case Nash Equilibrium?
SIAM J. Discret. Math.
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto
2023 C ed.
Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings
CIAC
Marios Mavronicolas
2023 B conf
Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games.
SAGT
Vittorio Bilò, Kristoffer Arnsfelt Hansen, Marios Mavronicolas
2023 B conf
The Contest Game for Crowdsourcing Reviews.
SAGT
Marios Mavronicolas, Paul G. Spirakis
2023 J jnl
The Contest Game for Crowdsourcing Reviews.
CoRR
Marios Mavronicolas, Paul G. Spirakis
2022 J jnl
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions.
Theory Comput. Syst.
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
2021 J jnl
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games.
Algorithmica
Vittorio Bilò, Marios Mavronicolas
2021 J jnl
The Price of Defense.
Algorithmica
Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis
2021 J jnl
The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values.
Theor. Comput. Sci.
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
2021 J jnl
∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games.
ACM Trans. Economics and Comput.
Vittorio Bilò, Marios Mavronicolas
2020 J jnl
(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations.
CoRR
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
2020 J jnl
Conditional Value-at-Risk: Structure and complexity of equilibria.
Theor. Comput. Sci.
Marios Mavronicolas, Burkhard Monien
2019 J jnl
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games.
CoRR
Vittorio Bilò, Marios Mavronicolas
2017 B conf
Conditional Value-at-Risk: Structure and Complexity of Equilibria.
SAGT
Marios Mavronicolas, Burkhard Monien
2017 A conf
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games.
STACS
Vittorio Bilò, Marios Mavronicolas
2016 A conf
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
STACS
Vittorio Bilò, Marios Mavronicolas
2016 J jnl
The complexity of equilibria for risk-modeling valuations.
Theor. Comput. Sci.
Marios Mavronicolas, Burkhard Monien
2015 J jnl
Minimizing Expectation Plus Variance.
Theory Comput. Syst.
Marios Mavronicolas, Burkhard Monien
2015 J jnl
The Complexity of Equilibria for Risk-Modeling Valuations.
CoRR
Marios Mavronicolas, Burkhard Monien
2015 J jnl
The complexity of pure equilibria in mix-weighted congestion games on parallel links.
Inf. Process. Lett.
Marios Mavronicolas, Burkhard Monien
2015 — conf
Weighted Boolean Formula Games.
Algorithms, Probability, Networks, and Games
Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
2014 J jnl
Complexity of Rational and Irrational Nash Equilibria.
Theory Comput. Syst.
Vittorio Bilò, Marios Mavronicolas
2013 A* conf
A distributed algorithm for gathering many fat mobile robots in the plane.
PODC
Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas
2013 J jnl
How many attackers can selfish defenders catch?
Discret. Appl. Math.
Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta
2012 J jnl
A Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane
CoRR
Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas
2012 B conf
Minimizing Expectation Plus Variance.
SAGT
Marios Mavronicolas, Burkhard Monien
2012 B conf
The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games.
SAGT
Vittorio Bilò, Marios Mavronicolas
2012 — conf
Topic 8: Distributed Systems and Algorithms.
Euro-Par
Andrzej Goscinski, Marios Mavronicolas, Weisong Shi, Yong Meng Teo
2011 B conf
Complexity of Rational and Irrational Nash Equilibria.
SAGT
Vittorio Bilò, Marios Mavronicolas
2011 J jnl
Preface: Algorithmic Game Theory.
Theory Comput. Syst.
Marios Mavronicolas
2010 J jnl
An efficient counting network.
Theor. Comput. Sci.
Costas Busch, Marios Mavronicolas
2010 J jnl
Computing Nash Equilibria for Scheduling on Restricted Parallel Links.
Theory Comput. Syst.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2010 J jnl
Facets of the Fully Mixed Nash Equilibrium Conjecture.
Theory Comput. Syst.
Rainer Feldmann, Marios Mavronicolas, Andreas Pieris
2010 J jnl
Some Algorithmic Questions About Nash Equilibria.
Bull. EATCS
Marios Mavronicolas
2010 J jnl
The impact of randomization in smoothing networks.
Distributed Comput.
Marios Mavronicolas, Thomas Sauerwald
2009 J jnl
A glimpse at Christos H. Papadimitriou.
Comput. Sci. Rev.
Marios Mavronicolas, Paul G. Spirakis
2009 B conf
A randomized, o(log w)-depth 2 smoothing network.
SPAA
Marios Mavronicolas, Thomas Sauerwald
2009 J jnl
A substitution theorem for graceful trees and its applications.
Discret. Math.
Marios Mavronicolas, Loizos Michael
2009 B ed.
Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings
SAGT
Marios Mavronicolas, Vicky G. Papadopoulou
2009 J jnl
Computing on a partially eponymous ring.
Theor. Comput. Sci.
Marios Mavronicolas, Loizos Michael, Paul G. Spirakis
2009 — conf
Nash Equilibria for Voronoi Games on Transitive Graphs.
WINE
Rainer Feldmann, Marios Mavronicolas, Burkhard Monien
2009 J jnl
Preface.
Theor. Comput. Sci.
Marios Mavronicolas
2009 J jnl
Preface.
Theor. Comput. Sci.
Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis
2009 J jnl
Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer).
SIGACT News
Marios Mavronicolas
2009 J jnl
The structure and complexity of Nash equilibria for a selfish routing game.
Theor. Comput. Sci.
Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
2008 J jnl
A Network Game with Attackers and a Defender.
Algorithmica
Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis
2008 J jnl
A graph-theoretic network security game.
Int. J. Auton. Adapt. Commun. Syst.
Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
2008 J jnl
A new model for selfish routing.
Theor. Comput. Sci.
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2008 J jnl
Cost Sharing Mechanisms for Fair Pricing of Resource Usage.
Algorithmica
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2008 B conf
Facets of the Fully Mixed Nash Equilibrium Conjecture.
SAGT
Rainer Feldmann, Marios Mavronicolas, Andreas Pieris
2008 — conf
How Many Attackers Can Selfish Defenders Catch?
HICSS
Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou
2008 J jnl
How Many Attackers Can Selfish Defenders Catch?
CoRR
Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou
2008 J jnl
Nash equilibria in discrete routing games with convex latency functions.
J. Comput. Syst. Sci.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2008 J jnl
Sequentially consistent versus linearizable counting networks.
Distributed Comput.
Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
2008 A* conf
The impact of randomization in smoothing networks.
PODC
Marios Mavronicolas, Thomas Sauerwald
2008 B conf
Voronoi Games on Cycle Graphs.
MFCS
Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann
2007 B conf
Congestion Games with Player-Specific Constants.
MFCS
Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
2007 J jnl
Efficient bufferless packet switching on trees and leveled networks.
J. Parallel Distributed Comput.
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
2007 J jnl
Performance and stability bounds for dynamic networks.
J. Parallel Distributed Comput.
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
2007 J jnl
The Price of Selfish Routing.
Algorithmica
Marios Mavronicolas, Paul G. Spirakis
2007 J jnl
The increase of the instability of networks due to Quasi-Static link capacities.
Theor. Comput. Sci.
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
2007 J jnl
Universal Bufferless Packet Switching.
SIAM J. Comput.
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
2007 — conf
Weighted Boolean Formula Games.
WINE
Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
2006 B conf
Computing on a Partially Eponymous Ring.
OPODIS
Marios Mavronicolas, Loizos Michael, Paul G. Spirakis
2006 J jnl
Direct Routing: Algorithms and Complexity.
Algorithmica
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
2006 — ed.
Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings
WINE
Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis
2006 — conf
The Power of the Defender.
ICDCS Workshops
Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
2006 J jnl
The Price of Anarchy for Restricted Parallel Links.
Parallel Process. Lett.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2006 Misc conf
The Price of Defense and Fractional Matchings.
ICDCN
Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis
2006 B conf
The Price of Defense.
MFCS
Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
2006 J jnl
The price of anarchy for polynomial social cost.
Theor. Comput. Sci.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005 — conf
A Cost Mechanism for Fair Pricing of Resource Usage.
Algorithmic Aspects of Large and Complex Networks
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2005 — conf
A Cost Mechanism for Fair Pricing of Resource Usage.
WINE
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2005 — conf
A Graph-Theoretic Network Security Game.
WINE
Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
2005 — conf
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.
WINE
Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005 J jnl
An Application of the Monotone Linearizability Lemma.
Bull. EATCS
Costas Busch, Marios Mavronicolas, Paul G. Spirakis
2005 — conf
Cost Sharing Mechanisms for Fair Pricing of Resources Usage.
Algorithmic Aspects of Large and Complex Networks
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
2005 J jnl
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.
SIAM J. Comput.
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
2005 J jnl
Game Theory Meets Theoretical Computer Science.
Theor. Comput. Sci.
Samson Abramsky, Marios Mavronicolas
2005 J jnl
Max-min Fair Flow Control Sensitive to Priorities.
J. Interconnect. Networks
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
2005 B conf
Network Game with Attacker and Protector Entities.
ISAAC
Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
2005 J jnl
Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2005 J jnl
The Impact of Network Structure on the Stability of Greedy Protocols.
Theory Comput. Syst.
Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
2005 — conf
The Price of Anarchy for Polynomial Social Cost.
Computing and Markets
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005 J jnl
The cost of concurrent, low-contention Read&Modify&Write.
Theor. Comput. Sci.
Costas Busch, Marios Mavronicolas, Paul G. Spirakis
2004 A conf
A New Model for Selfish Routing.
STACS
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2004 A* conf
Computing Nash equilibria for scheduling on restricted parallel links.
STOC
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004 A conf
Direct Routing: Algorithms and Complexity.
ESA
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
2004 A* conf
Nash Equilibria in Discrete Routing Games with Convex Latency Functions.
ICALP
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2004 — conf
Near-Optimal Hot-Potato Routing on Trees.
Euro-Par
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer
2004 — conf
Performance and Stability Bounds for Dynamic Networks.
ISPAN
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
2004 B conf
The Price of Anarchy for Polynomial Social Cost.
MFCS
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004 B conf
Universal Bufferless Routing.
WAOA
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
2003 J jnl
A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks.
Parallel Process. Lett.
Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
2003 — conf
A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks.
Euro-Par
Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
2003 J jnl
Approximate Equilibria and Ball Fusion.
Theory Comput. Syst.
Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
2003 — conf
Extreme Nash Equilibria.
ICTCS
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2003 J jnl
FIFO is Unstable at Arbitrarily Low Rates
Electron. Colloquium Comput. Complex.
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
2003 B conf
Instability of Networks with Quasi-Static Link Capacities.
SIROCCO
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
2003 B conf
The Cost of Concurrent, Low-Contention Read-Modify-Write.
SIROCCO
Costas Busch, Marios Mavronicolas, Paul G. Spirakis
2003 C conf
The Impact of Network Structure on the Stability of Greedy Protocols.
CIAC
Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
2003 J jnl
Trade-off results for connection management.
Theor. Comput. Sci.
Marios Mavronicolas, Nikos Papadakis
2003 B conf
Which Is the Worst-Case Nash Equilibrium?
MFCS
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
2002 B conf
Approximate Equilibria and Ball Fusion.
SIROCCO
Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
2002 — conf
Distributed Systems and Algorithms.
Euro-Par
Marios Mavronicolas, André Schiper
2002 A conf
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.
DISC
Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
2002 J jnl
Review of Introduction to Distributed Algorithms.
SIGACT News
Marios Mavronicolas
2002 A* conf
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
ICALP
Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
2002 J jnl
Threshold counters with increments and decrements.
Theor. Comput. Sci.
Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
2001 J jnl
Stability in Routing: Networks and Protocols.
Bull. EATCS
Marios Mavronicolas
2001 J jnl
The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example).
Bull. EATCS
Marios Mavronicolas
2001 A* conf
The price of selfish routing.
STOC
Marios Mavronicolas, Paul G. Spirakis
2000 — conf
A Combinatorial Characterization of Properties Preserved by Antitokens.
Euro-Par
Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
2000 J jnl
A Combinatorial Characterization of Properties Preserved by Antitokens.
Bull. EATCS
Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
2000 J jnl
Annotated Bibliography on Counting Networks.
Bull. EATCS
Marios Mavronicolas
2000 J jnl
Supporting Increment and Decrement Operations in Balancing Networks.
Chic. J. Theor. Comput. Sci.
William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
1999 A conf
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions.
DISC
Maria Eleftheriou, Marios Mavronicolas
1999 J jnl
Linearizable Read/Write Objects.
Theor. Comput. Sci.
Marios Mavronicolas, Dan Roth
1999 — ed.
Networks in Distributed Computing, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 27-29, 1997
Networks in Distributed Computing
Marios Mavronicolas, Michael Merritt, Nir Shavit
1999 B conf
Optimal, Distributed Decision-Making: The Case of No Communication.
FCT
Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis
1999 A* conf
Optimal, Distributed Decision-Making: The Case of no Communication.
PODC
Marios Mavronicolas, Paul G. Spirakis
1999 A* conf
Sequentially Consistent versus Linearizable Counting Networks.
PODC
Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
1999 A conf
Supporting Increment and Decrement Operations in Balancing Networks.
STACS
William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
1999 B conf
Threshold Counters with Increments and Decrements.
SIROCCO
Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
1998 — conf
An Efficient Counting Network.
IPPS/SPDP
Costas Busch, Marios Mavronicolas
1998 A* conf
Contention in Balancing Networks Resolved (Extended Abstract).
PODC
Leonidas Hadjimitsis, Marios Mavronicolas
1998 B conf
MaxMin Fair Flow Control Sensitive to Priorities.
OPODIS
Pimitris Fatourou, Marios Mavronicolas, Paul G. Spirakis
1998 A* conf
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
PODC
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
1998 B conf
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
SIROCCO
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
1997 B conf
Advances in Rate-Based Flow Control.
SIROCCO
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
1997 J jnl
Balancing Networks: State of the Art.
Inf. Sci.
Marios Mavronicolas
1997 — ed.
Distributed Algorithms, 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings
WDAG
Marios Mavronicolas, Philippas Tsigas
1997 A* conf
Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).
PODC
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
1997 J jnl
Impossibility Results for Weak Threshold Networks.
Inf. Process. Lett.
Costas Busch, Marios Mavronicolas
1997 — conf
The Impact of Timing on Linearizability in Counting Networks.
IPPS
Marios Mavronicolas, Marina Papatriantafilou, Philippas Tsigas
1997 — conf
Timing-based connection management.
Networks in Distributed Computing
Marios Mavronicolas
1997 B conf
Trade-Off Results for Connection Management.
FCT
Marios Mavronicolas, Nikos Papadakis
1996 J jnl
A Combinatorial Treatment of Balancing Networks.
J. ACM
Costas Busch, Marios Mavronicolas
1996 — conf
Distributed, low contention task allocation.
SPDP
Sarantos Kapidakis, Marios Mavronicolas
1996 A* conf
The Strength of Counting Networks (Abstract).
PODC
Costas Busch, Marios Mavronicolas
1996 A* conf
Wait-Free Solvability Via Combinatorial Topology (Abstract).
PODC
Marios Mavronicolas
1995 A* conf
A Logarithmic Depth Counting Network (Abstract).
PODC
Costas Busch, Marios Mavronicolas
1995 A* conf
Load Balancing Networks (Abstract).
PODC
Sarantos Kapidakis, Marios Mavronicolas
1994 A* conf
A Combinatorial Treatment of Balancing Networks.
PODC
Costas Busch, Marios Mavronicolas
1994 A* conf
Contention in Counting Networks.
PODC
Costas Busch, Nikos Hardavellas, Marios Mavronicolas
1994 J jnl
Efficiency of Semisynchronous Versus.
Math. Syst. Theory
Hagit Attiya, Marios Mavronicolas
1994 — conf
Proving Correctness for Balancing Networks.
Parallel Processing of Discrete Optimization Problems
Costas Busch, Marios Mavronicolas
1994 A* conf
The Impact of Synchronization on the Session Problem.
PODC
Marios Mavronicolas
1993 — conf
Notes on Sorting and Counting Networks (Extended Abstract).
WDAG
Nikos Hardavellas, Damianos G. Karakos, Marios Mavronicolas
1992 A conf
An upper and a lower bound for tick synchronization.
RTSS
Marios Mavronicolas
1992 — conf
Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract).
WDAG
Marios Mavronicolas, Dan Roth