[an error occurred while processing this directive]<meta name="keywords" content="Department of Computer Science, publications, by date, Christian Coester"></meta><meta name="description" content="Publications, by date, Department of Computer Science, Oxford, Christian Coester"></meta><title>Department of Computer Science, University of Oxford: Christian Coester : 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/Christian.Coester"><span itemprop="name">Christian Coester</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>Christian Coester : Publications
</h1></div><div role="toolbar" class="btn-toolbar"><div class="btn-group"><a href="/people/publications/date/Christian.Coester.html" aria-hidden="true" type="button" class="btn btn-oxford-blue"><span class="glyphicon glyphicon-sort-by-attributes"></span> By date</a><a href="/people/publications/title/Christian.Coester.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/Christian.Coester.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By type</a><a href="/people/publications/bibtex/Christian.Coester.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-file"></span> BibTex</a></div></div><p></p><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>
            Learning&#x2212;Augmented Weighted Paging </strong> </p>
	    <p class="publicationAuthors"> <em> Nikhil Bansal&#x201a; Christian Coester&#x201a; Ravi Kumar&#x201a; Manish Purohit and Erik Vee  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 2022 ACM&#x2212;SIAM Symposium on Discrete Algorithms (SODA)</em>.
        2022.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15659-abstract.html">
			Details <span class="sr-only" > about <em> Learning&#x2212;Augmented Weighted Paging  </em></span> </a> |
			<a href="/publications/publication15659.bib">
			BibTeX  <span class="sr-only" > data for <em> Learning&#x2212;Augmented Weighted Paging  </em></span>   </a>
			
			
					| <a href="https://arxiv.org/pdf/2011.09076.pdf"> Download (pdf)  <span class="sr-only" > of <em> Learning&#x2212;Augmented Weighted Paging  </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>
            Online Metric Allocation and Time&#x2212;Varying Regularization </strong> </p>
	    <p class="publicationAuthors"> <em> Nikhil Bansal and Christian Coester  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            30th Annual European Symposium on Algorithms (ESA)</em>.
        2022.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15658-abstract.html">
			Details <span class="sr-only" > about <em> Online Metric Allocation and Time&#x2212;Varying Regularization  </em></span> </a> |
			<a href="/publications/publication15658.bib">
			BibTeX  <span class="sr-only" > data for <em> Online Metric Allocation and Time&#x2212;Varying Regularization  </em></span>   </a>
			
			
					| <a href="https://drops.dagstuhl.de/opus/volltexte/2022/16951/pdf/LIPIcs-ESA-2022-13.pdf"> Download (pdf)  <span class="sr-only" > of <em> Online Metric Allocation and Time&#x2212;Varying Regularization  </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>
            Shortest Paths without a Map&#x201a; but with an Entropic Regularizer </strong> </p>
	    <p class="publicationAuthors"> <em> S&#xe9;bastien Bubeck&#x201a; Christian Coester and Yuval Rabani  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            63nd IEEE Annual Symposium on Foundations of Computer Science (FOCS)</em>.
        2022.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15657-abstract.html">
			Details <span class="sr-only" > about <em> Shortest Paths without a Map&#x201a; but with an Entropic Regularizer  </em></span> </a> |
			<a href="/publications/publication15657.bib">
			BibTeX  <span class="sr-only" > data for <em> Shortest Paths without a Map&#x201a; but with an Entropic Regularizer  </em></span>   </a>
			
			
					| <a href="https://arxiv.org/pdf/2202.04551.pdf"> Download (pdf)  <span class="sr-only" > of <em> Shortest Paths without a Map&#x201a; but with an Entropic Regularizer  </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>
            Unbounded Lower Bound for k&#x2212;Server against Weak Adversaries </strong> </p>
	    <p class="publicationAuthors"> <em> Marcin Bienkowski&#x201a; Jaroslaw Byrka&#x201a; Christian Coester and &#x0141;ukasz Je&#x017c;  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC)</em>.
        2020.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15665-abstract.html">
			Details <span class="sr-only" > about <em> Unbounded Lower Bound for k&#x2212;Server against Weak Adversaries  </em></span> </a> |
			<a href="/publications/publication15665.bib">
			BibTeX  <span class="sr-only" > data for <em> Unbounded Lower Bound for k&#x2212;Server against Weak Adversaries  </em></span>   </a>
			
			
					| <a href="https://arxiv.org/pdf/1911.01592.pdf"> Download (pdf)  <span class="sr-only" > of <em> Unbounded Lower Bound for k&#x2212;Server against Weak Adversaries  </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>
            Online Metric Algorithms with Untrusted Predictions </strong> </p>
	    <p class="publicationAuthors"> <em> Antonios Antoniadis&#x201a; Christian Coester&#x201a; Marek Eli&#xe1;s&#x201a; Adam Polak and Bertrand Simon  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 37th International Conference on Machine Learning (ICML)</em>.
        2020.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15664-abstract.html">
			Details <span class="sr-only" > about <em> Online Metric Algorithms with Untrusted Predictions  </em></span> </a> |
			<a href="/publications/publication15664.bib">
			BibTeX  <span class="sr-only" > data for <em> Online Metric Algorithms with Untrusted Predictions  </em></span>   </a>
			
			
					| <a href="https://arxiv.org/pdf/2003.02144.pdf"> Download (pdf)  <span class="sr-only" > of <em> Online Metric Algorithms with Untrusted Predictions  </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>
            The Online <span style="font-family: serif">k</span>&#x2212;Taxi Problem </strong> </p>
	    <p class="publicationAuthors"> <em> Christian Coester and Elias Koutsoupias  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC)</em>.
        2019.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15667-abstract.html">
			Details <span class="sr-only" > about <em> The Online <span style="font-family: serif">k</span>&#x2212;Taxi Problem  </em></span> </a> |
			<a href="/publications/publication15667.bib">
			BibTeX  <span class="sr-only" > data for <em> The Online <span style="font-family: serif">k</span>&#x2212;Taxi Problem  </em></span>   </a>
			
			
					| <a href="https://arxiv.org/pdf/1807.06645.pdf"> Download (pdf)  <span class="sr-only" > of <em> The Online <span style="font-family: serif">k</span>&#x2212;Taxi Problem  </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>
            Pure Entropic Regularization for Metrical Task Systems </strong> </p>
	    <p class="publicationAuthors"> <em> Christian Coester and James R. Lee  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Conference on Learning Theory (COLT)</em>.
        2019.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication15666-abstract.html">
			Details <span class="sr-only" > about <em> Pure Entropic Regularization for Metrical Task Systems  </em></span> </a> |
			<a href="/publications/publication15666.bib">
			BibTeX  <span class="sr-only" > data for <em> Pure Entropic Regularization for Metrical Task Systems  </em></span>   </a>
			
			
					| <a href="https://arxiv.org/pdf/1906.04270.pdf"> Download (pdf)  <span class="sr-only" > of <em> Pure Entropic Regularization for Metrical Task Systems  </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]