 | 
| |
Online DBLP entries are available for Elias Koutsoupias and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
- Elias Koutsoupias,
David Scot Taylor:
Tight Bounds for 2-Dimensional Indexing Schemes.
PODS 1998: 52-58
- Joseph M. Hellerstein,
Elias Koutsoupias,
Christos H. Papadimitriou:
On the Analysis of Indexing Schemes.
PODS 1997: 249-256
- Elias Koutsoupias,
Christos H. Papadimitriou,
Mihalis Yannakakis:
Searching a Fixed Graph.
ICALP 1996: 280-289
- Elias Koutsoupias,
Christos H. Papadimitriou:
The 2-Evader Problem.
IPL 57(5): 249-252 (1996)
- Michelangelo Grigni,
Elias Koutsoupias,
Christos H. Papadimitriou:
An Approximation Scheme for Planar Graph TSP.
FOCS 1995: 640-645
- Eli Gafni,
Elias Koutsoupias:
3-Processor Tasks Are Undecidable (Abstract).
PODC 1995: 271
- Elias Koutsoupias,
Christos H. Papadimitriou:
On the k-Server Conjecture.
JACM 42(5): 971-983 (1995)
- Elias Koutsoupias,
Christos H. Papadimitriou:
Beyond Competitive Analysis.
FOCS 1994: 394-400
- Elias Koutsoupias,
Christos H. Papadimitriou:
On the k-Server Conjecture.
STOC 1994: 507-511
- Elias Koutsoupias,
Christos H. Papadimitriou:
On the Greedy Algorithm for Satisfiability.
IPL 43(1): 53-55 (1992)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
