 | 2009 |
|---|
| 53 |       | George Christodoulou,
Elias Koutsoupias,
Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games.
ESA 2009: 251-262 |
| 52 | | Luca Becchetti,
Elias Koutsoupias:
Competitive Analysis of Aggregate Max in Windowed Streaming.
ICALP (1) 2009: 156-170 |
| 51 | | George Christodoulou,
Elias Koutsoupias,
Angelina Vidali:
A Lower Bound for Scheduling Mechanisms.
Algorithmica 55(4): 729-740 (2009) |
| 50 | | Elias Koutsoupias:
The k-server problem.
Computer Science Review 3(2): 105-118 (2009) |
| 49 | | Elias Koutsoupias,
Christos H. Papadimitriou:
Worst-case equilibria.
Computer Science Review 3(2): 65-69 (2009) |
| 48 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Elias Koutsoupias,
Marios Mavronicolas,
Paul G. Spirakis:
The structure and complexity of Nash equilibria for a selfish routing game.
Theor. Comput. Sci. 410(36): 3305-3326 (2009) |
| 47 | | George Christodoulou,
Elias Koutsoupias,
Akash Nanavati:
Coordination mechanisms.
Theor. Comput. Sci. 410(36): 3327-3336 (2009) |
| 2008 |
|---|
| 46 | | George Christodoulou,
Elias Koutsoupias,
Angelina Vidali:
A Characterization of 2-Player Mechanisms for Scheduling.
ESA 2008: 297-307 |
| 45 | | George Christodoulou,
Elias Koutsoupias,
Paul G. Spirakis:
On the performance of approximate equilibria in congestion games
CoRR abs/0804.3160: (2008) |
| 44 | | George Christodoulou,
Elias Koutsoupias,
Angelina Vidali:
A characterization of 2-player mechanisms for scheduling
CoRR abs/0807.3427: (2008) |
| 2007 |
|---|
| 43 | | George Christodoulou,
Elias Koutsoupias,
Annamária Kovács:
Mechanism Design for Fractional Scheduling on Unrelated Machines.
ICALP 2007: 40-52 |
| 42 | | Elias Koutsoupias,
Angelina Vidali:
A Lower Bound of 1+phi for Truthful Scheduling Mechanisms.
MFCS 2007: 454-464 |
| 41 | | Elias Koutsoupias,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Selfish Load Balancing Under Partial Knowledge.
MFCS 2007: 609-620 |
| 40 | | George Christodoulou,
Elias Koutsoupias,
Angelina Vidali:
A lower bound for scheduling mechanisms.
SODA 2007: 1163-1170 |
| 2005 |
|---|
| 39 | | George Christodoulou,
Elias Koutsoupias:
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.
ESA 2005: 59-70 |
| 38 | | George Christodoulou,
Elias Koutsoupias:
The price of anarchy of finite congestion games.
STOC 2005: 67-73 |
| 37 | | Georgios Kouroupas,
Elias Koutsoupias,
Christos H. Papadimitriou,
Martha Sideri:
Experiments with an Economic Model of the Worldwide Web.
WINE 2005: 46-54 |
| 36 | | Georgios Kouroupas,
Elias Koutsoupias,
Christos H. Papadimitriou,
Martha Sideri:
An economic model of the worldwide web.
WWW (Special interest tracks and posters) 2005: 934-935 |
| 2004 |
|---|
| 35 | | George Christodoulou,
Elias Koutsoupias,
Akash Nanavati:
Coordination Mechanisms.
ICALP 2004: 345-357 |
| 34 | | Elias Koutsoupias:
Congestion Games and Coordination Mechanisms.
MFCS 2004: 177-179 |
| 33 | | Carlos Brito,
Elias Koutsoupias,
Shailesh Vaya:
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
SODA 2004: 627-635 |
| 32 | | Marek Chrobak,
Elias Koutsoupias:
Coordination mechanisms for congestion games.
SIGACT News 35(4): 58-71 (2004) |
| 31 | | Yair Bartal,
Elias Koutsoupias:
On the competitive ratio of the work function algorithm for the k-server problem.
Theor. Comput. Sci. 324(2-3): 337-345 (2004) |
| 30 | | Elias Koutsoupias,
David Scot Taylor:
The CNN problem and other k-server variants.
Theor. Comput. Sci. 324(2-3): 347-359 (2004) |
| 2003 |
|---|
| 29 | | Elias Koutsoupias,
Akash Nanavati:
The Online Matching Problem on a Line.
WAOA 2003: 179-191 |
| 28 |  | Elias Koutsoupias:
Selfish Task Allocation.
Bulletin of the EATCS 81: 79-88 (2003) |
| 27 | | Marek Chrobak,
Elias Koutsoupias,
John Noga:
More on randomized on-line algorithms for caching.
Theor. Comput. Sci. 290(3): 1997-2008 (2003) |
| 26 | | Elias Koutsoupias,
Marios Mavronicolas,
Paul G. Spirakis:
Approximate Equilibria and Ball Fusion.
Theory Comput. Syst. 36(6): 683-693 (2003) |
| 2002 |
|---|
| 25 | | Alex Fabrikant,
Elias Koutsoupias,
Christos H. Papadimitriou:
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet.
ICALP 2002: 110-122 |
| 24 | | 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 |
| 23 | | Elias Koutsoupias,
Marios Mavronicolas,
Paul G. Spirakis:
Approximate Equilibria and Ball Fusion.
SIROCCO 2002: 223-235 |
| 22 | | Joseph M. Hellerstein,
Elias Koutsoupias,
Daniel P. Miranker,
Christos H. Papadimitriou,
Vasilis Samoladas:
On a model of indexability and its bounds for range queries.
J. ACM 49(1): 35-55 (2002) |
| 2000 |
|---|
| 21 | | Richard M. Karp,
Elias Koutsoupias,
Christos H. Papadimitriou,
Scott Shenker:
Optimization Problems in Congestion Control.
FOCS 2000: 66-74 |
| 20 | | Elias Koutsoupias,
David Scot Taylor:
The CNN Problem and Other k-Server Variants.
STACS 2000: 581-592 |
| 19 | | Yair Bartal,
Elias Koutsoupias:
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.
STACS 2000: 605-613 |
| 18 | | Elias Koutsoupias,
Christos H. Papadimitriou:
Beyond Competitive Analysis.
SIAM J. Comput. 30(1): 300-317 (2000) |
| 1999 |
|---|
| 17 | | Elias Koutsoupias:
Weak Adversaries for the k-Server Problem.
FOCS 1999: 444-449 |
| 16 | | Elias Koutsoupias,
David Scot Taylor:
Indexing Schemes for Random Points.
SODA 1999: 596-602 |
| 15 | | Elias Koutsoupias,
Christos H. Papadimitriou:
Worst-case Equilibria.
STACS 1999: 404-413 |
| 14 | | Xiaotie Deng,
Elias Koutsoupias,
Philip D. MacKenzie:
Competitive Implementation of Parallel Programs.
Algorithmica 23(1): 14-30 (1999) |
| 13 | | Eli Gafni,
Elias Koutsoupias:
Three-Processor Tasks Are Undecidable.
SIAM J. Comput. 28(3): 970-983 (1999) |
| 1998 |
|---|
| 12 | | Elias Koutsoupias,
David Scot Taylor:
Tight Bounds for 2-Dimensional Indexing Schemes.
PODS 1998: 52-58 |
| 1997 |
|---|
| 11 | | Joseph M. Hellerstein,
Elias Koutsoupias,
Christos H. Papadimitriou:
On the Analysis of Indexing Schemes.
PODS 1997: 249-256 |
| 1996 |
|---|
| 10 | | Elias Koutsoupias,
Christos H. Papadimitriou,
Mihalis Yannakakis:
Searching a Fixed Graph.
ICALP 1996: 280-289 |
| 9 | | Elias Koutsoupias,
Christos H. Papadimitriou:
The 2-Evader Problem.
Inf. Process. Lett. 57(5): 249-252 (1996) |
| 1995 |
|---|
| 8 | | Michelangelo Grigni,
Elias Koutsoupias,
Christos H. Papadimitriou:
An Approximation Scheme for Planar Graph TSP.
FOCS 1995: 640-645 |
| 7 | | Eli Gafni,
Elias Koutsoupias:
3-Processor Tasks Are Undecidable (Abstract).
PODC 1995: 271 |
| 6 | | Elias Koutsoupias,
Christos H. Papadimitriou:
On the k-Server Conjecture.
J. ACM 42(5): 971-983 (1995) |
| 1994 |
|---|
| 5 | | Elias Koutsoupias,
Christos H. Papadimitriou:
Beyond Competitive Analysis
FOCS 1994: 394-400 |
| 1993 |
|---|
| 4 | | Xiaotie Deng,
Elias Koutsoupias:
Competitive Implementation of Parallel Programs.
SODA 1993: 455-461 |
| 1992 |
|---|
| 3 | | Elias Koutsoupias,
Christos H. Papadimitriou,
Martha Sideri:
On the Optimal Bisection of a Polygon.
INFORMS Journal on Computing 4(4): 435-438 (1992) |
| 2 | | Elias Koutsoupias,
Christos H. Papadimitriou:
On the Greedy Algorithm for Satisfiability.
Inf. Process. Lett. 43(1): 53-55 (1992) |
| 1990 |
|---|
| 1 | | Elias Koutsoupias,
Christos H. Papadimitriou,
Martha Sideri:
On the Optimal Bisection of a Polygon (Extended Abstract).
Symposium on Computational Geometry 1990: 198-202 |
