Christian Coester | DeepAI

DeepAI AI Chat

Featured Co-authors

Sébastien Bubeck
54 publications
Ravi Kumar
29 publications
Nikhil Bansal
28 publications
Mark Sellke
26 publications
Adam Polak
21 publications
Jaroslaw Byrka
16 publications
Marek Chrobak
15 publications
Antonios Antoniadis
15 publications
Marcin Bienkowski
14 publications
Elias Koutsoupias
14 publications
Bertrand Simon
13 publications

∙ 04/04/2023

Mixing predictions for online metric algorithms

A major technique in learning-augmented online algorithms is combining m...

0 Antonios Antoniadis, et al. ∙

∙ 11/10/2022

The Randomized k-Server Conjecture is False!

We prove a few new lower bounds on the randomized competitive ratio for ...

0 Sébastien Bubeck, et al. ∙

∙ 02/09/2022

Shortest Paths without a Map, but with an Entropic Regularizer

In a 1989 paper titled "shortest paths without a map", Papadimitriou and...

0 Sébastien Bubeck, et al. ∙

∙ 11/30/2021

Online metric allocation

We introduce a natural online allocation problem that connects several o...

0 Nikhil Bansal, et al. ∙

∙ 10/25/2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

We study the online problem of minimizing power consumption in systems w...

0 Antonios Antoniadis, et al. ∙

∙ 02/20/2021

Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle

The k-server conjecture, first posed by Manasse, McGeoch and Sleator in ...

0 Christian Coester, et al. ∙

∙ 11/18/2020

Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging

Inspired by Belady's optimal algorithm for unweighted paging, we conside...

0 Nikhil Bansal, et al. ∙

∙ 09/17/2020

Metrical Service Systems with Transformations

We consider a generalization of the fundamental online metrical service ...

0 Sébastien Bubeck, et al. ∙

∙ 03/04/2020

Online metric algorithms with untrusted predictions

Machine-learned predictors, although achieving very good results for inp...

0 Antonios Antoniadis, et al. ∙

∙ 11/05/2019

Unbounded lower bound for k-server against weak adversaries

We study the resource augmented version of the k-server problem, also kn...

0 Marcin Bienkowski, et al. ∙

∙ 06/10/2019

Pure entropic regularization for metrical task systems

We show that on every n-point HST metric, there is a randomized online a...

0 Christian Coester, et al. ∙

∙ 11/22/2018

Better Bounds for Online Line Chasing

We study online competitive algorithms for the line chasing problem in E...

0 Marcin Bienkowski, et al. ∙

∙ 07/17/2018

The Online k-Taxi Problem

We consider the online k-taxi problem, a generalization of the k-server ...

0 Christian Coester, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world