Competitive analysis of k-server variants and metrical task systems by Coester, C

Sorting with predictions by Bai, X, Coester, C

Pure entropic regularization for metrical task systems by Coester, C, Lee, JR

The online 𝑘-taxi problem by Coester, C, Koutsoupias, E

Online metric allocation and time-varying regularization by Bansal, N, Coester, C

Learning-augmented priority queues by Benomar, Z, Coester, C

Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle by Coester, C, Koutsoupias, E

The randomized k-server conjecture is false! by Bubeck, S, Coester, C, Rabani, Y

Shortest paths without a map, but with an entropic regularizer by Bubeck, S, Coester, C, Rabani, Y

The infinite server problem by Coester, C, Koutsoupias, E, Lazos, P

Unweighted layered graph traversal: passing a crown via entropy maximization by Bai, X, Coester, C, Cosson, R

The infinite server problem by Coester, C, Koutsoupias, E, Lazos, F

Online k-taxi via Double Coverage and time-reverse primal-dual by Buchbinder, N, Coester, C, Naor, JS

Online k-taxi via Double Coverage and time-reverse primal-dual by Buchbinder, N, Coester, C, Naor, J

Metrical service systems with transformations by Bubeck, S, Buchbinder, N, Coester, C, Sellke, M

Competitive algorithms for block-aware caching by Coester, C, Levin, R, Naor, J, Talmon, O

Unbounded lower bound for k-server against weak adversaries by Bienkowski, M, Byrka, J, Coester, C, Jeż, L

Learning-augmented dynamic power management with multiple states via new ski rental bounds by Antoniadis, A, Coester, C, Eliáš, M, Polak, A, Simon, B

Online metric algorithms with untrusted predictions by Antoniadis, A, Coester, C, Elias, M, Polak, A, Simon, B

Mixing predictions for online metric algorithms by Antoniadis, A, Coester, C, Eliáš, M, Polak, A, Simon, B