The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marios Mavronicolas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
    The Impact of Network Structure on the Stability of Greedy Protocols. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:251-263 [Conf]
  2. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The Price of Anarchy for Polynomial Social Cost. [Citation Graph (0, 0)][DBLP]
    Computing and Markets, 2005, pp:- [Conf]
  3. Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
    A Cost Mechanism for Fair Pricing of Resource Usage. [Citation Graph (0, 0)][DBLP]
    Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
  4. Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
    Cost Sharing Mechanisms for Fair Pricing of Resources Usage. [Citation Graph (0, 0)][DBLP]
    Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
  5. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
    Direct Routing: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:134-145 [Conf]
  6. Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
    A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:1003-1016 [Conf]
  7. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    A Combinatorial Characterization of Properties Preserved by Antitokens. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:575-582 [Conf]
  8. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer
    Near-Optimal Hot-Potato Routing on Trees. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:820-827 [Conf]
  9. Marios Mavronicolas, André Schiper
    Distributed Systems and Algorithms. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:551-552 [Conf]
  10. Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis
    Optimal, Distributed Decision-Making: The Case of No Communication. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:293-303 [Conf]
  11. Marios Mavronicolas, Nikos Papadakis
    Trade-Off Results for Connection Management. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:340-351 [Conf]
  12. Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
    The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:123-134 [Conf]
  13. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
    Nash Equilibria in Discrete Routing Games with Convex Latency Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:645-657 [Conf]
  14. Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
    The Power of the Defender. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2006, pp:37- [Conf]
  15. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
    Extreme Nash Equilibria. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:1-20 [Conf]
  16. Costas Busch, Marios Mavronicolas
    An Efficient Counting Network. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:380-384 [Conf]
  17. Marios Mavronicolas, Marina Papatriantafilou, Philippas Tsigas
    The Impact of Timing on Linearizability in Counting Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:684-688 [Conf]
  18. Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
    Network Game with Attacker and Protector Entities. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:288-297 [Conf]
  19. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
    Performance and Stability Bounds for Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:239-246 [Conf]
  20. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The Price of Anarchy for Polynomial Social Cost. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:574-585 [Conf]
  21. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
    Which Is the Worst-Case Nash Equilibrium? [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:551-561 [Conf]
  22. Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
    The Price of Defense. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:717-728 [Conf]
  23. Pimitris Fatourou, Marios Mavronicolas, Paul G. Spirakis
    MaxMin Fair Flow Control Sensitive to Priorities. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1998, pp:45-60 [Conf]
  24. Marios Mavronicolas, Loizos Michael, Paul G. Spirakis
    Computing on a Partially Eponymous Ring. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:380-394 [Conf]
  25. Costas Busch, Marios Mavronicolas
    The Strength of Counting Networks (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:311- [Conf]
  26. Costas Busch, Nikos Hardavellas, Marios Mavronicolas
    Contention in Counting Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:404- [Conf]
  27. Costas Busch, Marios Mavronicolas
    A Combinatorial Treatment of Balancing Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:206-215 [Conf]
  28. Costas Busch, Marios Mavronicolas
    A Logarithmic Depth Counting Network (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:274- [Conf]
  29. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
    Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:139-148 [Conf]
  30. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
    The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:311- [Conf]
  31. Leonidas Hadjimitsis, Marios Mavronicolas
    Contention in Balancing Networks Resolved (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:41-50 [Conf]
  32. Sarantos Kapidakis, Marios Mavronicolas
    Load Balancing Networks (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:275- [Conf]
  33. Marios Mavronicolas
    The Impact of Synchronization on the Session Problem. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:379- [Conf]
  34. Marios Mavronicolas
    Wait-Free Solvability Via Combinatorial Topology (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:277- [Conf]
  35. Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
    Sequentially Consistent versus Linearizable Counting Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:133-142 [Conf]
  36. Marios Mavronicolas, Paul G. Spirakis
    Optimal, Distributed Decision-Making: The Case of no Communication. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:279- [Conf]
  37. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
    Advances in Rate-Based Flow Control. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:266-281 [Conf]
  38. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
    The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:244-258 [Conf]
  39. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    Threshold Counters with Increments and Decrements. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:47-61 [Conf]
  40. Costas Busch, Marios Mavronicolas, Paul G. Spirakis
    The Cost of Concurrent, Low-Contention Read-Modify-Write. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:57-72 [Conf]
  41. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
    Instability of Networks with Quasi-Static Link Capacities. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:179-194 [Conf]
  42. Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
    Approximate Equilibria and Ball Fusion. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:223-235 [Conf]
  43. William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
    Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:393-403 [Conf]
  44. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
    A New Model for Selfish Routing. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:547-558 [Conf]
  45. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    Computing Nash equilibria for scheduling on restricted parallel links. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:613-622 [Conf]
  46. Marios Mavronicolas, Paul G. Spirakis
    The price of selfish routing. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:510-519 [Conf]
  47. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
    Universal Bufferless Routing. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:239-252 [Conf]
  48. Nikos Hardavellas, Damianos Karakos, Marios Mavronicolas
    Notes on Sorting and Counting Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1993, pp:234-248 [Conf]
  49. Maria Eleftheriou, Marios Mavronicolas
    Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions. [Citation Graph (0, 0)][DBLP]
    DISC, 1999, pp:327-341 [Conf]
  50. Marios Mavronicolas, Dan Roth
    Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1992, pp:346-361 [Conf]
  51. Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
    On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:88-102 [Conf]
  52. Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
    A Cost Mechanism for Fair Pricing of Resource Usage. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:210-224 [Conf]
  53. Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
    A Graph-Theoretic Network Security Game. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:969-978 [Conf]
  54. Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:195-209 [Conf]
  55. Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis
    The Price of Defense and Fractional Matchings. [Citation Graph (0, 0)][DBLP]
    ICDCN, 2006, pp:115-126 [Conf]
  56. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
    Direct Routing: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:1, pp:45-68 [Journal]
  57. William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou
    Supporting Increment and Decrement Operations in Balancing Networks. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal]
  58. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    A Combinatorial Characterization of Properties Preserved by Antitokens. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:71, n:, pp:114-132 [Journal]
  59. Costas Busch, Marios Mavronicolas, Paul G. Spirakis
    An Application of the Monotone Linearizability Lemma. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:85, n:, pp:70-80 [Journal]
  60. Marios Mavronicolas
    Annotated Bibliography on Counting Networks. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:72, n:, pp:123-132 [Journal]
  61. Marios Mavronicolas
    Stability in Routing: Networks and Protocols. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:74, n:, pp:119-134 [Journal]
  62. Marios Mavronicolas
    The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:73, n:, pp:99-106 [Journal]
  63. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
    FIFO is Unstable at Arbitrarily Low Rates [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:016, pp:- [Journal]
  64. Costas Busch, Marios Mavronicolas
    Impossibility Results for Weak Threshold Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:2, pp:85-90 [Journal]
  65. Marios Mavronicolas
    Balancing Networks: State of the Art. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1997, v:97, n:1&2, pp:125-157 [Journal]
  66. Costas Busch, Marios Mavronicolas
    A Combinatorial Treatment of Balancing Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:5, pp:794-839 [Journal]
  67. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
    Max-min Fair Flow Control Sensitive to Priorities. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2005, v:6, n:2, pp:85-114 [Journal]
  68. Hagit Attiya, Marios Mavronicolas
    Efficiency of Semisynchronous Versus. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:6, pp:547-571 [Journal]
  69. Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
    The Impact of Network Structure on the Stability of Greedy Protocols. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:4, pp:425-460 [Journal]
  70. Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
    Approximate Equilibria and Ball Fusion. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:6, pp:683-693 [Journal]
  71. Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
    A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2003, v:13, n:4, pp:615-627 [Journal]
  72. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The Price of Anarchy for Restricted Parallel Links. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:1, pp:117-132 [Journal]
  73. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
    Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1216-1252 [Journal]
  74. Samson Abramsky, Marios Mavronicolas
    Game Theory Meets Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:1-3 [Journal]
  75. Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
    Threshold counters with increments and decrements. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:811-826 [Journal]
  76. Costas Busch, Marios Mavronicolas, Paul G. Spirakis
    The cost of concurrent, low-contention Read&Modify&Write. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:3, pp:373-400 [Journal]
  77. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
    Structure and complexity of extreme Nash equilibria. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:133-157 [Journal]
  78. Marios Mavronicolas, Nikos Papadakis
    Trade-off results for connection management. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:1-57 [Journal]
  79. Marios Mavronicolas, Dan Roth
    Linearizable Read/Write Objects. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:267-319 [Journal]
  80. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The price of anarchy for polynomial social cost. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:116-135 [Journal]
  81. Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
    Congestion Games with Player-Specific Constants. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:633-644 [Conf]
  82. Marios Mavronicolas, Paul G. Spirakis
    The Price of Selfish Routing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:1, pp:91-126 [Journal]
  83. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
    Efficient bufferless packet switching on trees and leveled networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:11, pp:1168-1186 [Journal]
  84. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
    Performance and stability bounds for dynamic networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:4, pp:386-399 [Journal]
  85. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
    The increase of the instability of networks due to Quasi-Static link capacities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:44-56 [Journal]

  86. How Many Attackers Can Selfish Defenders Catch? [Citation Graph (, )][DBLP]


  87. Voronoi Games on Cycle Graphs. [Citation Graph (, )][DBLP]


  88. The impact of randomization in smoothing networks. [Citation Graph (, )][DBLP]


  89. An upper and a lower bound for tick synchronization. [Citation Graph (, )][DBLP]


  90. A randomized, o(log w)-depth 2 smoothing network. [Citation Graph (, )][DBLP]


  91. Weighted Boolean Formula Games. [Citation Graph (, )][DBLP]


  92. Nash Equilibria for Voronoi Games on Transitive Graphs. [Citation Graph (, )][DBLP]


  93. Facets of the Fully Mixed Nash Equilibrium Conjecture. [Citation Graph (, )][DBLP]


  94. A Network Game with Attackers and a Defender. [Citation Graph (, )][DBLP]


  95. Cost Sharing Mechanisms for Fair Pricing of Resource Usage. [Citation Graph (, )][DBLP]


  96. How Many Attackers Can Selfish Defenders Catch? [Citation Graph (, )][DBLP]


  97. Sequentially consistent versus linearizable counting networks. [Citation Graph (, )][DBLP]


  98. A substitution theorem for graceful trees and its applications. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002