Prati
Christian Coester
Christian Coester
University of Oxford
Potvrđena adresa e-pošte na cs.ox.ac.uk
Naslov
Citirano
Citirano
Godina
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
1692023
The online 𝑘-taxi problem
C Coester, E Koutsoupias
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
372019
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
28*2022
Sorting with predictions
X Bai, C Coester
Advances in Neural Information Processing Systems 36, 26563-26584, 2023
222023
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
222023
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
222021
Pure entropic regularization for metrical task systems
C Coester, JR Lee
Conference on Learning Theory, 835-848, 2019
192019
Mixing predictions for online metric algorithms
A Antoniadis, C Coester, M Eliás, A Polak, B Simon
International Conference on Machine Learning, 969-983, 2023
132023
Online metric allocation and time-varying regularization
N Bansal, C Coester
30th Annual European Symposium on Algorithms (ESA 2022), 13: 1-13: 13, 2022
9*2022
The infinite server problem
C Coester, E Koutsoupias, P Lazos
arXiv preprint arXiv:1702.08474, 2017
92017
Online k-taxi via Double Coverage and time-reverse primal-dual
N Buchbinder, C Coester, J Naor
Mathematical Programming 197 (2), 499-527, 2023
72023
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
72020
Learning-augmented priority queues
Z Benomar, C Coester
arXiv preprint arXiv:2406.04793, 2024
62024
Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle
C Coester, E Koutsoupias
arXiv preprint arXiv:2102.10474, 2021
62021
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
52022
Better bounds for online line chasing
M Bienkowski, J Byrka, M Chrobak, C Coester, Ł Jeż, E Koutsoupias
arXiv preprint arXiv:1811.09233, 2018
42018
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
32022
Metrical service systems with transformations
S Bubeck, N Buchbinder, C Coester, M Sellke
arXiv preprint arXiv:2009.08266, 2020
32020
One-pass strategies for context-free games
C Cöster
32015
Unweighted layered graph traversal: Passing a crown via entropy maximization
X Bai, C Coester, R Cosson
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
22025
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20