팔로우
Christian Coester
Christian Coester
cs.ox.ac.uk의 이메일 확인됨
제목
인용
인용
연도
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
1332023
The online 𝑘-taxi problem
C Coester, E Koutsoupias
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
342019
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
222022
Pure entropic regularization for metrical task systems
C Coester, JR Lee
Conference on Learning Theory, 835-848, 2019
172019
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
122021
The Randomized -Server Conjecture is False!
S Bubeck, C Coester, Y Rabani
arXiv preprint arXiv:2211.05753, 2022
102022
The infinite server problem
C Coester, E Koutsoupias, P Lazos
arXiv preprint arXiv:1702.08474, 2017
92017
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
82020
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
Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle
C Coester, E Koutsoupias
arXiv preprint arXiv:2102.10474, 2021
72021
Online metric allocation and time-varying regularization
N Bansal, C Coester
30th Annual European Symposium on Algorithms (ESA 2022), 2022
6*2022
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
42023
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
42022
Better bounds for online line chasing
M Bienkowski, J Byrka, M Chrobak, C Coester, Ł Jeż, E Koutsoupias
arXiv preprint arXiv:1811.09233, 2018
42018
Sorting with predictions
X Bai, C Coester
Advances in Neural Information Processing Systems 36, 2024
32024
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
Winning strategies for streaming rewriting games
C Coester, T Schwentick, M Schuster
Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019 …, 2019
12019
Streaming rewriting games: Winning strategies and complexity
C Coester, T Schwentick, M Schuster
arXiv preprint arXiv:1804.10292, 2018
12018
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20