| Online metric algorithms with untrusted predictions A Antoniadis, C Coester, M Eliáš, A Polak, B Simon ACM Transactions on Algorithms 19 (2), 1-34, 2023 | 94 | 2023 |
| The online 𝑘-taxi problem C Coester, E Koutsoupias Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 29 | 2019 |
| Learning-augmented weighted paging N Bansal, C Coester, R Kumar, M Purohit, E Vee Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 17* | 2022 |
| Pure entropic regularization for metrical task systems C Coester, JR Lee Conference on Learning Theory, 835-848, 2019 | 15 | 2019 |
| The infinite server problem C Coester, E Koutsoupias, P Lazos arXiv preprint arXiv:1702.08474, 2017 | 8 | 2017 |
| Unbounded lower bound for k-server against weak adversaries M Bienkowski, J Byrka, C Coester, Ł Jeż Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 7 | 2020 |
| Learning-augmented dynamic power management with multiple states via new ski rental bounds A Antoniadis, C Coester, M Eliás, A Polak, B Simon Advances in Neural Information Processing Systems 34, 16714-16726, 2021 | 6 | 2021 |
| Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle C Coester, E Koutsoupias arXiv preprint arXiv:2102.10474, 2021 | 6 | 2021 |
| Online metric allocation and time-varying regularization N Bansal, C Coester 30th Annual European Symposium on Algorithms (ESA 2022), 2022 | 5* | 2022 |
| Online k-taxi via Double Coverage and time-reverse primal-dual N Buchbinder, C Coester, J Naor Mathematical Programming 197 (2), 499-527, 2023 | 4 | 2023 |
| Shortest Paths without a Map, but with an Entropic Regularizer S Bubeck, C Coester, Y Rabani 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 3 | 2022 |
| Better bounds for online line chasing M Bienkowski, J Byrka, M Chrobak, C Coester, Ł Jeż, E Koutsoupias arXiv preprint arXiv:1811.09233, 2018 | 3 | 2018 |
| One-pass strategies for context-free games C Cöster | 3 | 2015 |
| The Randomized -Server Conjecture is False! S Bubeck, C Coester, Y Rabani arXiv preprint arXiv:2211.05753, 2022 | 2 | 2022 |
| Competitive Algorithms for Block-Aware Caching C Coester, R Levin, J Naor, O Talmon Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 2 | 2022 |
| Metrical service systems with transformations S Bubeck, N Buchbinder, C Coester, M Sellke arXiv preprint arXiv:2009.08266, 2020 | 2 | 2020 |
| Winning strategies for streaming rewriting games C Coester, T Schwentick, M Schuster Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019 …, 2019 | 1 | 2019 |
| The Randomized 𝑘-Server Conjecture Is False! S Bubeck, C Coester, Y Rabani Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 581-594, 2023 | | 2023 |
| Mixing predictions for online metric algorithms A Antoniadis, C Coester, M Eliáš, A Polak, B Simon arXiv preprint arXiv:2304.01781, 2023 | | 2023 |
| Pure Entropic Regularization for Metrical Task Systems C Coester, JR Lee Theory of Computing 18 (1), 1-24, 2022 | | 2022 |
