Streaming Rewriting Games: Winning Strategies and Complexity. - Christian Coester; Thomas Schwentick; Martin Schuster (CoRR, 2018)

Winning Strategies for Streaming Rewriting Games. - Christian Coester; Thomas Schwentick; Martin Schuster (FCT, 2019)

Better Bounds for Online Line Chasing. - Marcin Bienkowski; Jaroslaw Byrka; Marek Chrobak; Christian Coester; Lukasz Jez; Elias Koutsoupias (MFCS, 2019)

The online k-taxi problem. - Christian Coester; Elias Koutsoupias (STOC, 2019)

Unbounded lower bound for k-server against weak adversaries. - Marcin Bienkowski; Jaroslaw Byrka; Christian Coester; Lukasz Jez (STOC, 2020)

Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging. - Nikhil Bansal 001; Christian Coester; Ravi Kumar 001; Manish Purohit; Erik Vee (CoRR, 2020)

Competitive analysis of k-server variants and metrical task systems. - Christian Coester (2020)

Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle. - Christian Coester; Elias Koutsoupias (ICALP, 2021)

Metrical Service Systems with Transformations. - Sébastien Bubeck; Niv Buchbinder; Christian Coester; Mark Sellke (ITCS, 2021)

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (NeurIPS, 2021)

Online metric allocation. - Nikhil Bansal 001; Christian Coester (CoRR, 2021)

The Infinite Server Problem. - Christian Coester; Elias Koutsoupias; Philip Lazos (ACM Trans. Algorithms, 2021)

Online Metric Allocation and Time-Varying Regularization. - Nikhil Bansal 001; Christian Coester (ESA, 2022)

Shortest Paths without a Map, but with an Entropic Regularizer. - Sébastien Bubeck; Christian Coester; Yuval Rabani (FOCS, 2022)

Learning-Augmented Weighted Paging. - Nikhil Bansal 001; Christian Coester; Ravi Kumar 001; Manish Purohit; Erik Vee (SODA, 2022)

Competitive Algorithms for Block-Aware Caching. - Christian Coester; Roie Levin; Joseph (Seffi) Naor; Ohad Talmon (SPAA, 2022)

Pure Entropic Regularization for Metrical Task Systems. - Christian Coester; James R. Lee (Adv. Math. Commun., 2022)

Mixing Predictions for Online Metric Algorithms. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Sorting with Predictions. - Xingjian Bai; Christian Coester (NeurIPS, 2023)

The Randomized k-Server Conjecture Is False! - Sébastien Bubeck; Christian Coester; Yuval Rabani (STOC, 2023)

Online k-taxi via Double Coverage and time-reverse primal-dual. - Niv Buchbinder; Christian Coester; Joseph Naor (Math. Program., 2023)

Online Metric Algorithms with Untrusted Predictions. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ACM Trans. Algorithms, 2023)

Learning-Augmented Priority Queues. - Ziyad Benomar; Christian Coester (NeurIPS, 2024)

Unweighted Layered Graph Traversal. - Xingjian Bai; Christian Coester; Romain Cosson (CoRR, 2024)

Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization. - Xingjian Bai; Christian Coester; Romain Cosson (SODA, 2025)

Smoothed Analysis of Online Metric Problems. - Christian Coester; Jack Umenberger (CoRR, 2025)