[an error occurred while processing this directive]<meta name="keywords" content="Department of Computer Science, publications, by type, Elias Koutsoupias"></meta><meta name="description" content="Publications, by type, Department of Computer Science, Oxford, Elias Koutsoupias"></meta><title>Department of Computer Science, University of Oxford: Elias Koutsoupias : Publications
</title><style type="text/css">
			  .btn-toolbar::after, .btn-toolbar::before
			  {
			    content: " ";
			    display: table;
			  }

			
			.btn-toolbar
			{
			    margin-bottom: 2em;
			}

			  .btn-toolbar::after, .btn-group::after
			  {
			    clear: both;
			  }


			.btn-toolbar .btn, .btn-toolbar .btn-group
			  {
			    float: left;
			}
			
			.btn-group
			  {
			    display: inline-block;
			    position: relative;
			    vertical-align: middle;
			}

			  .btn-group > .btn:first-child:not(:last-child)
			  {
			    border-bottom-right-radius: 0;
			    border-top-right-radius: 0;
			}
			
			.btn-group > .btn:first-child
			  {
			    margin-left: 0;
			}

			.btn-group > .btn
			  {
			    float: left;
			    position: relative;
			}

			  .btn-group > .btn:not(:first-child):not(:last-child)
			  {
			    border-radius: 0;
			}
			
			  .btn-group > .btn:last-child:not(:first-child)
			  {
			    border-bottom-left-radius: 0;
			    border-top-left-radius: 0;
			}
			
			.btn-group .btn + .btn, .btn-group .btn + .btn-group, .btn-group .btn-group + .btn, .btn-group .btn-group + .btn-group
			  {
			    margin-left: -2px;
			}
			</style>[an error occurred while processing this directive]<div class="content-width"><ol class="breadcrumb text-uppercase"><li><a href="/">Home</a></li><li><a href="/aboutus/">About Us</a></li><li><a href="/people/">People</a></li><li><a href="/people/faculty.html">Faculty</a></li><li><a href="/people/Elias.Koutsoupias"><span itemprop="name">Elias Koutsoupias</span></a></li><li class="active">Publications</li></ol></div><!-- MOBILE NAVIGATION --><div class="content-width space-below mobile-menu-placeholder visible-xs visible-sm"></div><!-- COLUMNS --><div class="container-fluid content-width"><div class="row"><div class="col-xs-12 col-md-9 col-md-push-3" id="maincontent"><!-- CONTENT (Column 2) --><div class="page-title"><h1>Elias Koutsoupias : Publications
</h1></div><div role="toolbar" class="btn-toolbar"><div class="btn-group"><a href="/people/publications/date/Elias.Koutsoupias.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By date</a><a href="/people/publications/title/Elias.Koutsoupias.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By title</a><a href="/people/publications/type/Elias.Koutsoupias.html" aria-hidden="true" type="button" class="btn btn-oxford-blue"><span class="glyphicon glyphicon-sort-by-attributes"></span> By type</a><a href="/people/publications/bibtex/Elias.Koutsoupias.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-file"></span> BibTex</a></div></div><p></p><h2>
      Journal papers
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Lower Bound of 1+<span style="font-family: serif">&#x03c6;</span> for Truthful Scheduling Mechanisms </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias and Angelina Vidali  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Algorithmica</em>.
        
            Vol. 66.
        
            No. 1.
        
                Pages 211&#x2212;223.
            2013.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7939-abstract.html">
			Details <span class="sr-only" > about <em> A Lower Bound of 1+<span style="font-family: serif">&#x03c6;</span> for Truthful Scheduling Mechanisms  </em></span> </a> |
			<a href="/publications/publication7939.bib">
			BibTeX  <span class="sr-only" > data for <em> A Lower Bound of 1+<span style="font-family: serif">&#x03c6;</span> for Truthful Scheduling Mechanisms  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the Competitive Ratio of Online Sampling Auctions </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias and George Pierrakos  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>ACM Trans. Economics and Comput.</em>.
        
            Vol. 1.
        
            No. 2.
        
                Pages 10.
            2013.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7937-abstract.html">
			Details <span class="sr-only" > about <em> On the Competitive Ratio of Online Sampling Auctions  </em></span> </a> |
			<a href="/publications/publication7937.bib">
			BibTeX  <span class="sr-only" > data for <em> On the Competitive Ratio of Online Sampling Auctions  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? </strong> </p>
	    <p class="publicationAuthors"> <em> Carlos Fisch Brito&#x201a; Elias Koutsoupias and Shailesh Vaya  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Algorithmica</em>.
        
            Vol. 64.
        
            No. 4.
        
                Pages 584&#x2212;605.
            2012.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7933-abstract.html">
			Details <span class="sr-only" > about <em> Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait?  </em></span> </a> |
			<a href="/publications/publication7933.bib">
			BibTeX  <span class="sr-only" > data for <em> Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait?  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the Performance of Approximate Equilibria in Congestion Games </strong> </p>
	    <p class="publicationAuthors"> <em> George Christodoulou&#x201a; Elias Koutsoupias and Paul G. Spirakis  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Algorithmica</em>.
        
            Vol. 61.
        
            No. 1.
        
                Pages 116&#x2212;140.
            2011.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7926-abstract.html">
			Details <span class="sr-only" > about <em> On the Performance of Approximate Equilibria in Congestion Games  </em></span> </a> |
			<a href="/publications/publication7926.bib">
			BibTeX  <span class="sr-only" > data for <em> On the Performance of Approximate Equilibria in Congestion Games  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[5] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Mechanism Design for Fractional Scheduling on Unrelated Machines </strong> </p>
	    <p class="publicationAuthors"> <em> G. Christodoulou&#x201a; E. Koutsoupias and A. Kov&#xe1;cs  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>ACM Transactions on Algorithms</em>.
        
            Vol. 6.
        
            No. 2.
        2010.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7924-abstract.html">
			Details <span class="sr-only" > about <em> Mechanism Design for Fractional Scheduling on Unrelated Machines  </em></span> </a> |
			<a href="/publications/publication7924.bib">
			BibTeX  <span class="sr-only" > data for <em> Mechanism Design for Fractional Scheduling on Unrelated Machines  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[6] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Mechanism design for scheduling </strong> </p>
	    <p class="publicationAuthors"> <em> George Christodoulou and Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Bulletin of the European Association for Theoretical Computer Science (BEATCS)</em>.
        
            Vol. 97.
        
                Pages 39&#x2212;59.
            February,
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7923-abstract.html">
			Details <span class="sr-only" > about <em> Mechanism design for scheduling  </em></span> </a> |
			<a href="/publications/publication7923.bib">
			BibTeX  <span class="sr-only" > data for <em> Mechanism design for scheduling  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[7] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Lower Bound for Scheduling Mechanisms </strong> </p>
	    <p class="publicationAuthors"> <em> George Christodoulou&#x201a; Elias Koutsoupias and Angelina Vidali  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Algorithmica</em>.
        
            Vol. 55.
        
            No. 4.
        
                Pages 729&#x2212;740.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7920-abstract.html">
			Details <span class="sr-only" > about <em> A Lower Bound for Scheduling Mechanisms  </em></span> </a> |
			<a href="/publications/publication7920.bib">
			BibTeX  <span class="sr-only" > data for <em> A Lower Bound for Scheduling Mechanisms  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[8] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The k&#x2212;server problem </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Computer Science Review</em>.
        
            Vol. 3.
        
            No. 2.
        
                Pages 105&#x2212;118.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7919-abstract.html">
			Details <span class="sr-only" > about <em> The k&#x2212;server problem  </em></span> </a> |
			<a href="/publications/publication7919.bib">
			BibTeX  <span class="sr-only" > data for <em> The k&#x2212;server problem  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[9] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Worst&#x2212;case equilibria </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias and Christos H. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Computer Science Review</em>.
        
            Vol. 3.
        
            No. 2.
        
                Pages 65&#x2212;69.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7917-abstract.html">
			Details <span class="sr-only" > about <em> Worst&#x2212;case equilibria  </em></span> </a> |
			<a href="/publications/publication7917.bib">
			BibTeX  <span class="sr-only" > data for <em> Worst&#x2212;case equilibria  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[10] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Coordination mechanisms </strong> </p>
	    <p class="publicationAuthors"> <em> George Christodoulou&#x201a; Elias Koutsoupias and Akash Nanavati  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Theor. Comput. Sci.</em>.
        
            Vol. 410.
        
            No. 36.
        
                Pages 3327&#x2013;3336.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7915-abstract.html">
			Details <span class="sr-only" > about <em> Coordination mechanisms  </em></span> </a> |
			<a href="/publications/publication7915.bib">
			BibTeX  <span class="sr-only" > data for <em> Coordination mechanisms  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[11] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The structure and complexity of Nash equilibria for a selfish routing game </strong> </p>
	    <p class="publicationAuthors"> <em> Dimitris Fotakis&#x201a; Spyros C. Kontogiannis&#x201a; Elias Koutsoupias&#x201a; Marios Mavronicolas and Paul G. Spirakis  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Theor. Comput. Sci.</em>.
        
            Vol. 410.
        
            No. 36.
        
                Pages 3305&#x2212;3326.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7913-abstract.html">
			Details <span class="sr-only" > about <em> The structure and complexity of Nash equilibria for a selfish routing game  </em></span> </a> |
			<a href="/publications/publication7913.bib">
			BibTeX  <span class="sr-only" > data for <em> The structure and complexity of Nash equilibria for a selfish routing game  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[12] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Coordination mechanisms for congestion games. </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Sigact News</em>.
        
            Vol. 35.
        
            No. 4.
        
                Pages 58&#x2013;71.
            December,
            2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7906-abstract.html">
			Details <span class="sr-only" > about <em> Coordination mechanisms for congestion games.  </em></span> </a> |
			<a href="/publications/publication7906.bib">
			BibTeX  <span class="sr-only" > data for <em> Coordination mechanisms for congestion games.  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[13] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the Competitive Ratio of the Work Function Algorithm for the <span style="font-family: serif">k</span>&#x2212;Server Problem </strong> </p>
	    <p class="publicationAuthors"> <em> Y. Bartal and E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Theoretical Computer Science</em>.
        
            Vol. 324.
        
            No. 2&#x2212;3.
        
                Pages 337&#x2013;345.
            2004.
        </p> <p
            class="publicationNote"> An early version appeared in STACS 2000</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7904-abstract.html">
			Details <span class="sr-only" > about <em> On the Competitive Ratio of the Work Function Algorithm for the <span style="font-family: serif">k</span>&#x2212;Server Problem  </em></span> </a> |
			<a href="/publications/publication7904.bib">
			BibTeX  <span class="sr-only" > data for <em> On the Competitive Ratio of the Work Function Algorithm for the <span style="font-family: serif">k</span>&#x2212;Server Problem  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[14] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The CNN problem and other k&#x2212;server variants </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and D. S. Taylor  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Theoretical Computer Science</em>.
        
            Vol. 324.
        
            No. 2&#x2212;3.
        
                Pages 347&#x2013;359.
            2004.
        </p> <p
            class="publicationNote"> An early version appeared in STACS 2000</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7902-abstract.html">
			Details <span class="sr-only" > about <em> The CNN problem and other k&#x2212;server variants  </em></span> </a> |
			<a href="/publications/publication7902.bib">
			BibTeX  <span class="sr-only" > data for <em> The CNN problem and other k&#x2212;server variants  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[15] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Selfish task allocation </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Bulletin of EATCS</em>.
        
            Vol. 81.
        
                Pages 79&#x2013;88.
            October,
            2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7901-abstract.html">
			Details <span class="sr-only" > about <em> Selfish task allocation  </em></span> </a> |
			<a href="/publications/publication7901.bib">
			BibTeX  <span class="sr-only" > data for <em> Selfish task allocation  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[16] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            More on Randomized On&#x2212;line Algorithms for Caching </strong> </p>
	    <p class="publicationAuthors"> <em> M. Chrobak&#x201a; E. Koutsoupias and J. Noga  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Theoretical Computer Science</em>.
        
            Vol. 290.
        
            No. 3.
        
                Pages 1997&#x2013;2008.
            2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7899-abstract.html">
			Details <span class="sr-only" > about <em> More on Randomized On&#x2212;line Algorithms for Caching  </em></span> </a> |
			<a href="/publications/publication7899.bib">
			BibTeX  <span class="sr-only" > data for <em> More on Randomized On&#x2212;line Algorithms for Caching  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[17] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Approximate equilibria and ball fusion </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias&#x201a; M. Mavronikolas and P. Spirakis  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Theory of Computing Systems</em>.
        
            Vol. 36.
        
            No. 6.
        
                Pages 683&#x2013;693.
            2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7897-abstract.html">
			Details <span class="sr-only" > about <em> Approximate equilibria and ball fusion  </em></span> </a> |
			<a href="/publications/publication7897.bib">
			BibTeX  <span class="sr-only" > data for <em> Approximate equilibria and ball fusion  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[18] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On a model of indexability and its bounds for range queries </strong> </p>
	    <p class="publicationAuthors"> <em> Joseph M. Hellerstein&#x201a; Elias Koutsoupias&#x201a; Daniel P. Miranker&#x201a; Christos H. Papadimitriou and Vasilis Samoladas  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Journal of the ACM (JACM)</em>.
        
            Vol. 49.
        
            No. 1.
        
                Pages 35&#x2013;55.
            2002.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7895-abstract.html">
			Details <span class="sr-only" > about <em> On a model of indexability and its bounds for range queries  </em></span> </a> |
			<a href="/publications/publication7895.bib">
			BibTeX  <span class="sr-only" > data for <em> On a model of indexability and its bounds for range queries  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/http://doi.acm.org/10.1145/505241.505244">
		DOI (http://doi.acm.org/10.1145/505241.505244)
		</a> 
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[19] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Beyond competitive analysis </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and C. H. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>SIAM Journal on Computing</em>.
        
            Vol. 30.
        
            No. 1.
        
                Pages 394&#x2013;400.
            2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7892-abstract.html">
			Details <span class="sr-only" > about <em> Beyond competitive analysis  </em></span> </a> |
			<a href="/publications/publication7892.bib">
			BibTeX  <span class="sr-only" > data for <em> Beyond competitive analysis  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[20] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Competitive implementation of parallel programs </strong> </p>
	    <p class="publicationAuthors"> <em> X. Deng&#x201a; E. Koutsoupias and P. MacKenzie  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Algorithmica</em>.
        
            Vol. 23.
        
            No. 1.
        
                Pages 14&#x2013;30.
            1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7889-abstract.html">
			Details <span class="sr-only" > about <em> Competitive implementation of parallel programs  </em></span> </a> |
			<a href="/publications/publication7889.bib">
			BibTeX  <span class="sr-only" > data for <em> Competitive implementation of parallel programs  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[21] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Three&#x2212;Processor Tasks Are Undecidable </strong> </p>
	    <p class="publicationAuthors"> <em> E. Gafni and E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>SIAM Journal on Computing</em>.
        
            Vol. 28.
        
            No. 3.
        
                Pages 970&#x2013;983.
            1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7887-abstract.html">
			Details <span class="sr-only" > about <em> Three&#x2212;Processor Tasks Are Undecidable  </em></span> </a> |
			<a href="/publications/publication7887.bib">
			BibTeX  <span class="sr-only" > data for <em> Three&#x2212;Processor Tasks Are Undecidable  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[22] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The 2&#x2212;evader problem </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and C. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Information Processing Letters</em>.
        
            Vol. 57.
        
            No. 5.
        
                Pages 249&#x2013;252.
            March,
            1996.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7882-abstract.html">
			Details <span class="sr-only" > about <em> The 2&#x2212;evader problem  </em></span> </a> |
			<a href="/publications/publication7882.bib">
			BibTeX  <span class="sr-only" > data for <em> The 2&#x2212;evader problem  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[23] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the <span style="font-family: serif">k</span>&#x2212;Server Conjecture </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and C. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Journal of the ACM</em>.
        
            Vol. 42.
        
            No. 5.
        
                Pages 971&#x2013;983.
            September,
            1995.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7879-abstract.html">
			Details <span class="sr-only" > about <em> On the <span style="font-family: serif">k</span>&#x2212;Server Conjecture  </em></span> </a> |
			<a href="/publications/publication7879.bib">
			BibTeX  <span class="sr-only" > data for <em> On the <span style="font-family: serif">k</span>&#x2212;Server Conjecture  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[24] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Improvements on Khrapchenko's theorem </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Theoretical Computer Science</em>.
        
            Vol. 116.
        
            No. 2.
        
                Pages 399&#x2013;403.
            August,
            1993.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7877-abstract.html">
			Details <span class="sr-only" > about <em> Improvements on Khrapchenko's theorem  </em></span> </a> |
			<a href="/publications/publication7877.bib">
			BibTeX  <span class="sr-only" > data for <em> Improvements on Khrapchenko's theorem  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[25] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the optimal bisection of a polygon </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias&#x201a; C. H. Papadimitriou and M. Sideri  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>ORSA Journal on Computing</em>.
        
            Vol. 4.
        
            No. 4.
        
                Pages 435&#x2013;438.
            1992.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7875-abstract.html">
			Details <span class="sr-only" > about <em> On the optimal bisection of a polygon  </em></span> </a> |
			<a href="/publications/publication7875.bib">
			BibTeX  <span class="sr-only" > data for <em> On the optimal bisection of a polygon  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[26] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the greedy algorithm for satisfiability </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and C. H. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Information Processing Letters</em>.
        
            Vol. 43.
        
            No. 1.
        
                Pages 53&#x2013;55.
            August,
            1992.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7874-abstract.html">
			Details <span class="sr-only" > about <em> On the greedy algorithm for satisfiability  </em></span> </a> |
			<a href="/publications/publication7874.bib">
			BibTeX  <span class="sr-only" > data for <em> On the greedy algorithm for satisfiability  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li></ul><h2>
      Conference papers
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Approaching utopia: strong truthfulness and externality&#x2212;resistant mechanisms </strong> </p>
	    <p class="publicationAuthors"> <em> Amos Fiat&#x201a; Anna R. Karlin&#x201a; Elias Koutsoupias and Angelina Vidali  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            ITCS</em>.
        
                Pages 221&#x2212;230.
            2013.
        </p> <p
            class="publicationNote"> Also in CoRR abs/1208.3939</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7936-abstract.html">
			Details <span class="sr-only" > about <em> Approaching utopia: strong truthfulness and externality&#x2212;resistant mechanisms  </em></span> </a> |
			<a href="/publications/publication7936.bib">
			BibTeX  <span class="sr-only" > data for <em> Approaching utopia: strong truthfulness and externality&#x2212;resistant mechanisms  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Near&#x2212;optimal multi&#x2212;unit auctions with ordered bidders </strong> </p>
	    <p class="publicationAuthors"> <em> Sayan Bhattacharya&#x201a; Elias Koutsoupias&#x201a; Janardhan Kulkarni&#x201a; Stefano Leonardi&#x201a; Tim Roughgarden and Xiaoming Xu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            ACM Conference on Electronic Commerce</em>.
        
                Pages 91&#x2212;102.
            2013.
        </p> <p
            class="publicationNote"> Also in CoRR abs/1212.2825</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7935-abstract.html">
			Details <span class="sr-only" > about <em> Near&#x2212;optimal multi&#x2212;unit auctions with ordered bidders  </em></span> </a> |
			<a href="/publications/publication7935.bib">
			BibTeX  <span class="sr-only" > data for <em> Near&#x2212;optimal multi&#x2212;unit auctions with ordered bidders  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Contention Issues in Congestion Games </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias and Katia Papakonstantinopoulou  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            ICALP (2)</em>.
        
                Pages 623&#x2212;635.
            2012.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7932-abstract.html">
			Details <span class="sr-only" > about <em> Contention Issues in Congestion Games  </em></span> </a> |
			<a href="/publications/publication7932.bib">
			BibTeX  <span class="sr-only" > data for <em> Contention Issues in Congestion Games  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Beyond myopic best response (in Cournot competition) </strong> </p>
	    <p class="publicationAuthors"> <em> Amos Fiat&#x201a; Elias Koutsoupias&#x201a; Katrina Ligett&#x201a; Yishay Mansour and Svetlana Olonetsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            SODA</em>.
        
                Pages 993&#x2212;1005.
            2012.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7931-abstract.html">
			Details <span class="sr-only" > about <em> Beyond myopic best response (in Cournot competition)  </em></span> </a> |
			<a href="/publications/publication7931.bib">
			BibTeX  <span class="sr-only" > data for <em> Beyond myopic best response (in Cournot competition)  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[5] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Competitive Analysis of Maintaining Frequent Items of a Stream </strong> </p>
	    <p class="publicationAuthors"> <em> Yiannis Giannakopoulos and Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            SWAT</em>.
        
                Pages 340&#x2212;351.
            2012.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7930-abstract.html">
			Details <span class="sr-only" > about <em> Competitive Analysis of Maintaining Frequent Items of a Stream  </em></span> </a> |
			<a href="/publications/publication7930.bib">
			BibTeX  <span class="sr-only" > data for <em> Competitive Analysis of Maintaining Frequent Items of a Stream  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[6] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Recent Developments in the Mechanism Design Problem for Scheduling </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            FAW&#x2212;AAIM</em>.
        
                Pages 6&#x2013;7.
            2011.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7929-abstract.html">
			Details <span class="sr-only" > about <em> Recent Developments in the Mechanism Design Problem for Scheduling  </em></span> </a> |
			<a href="/publications/publication7929.bib">
			BibTeX  <span class="sr-only" > data for <em> Recent Developments in the Mechanism Design Problem for Scheduling  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[7] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Scheduling without payments </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Symposium on Algorithmic Game Theory (SAGT)</em>.
        
                Pages 143&#x2212;153.
            Salerno &#x2212; Amalfi Coast&#x201a; Italy.
        2011.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7928-abstract.html">
			Details <span class="sr-only" > about <em> Scheduling without payments  </em></span> </a> |
			<a href="/publications/publication7928.bib">
			BibTeX  <span class="sr-only" > data for <em> Scheduling without payments  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[8] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the Competitive Ratio of Online Sampling Auctions </strong> </p>
	    <p class="publicationAuthors"> <em> Elias Koutsoupias and George Pierrakos  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            WINE</em>.
        
                Pages 327&#x2212;338.
            December,
            2010.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7938-abstract.html">
			Details <span class="sr-only" > about <em> On the Competitive Ratio of Online Sampling Auctions  </em></span> </a> |
			<a href="/publications/publication7938.bib">
			BibTeX  <span class="sr-only" > data for <em> On the Competitive Ratio of Online Sampling Auctions  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[9] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the Performance of Approximate Equilibria in Congestion Games </strong> </p>
	    <p class="publicationAuthors"> <em> G. Christodoulou&#x201a; E. Koutsoupias and P. Spirakis  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            European Symposium&#x201a; Copenhagen</em>.
        
                Pages 251&#x2013;262.
            Copenhagen&#x201a; Denmark.
        2009.
        </p> <p
            class="publicationNote"> Also in arXiv:cs/0804.3160</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7927-abstract.html">
			Details <span class="sr-only" > about <em> On the Performance of Approximate Equilibria in Congestion Games  </em></span> </a> |
			<a href="/publications/publication7927.bib">
			BibTeX  <span class="sr-only" > data for <em> On the Performance of Approximate Equilibria in Congestion Games  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[10] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Competitive Analysis of Aggregate Max in Windowed Streaming </strong> </p>
	    <p class="publicationAuthors"> <em> Luca Becchetti and Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 36th International Colloquium on Automata&#x201a; Languages&#x201a; and Programming (ICALP)</em>.
        
                Pages 156&#x2212;170.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7922-abstract.html">
			Details <span class="sr-only" > about <em> Competitive Analysis of Aggregate Max in Windowed Streaming  </em></span> </a> |
			<a href="/publications/publication7922.bib">
			BibTeX  <span class="sr-only" > data for <em> Competitive Analysis of Aggregate Max in Windowed Streaming  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[11] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A characterization of 2&#x2212;player mechanisms for scheduling </strong> </p>
	    <p class="publicationAuthors"> <em> G. Christodoulou&#x201a; E. Koutsoupias and A. Vidali  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            ESA 2008&#x201a; 16th Annual European Symposium</em>.
        September,
            2008.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7912-abstract.html">
			Details <span class="sr-only" > about <em> A characterization of 2&#x2212;player mechanisms for scheduling  </em></span> </a> |
			<a href="/publications/publication7912.bib">
			BibTeX  <span class="sr-only" > data for <em> A characterization of 2&#x2212;player mechanisms for scheduling  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[12] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Lower Bound of 1+phi for Truthful Scheduling Mechanisms </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and A. Vidali  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Mathematical Foundations of Computer Science (MFCS)</em>.
        
                Pages 454&#x2212;464.
            Krumlov&#x201a; Czech Republic.
        2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7940-abstract.html">
			Details <span class="sr-only" > about <em> A Lower Bound of 1+phi for Truthful Scheduling Mechanisms  </em></span> </a> |
			<a href="/publications/publication7940.bib">
			BibTeX  <span class="sr-only" > data for <em> A Lower Bound of 1+phi for Truthful Scheduling Mechanisms  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[13] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Mechanism Design for Fractional Scheduling on Unrelated Machines </strong> </p>
	    <p class="publicationAuthors"> <em> G. Christodoulou&#x201a; E. Koutsoupias and A. Kovacs  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            34th International Colloquium on Automata&#x201a; Languages and Programming</em>.
        
                Pages 40&#x2013;52.
            Wroclaw&#x201a; Poland.
        2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7925-abstract.html">
			Details <span class="sr-only" > about <em> Mechanism Design for Fractional Scheduling on Unrelated Machines  </em></span> </a> |
			<a href="/publications/publication7925.bib">
			BibTeX  <span class="sr-only" > data for <em> Mechanism Design for Fractional Scheduling on Unrelated Machines  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[14] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A lower bound for scheduling mechanisms. </strong> </p>
	    <p class="publicationAuthors"> <em> G. Christodoulou&#x201a; E. Koutsoupias and A. Vidali  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            SODA</em>.
        
                Pages 1163&#x2212;1170.
            New Orleans&#x201a; Louisiana&#x201a; USA.
        2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7921-abstract.html">
			Details <span class="sr-only" > about <em> A lower bound for scheduling mechanisms.  </em></span> </a> |
			<a href="/publications/publication7921.bib">
			BibTeX  <span class="sr-only" > data for <em> A lower bound for scheduling mechanisms.  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[15] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Selfish Load Balancing Under Partial Knowledge </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias&#x201a; P. Panagopoulou and P. Spirakis  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Mathematical Foundations of Computer Science (MFCS)</em>.
        
                Pages 609&#x2212;620.
            Krumlov&#x201a; Czech Republic.
        2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7911-abstract.html">
			Details <span class="sr-only" > about <em> Selfish Load Balancing Under Partial Knowledge  </em></span> </a> |
			<a href="/publications/publication7911.bib">
			BibTeX  <span class="sr-only" > data for <em> Selfish Load Balancing Under Partial Knowledge  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[16] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Experiments with an Economic Model of the Worldwide Web. </strong> </p>
	    <p class="publicationAuthors"> <em> Georgios Kouroupas&#x201a; Elias Koutsoupias&#x201a; Christos H. Papadimitriou and Martha Sideri  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            WINE 2005</em>.
        
                Pages 46&#x2212;54.
            Hong Kong&#x201a; China.
        2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7910-abstract.html">
			Details <span class="sr-only" > about <em> Experiments with an Economic Model of the Worldwide Web.  </em></span> </a> |
			<a href="/publications/publication7910.bib">
			BibTeX  <span class="sr-only" > data for <em> Experiments with an Economic Model of the Worldwide Web.  </em></span>   </a>
			
			
					| <a href="http://dx.doi.org/10.1007/11600930_6"> Link <span class="sr-only" > to <em> Experiments with an Economic Model of the Worldwide Web.  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[17] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. </strong> </p>
	    <p class="publicationAuthors"> <em> George Christodoulou and Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            ESA 2005&#x201a; 13th Annual European Symposium</em>.
        
                Pages 59&#x2212;70.
            Palma de Mallorca&#x201a; Spain.
        2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7909-abstract.html">
			Details <span class="sr-only" > about <em> On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.  </em></span> </a> |
			<a href="/publications/publication7909.bib">
			BibTeX  <span class="sr-only" > data for <em> On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.  </em></span>   </a>
			
			
					| <a href="http://dx.doi.org/10.1007/11561071_8"> Link <span class="sr-only" > to <em> On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[18] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The price of anarchy of finite congestion games </strong> </p>
	    <p class="publicationAuthors"> <em> G. Christodoulou and E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            37th ACM Symposium on Theory of Computing</em>.
        
                Pages 67&#x2013;73.
            Baltimore&#x201a; MD&#x201a; USA.
        2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7908-abstract.html">
			Details <span class="sr-only" > about <em> The price of anarchy of finite congestion games  </em></span> </a> |
			<a href="/publications/publication7908.bib">
			BibTeX  <span class="sr-only" > data for <em> The price of anarchy of finite congestion games  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[19] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Competitive analysis of organization networks or multicast acknowledgement: how much to wait? </strong> </p>
	    <p class="publicationAuthors"> <em> C. Brito&#x201a; E. Koutsoupias and S. Vaya  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the ACM&#x2212;SIAM Symposium on Discrete Algorithms (SODA)</em>.
        New Orleans&#x201a; Louisiana&#x201a; USA.
        2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7934-abstract.html">
			Details <span class="sr-only" > about <em> Competitive analysis of organization networks or multicast acknowledgement: how much to wait?  </em></span> </a> |
			<a href="/publications/publication7934.bib">
			BibTeX  <span class="sr-only" > data for <em> Competitive analysis of organization networks or multicast acknowledgement: how much to wait?  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[20] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Coordination Mechanisms </strong> </p>
	    <p class="publicationAuthors"> <em> G. Christodoulou&#x201a; E. Koutsoupias and A. Nanavati.  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Automata&#x201a; Languages and Programming: 31st International Colloquium</em>.
        
                Pages 345&#x2013;357.
            Turku&#x201a; Finland.
        2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7916-abstract.html">
			Details <span class="sr-only" > about <em> Coordination Mechanisms  </em></span> </a> |
			<a href="/publications/publication7916.bib">
			BibTeX  <span class="sr-only" > data for <em> Coordination Mechanisms  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[21] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Congestion Games and Coordination Mechanisms </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Mathematical Foundations of Computer Science 29th International Symposium</em>.
        
                Pages 177&#x2013;179.
            Prague&#x201a; Czech Republic.
        2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7907-abstract.html">
			Details <span class="sr-only" > about <em> Congestion Games and Coordination Mechanisms  </em></span> </a> |
			<a href="/publications/publication7907.bib">
			BibTeX  <span class="sr-only" > data for <em> Congestion Games and Coordination Mechanisms  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[22] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The online matching problem on a line </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and A. Nanavati  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            1st Workshop on Approximation and Online Algorithms</em>.
        
                Pages 179&#x2013;191.
            Budapest&#x201a; Hungary.
        2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7900-abstract.html">
			Details <span class="sr-only" > about <em> The online matching problem on a line  </em></span> </a> |
			<a href="/publications/publication7900.bib">
			BibTeX  <span class="sr-only" > data for <em> The online matching problem on a line  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[23] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. </strong> </p>
	    <p class="publicationAuthors"> <em> D. Fotakis&#x201a; S. Kontogiannis&#x201a; E. Koutsoupias&#x201a; M. Mavronicolas and P. Spirakis  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 29th International Colloquium on Automata&#x201a; Languages&#x201a; and Programming (ICALP)</em>.
        
                Pages 123&#x2013;134.
            Malaga&#x201a; Spain.
        2002.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7914-abstract.html">
			Details <span class="sr-only" > about <em> The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.  </em></span> </a> |
			<a href="/publications/publication7914.bib">
			BibTeX  <span class="sr-only" > data for <em> The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[24] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Approximate equilibria and ball fusion </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias&#x201a; M. Mavronikolas and P. Spirakis  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</em>.
        
                Pages 223&#x2013;235.
            Andros&#x201a; Greece.
        2002.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7898-abstract.html">
			Details <span class="sr-only" > about <em> Approximate equilibria and ball fusion  </em></span> </a> |
			<a href="/publications/publication7898.bib">
			BibTeX  <span class="sr-only" > data for <em> Approximate equilibria and ball fusion  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[25] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Heuristically Optimized Trade&#x2212;offs: A New Paradigm for Power Laws in the Internet </strong> </p>
	    <p class="publicationAuthors"> <em> A.Fabrikant&#x201a; E. Koutsoupias and C. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 29th International Colloquium on Automata&#x201a; Languages&#x201a; and Programming (ICALP)</em>.
        
                Pages 110&#x2013;122.
            Malaga&#x201a; Spain.
        2002.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7896-abstract.html">
			Details <span class="sr-only" > about <em> Heuristically Optimized Trade&#x2212;offs: A New Paradigm for Power Laws in the Internet  </em></span> </a> |
			<a href="/publications/publication7896.bib">
			BibTeX  <span class="sr-only" > data for <em> Heuristically Optimized Trade&#x2212;offs: A New Paradigm for Power Laws in the Internet  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[26] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the Competitive Ratio of the Work Function Algorithm for the <span style="font-family: serif">k</span>&#x2212;Server Problem </strong> </p>
	    <p class="publicationAuthors"> <em> Y. Bartal and E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            17th Annual Symposium on Theoretical Aspects of Computer Science</em>.
        
                Pages 605&#x2013;613.
            Lille&#x201a; France.
        2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7905-abstract.html">
			Details <span class="sr-only" > about <em> On the Competitive Ratio of the Work Function Algorithm for the <span style="font-family: serif">k</span>&#x2212;Server Problem  </em></span> </a> |
			<a href="/publications/publication7905.bib">
			BibTeX  <span class="sr-only" > data for <em> On the Competitive Ratio of the Work Function Algorithm for the <span style="font-family: serif">k</span>&#x2212;Server Problem  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[27] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The CNN Problem and Other <span style="font-family: serif">k</span>&#x2212;Server Variants </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and D. S. Taylor  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            17th Annual Symposium on Theoretical Aspects of Computer Science</em>.
        
                Pages 581&#x2013;592.
            Lille&#x201a; France.
        2000.
        </p> <p
            class="publicationNote"> To appear in Theoretical Computer Science</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7903-abstract.html">
			Details <span class="sr-only" > about <em> The CNN Problem and Other <span style="font-family: serif">k</span>&#x2212;Server Variants  </em></span> </a> |
			<a href="/publications/publication7903.bib">
			BibTeX  <span class="sr-only" > data for <em> The CNN Problem and Other <span style="font-family: serif">k</span>&#x2212;Server Variants  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[28] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Combinatorial optimization in congestion control </strong> </p>
	    <p class="publicationAuthors"> <em> R. Karp&#x201a; E. Koutsoupias&#x201a; C. Papadimitriou and S. Shenker  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 41th Annual Symposium on Foundations of Computer Science</em>.
        
                Pages 66&#x2013;74.
            Redondo Beach&#x201a; CA.
        2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7894-abstract.html">
			Details <span class="sr-only" > about <em> Combinatorial optimization in congestion control  </em></span> </a> |
			<a href="/publications/publication7894.bib">
			BibTeX  <span class="sr-only" > data for <em> Combinatorial optimization in congestion control  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[29] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Worst&#x2212;case equilibria </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and C. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            16th Annual Symposium on Theoretical Aspects of Computer Science</em>.
        
                Pages 404&#x2013;413.
            Trier&#x201a; Germany.
        1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7918-abstract.html">
			Details <span class="sr-only" > about <em> Worst&#x2212;case equilibria  </em></span> </a> |
			<a href="/publications/publication7918.bib">
			BibTeX  <span class="sr-only" > data for <em> Worst&#x2212;case equilibria  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[30] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Weak adversaries for the <span style="font-family: serif">k</span>&#x2212;server problem </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 40th Annual Symposium on Foundations of Computer Science</em>.
        
                Pages 444&#x2013;449.
            New York City&#x201a; NY.
        1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7891-abstract.html">
			Details <span class="sr-only" > about <em> Weak adversaries for the <span style="font-family: serif">k</span>&#x2212;server problem  </em></span> </a> |
			<a href="/publications/publication7891.bib">
			BibTeX  <span class="sr-only" > data for <em> Weak adversaries for the <span style="font-family: serif">k</span>&#x2212;server problem  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[31] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Indexing schemes for random points </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and D. S. Taylor  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 10th Annual ACM&#x2212;SIAM Symposium on Discrete Algorithms</em>.
        
                Pages 596&#x2013;602.
            Baltimore&#x201a; Maryland.
        1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7886-abstract.html">
			Details <span class="sr-only" > about <em> Indexing schemes for random points  </em></span> </a> |
			<a href="/publications/publication7886.bib">
			BibTeX  <span class="sr-only" > data for <em> Indexing schemes for random points  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[32] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Tight bounds for 2&#x2212;dimensional indexing schemes </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and D. S. Taylor  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Seventeenth ACM SIGACT&#x2212;SIGMOD&#x2212;SIGART Symposium on Principles of Database Systems</em>.
        Seattle&#x201a; Washington.
        1998.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7885-abstract.html">
			Details <span class="sr-only" > about <em> Tight bounds for 2&#x2212;dimensional indexing schemes  </em></span> </a> |
			<a href="/publications/publication7885.bib">
			BibTeX  <span class="sr-only" > data for <em> Tight bounds for 2&#x2212;dimensional indexing schemes  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[33] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the analysis of indexing schemes </strong> </p>
	    <p class="publicationAuthors"> <em> J. M. Hellerstein&#x201a; E. Koutsoupias and C. H. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Sixteenth ACM SIGACT&#x2212;SIGMOD&#x2212;SIGART Symposium on Principles of Database Systems</em>.
        
                Pages 249&#x2013;256.
            Tucson&#x201a; Arizona.
        1997.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7884-abstract.html">
			Details <span class="sr-only" > about <em> On the analysis of indexing schemes  </em></span> </a> |
			<a href="/publications/publication7884.bib">
			BibTeX  <span class="sr-only" > data for <em> On the analysis of indexing schemes  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[34] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Searching a fixed graph </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias&#x201a; C. Papadimitriou and M. Yannakakis  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            International Colloquium on Automata&#x201a; Languages&#x201a; and Programming</em>.
        
                Pages 280&#x2013;289.
            Paderborn&#x201a; Germany.
        1996.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7883-abstract.html">
			Details <span class="sr-only" > about <em> Searching a fixed graph  </em></span> </a> |
			<a href="/publications/publication7883.bib">
			BibTeX  <span class="sr-only" > data for <em> Searching a fixed graph  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[35] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Three&#x2212;processor tasks are undecidable </strong> </p>
	    <p class="publicationAuthors"> <em> E. Gafni and E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing</em>.
        
                Pages 271.
            Ottawa&#x201a; Ontario&#x201a; Canada.
        1995.
        </p> <p
            class="publicationNote"> Final version in Siam J. on Comp.</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7888-abstract.html">
			Details <span class="sr-only" > about <em> Three&#x2212;processor tasks are undecidable  </em></span> </a> |
			<a href="/publications/publication7888.bib">
			BibTeX  <span class="sr-only" > data for <em> Three&#x2212;processor tasks are undecidable  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[36] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            An approximation scheme for planar graph TSP </strong> </p>
	    <p class="publicationAuthors"> <em> M. Grigni&#x201a; E. Koutsoupias and C. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 36th Annual Symposium on Foundations of Computer Science</em>.
        
                Pages 640&#x2013;645.
            Milwaukee&#x201a; Wisconsin.
        1995.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7881-abstract.html">
			Details <span class="sr-only" > about <em> An approximation scheme for planar graph TSP  </em></span> </a> |
			<a href="/publications/publication7881.bib">
			BibTeX  <span class="sr-only" > data for <em> An approximation scheme for planar graph TSP  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[37] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Beyond competitive analysis </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and C. H. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceeding 35th Annual Symposium on Foundations of Computer Science</em>.
        
                Pages 394&#x2013;400.
            Santa Fe&#x201a; New Mexico.
        1994.
        </p> <p
            class="publicationNote"> Final version in Siam J. on Comp.</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7893-abstract.html">
			Details <span class="sr-only" > about <em> Beyond competitive analysis  </em></span> </a> |
			<a href="/publications/publication7893.bib">
			BibTeX  <span class="sr-only" > data for <em> Beyond competitive analysis  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[38] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the <span style="font-family: serif">k</span>&#x2212;server conjecture </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias and C. Papadimitriou  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Twenty&#x2212;Sixth Annual ACM Symposium on the Theory of Computing</em>.
        
                Pages 507&#x2013;511.
            Montreal&#x201a; Quebec&#x201a; Canada.
        1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7880-abstract.html">
			Details <span class="sr-only" > about <em> On the <span style="font-family: serif">k</span>&#x2212;server conjecture  </em></span> </a> |
			<a href="/publications/publication7880.bib">
			BibTeX  <span class="sr-only" > data for <em> On the <span style="font-family: serif">k</span>&#x2212;server conjecture  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[39] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Competitive implementation of parallel programs </strong> </p>
	    <p class="publicationAuthors"> <em> X. Deng and E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 4th ACM&#x2212;SIAM Symposium on Discrete Algorithms</em>.
        
                Pages 455&#x2013;461.
            Austin&#x201a; Texas.
        1993.
        </p> <p
            class="publicationNote"> Updated version DKM99</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7890-abstract.html">
			Details <span class="sr-only" > about <em> Competitive implementation of parallel programs  </em></span> </a> |
			<a href="/publications/publication7890.bib">
			BibTeX  <span class="sr-only" > data for <em> Competitive implementation of parallel programs  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[40] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On the optimal bisection of a polygon </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias&#x201a; C. H. Papadimitriou and M. Sideri  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Sixth Annual Symposium on Computational Geometry</em>.
        
                Pages 198&#x2013;202.
            Berkeley&#x201a; California.
        1990.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7876-abstract.html">
			Details <span class="sr-only" > about <em> On the optimal bisection of a polygon  </em></span> </a> |
			<a href="/publications/publication7876.bib">
			BibTeX  <span class="sr-only" > data for <em> On the optimal bisection of a polygon  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li></ul><h2>
      Theses
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On&#x2212;line algorithms and the <span style="font-family: serif">k</span>&#x2212;server conjecture </strong> </p>
	    <p class="publicationAuthors"> <em> E. Koutsoupias  </em> </p>
	
	<p class="publicationDetails">  PhD Thesis University of California&#x201a; San Diego.
        La Jolla&#x201a; California.
        June,
            1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7878-abstract.html">
			Details <span class="sr-only" > about <em> On&#x2212;line algorithms and the <span style="font-family: serif">k</span>&#x2212;server conjecture  </em></span> </a> |
			<a href="/publications/publication7878.bib">
			BibTeX  <span class="sr-only" > data for <em> On&#x2212;line algorithms and the <span style="font-family: serif">k</span>&#x2212;server conjecture  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li></ul></div><div class="col-xs-12 col-md-3 col-md-pull-9 side-menu-col"><h2 class="side-menu-title text-uppercase"><a href="#">About Us</a></h2><ul class="side-menu"><li class="active mobile-menu-source"><a href="/people/">People</a><ul><li class="active"><a href="/people/faculty.html">Faculty</a></li><li><a href="/people/research.html">Research</a></li><li><a href="/people/students.html">Students</a></li><li><a href="/people/support.html">Professional Services</a></li><li><a href="/people/visitingprofessors.html">Visiting Professors</a></li><li><a href="/people/emeritusfaculty.html">Emeritus Faculty</a></li></ul></li><li><a href="/aboutus/vacancies/">Vacancies</a></li><li><a href="/aboutus/women-cs-oxford/index.html">Women in the department</a></li><li><a href="/aboutus/equality-diversity-inclusion/index.html">Equality, diversity and inclusion</a></li><li><a href="https://www.alumniweb.ox.ac.uk/cs/make-a-donation">Support Us</a></li><li><a href="/aboutus/cshistory.html">Our History</a></li><li><a href="/aboutus/contact.html">Contact Us</a></li></ul></div></div></div>[an error occurred while processing this directive]