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