Christian Coester

Orcid: 0000-0003-3744-0977

Affiliations:
  • University of Oxford, UK


According to our database1, Christian Coester authored at least 24 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Learning-Augmented Priority Queues.
CoRR, 2024

Unweighted Layered Graph Traversal.
CoRR, 2024

2023
Online Metric Algorithms with Untrusted Predictions.
ACM Trans. Algorithms, April, 2023

Online k-taxi via Double Coverage and time-reverse primal-dual.
Math. Program., February, 2023

The Randomized k-Server Conjecture Is False!
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Sorting with Predictions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Mixing Predictions for Online Metric Algorithms.
Proceedings of the International Conference on Machine Learning, 2023

2022
Pure Entropic Regularization for Metrical Task Systems.
Theory Comput., 2022

Competitive Algorithms for Block-Aware Caching.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Learning-Augmented Weighted Paging.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Shortest Paths without a Map, but with an Entropic Regularizer.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Online Metric Allocation and Time-Varying Regularization.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
The Infinite Server Problem.
ACM Trans. Algorithms, 2021

Online metric allocation.
CoRR, 2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Metrical Service Systems with Transformations.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Competitive analysis of k-server variants and metrical task systems.
PhD thesis, 2020

Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging.
CoRR, 2020

Unbounded lower bound for k-server against weak adversaries.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
The online k-taxi problem.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Better Bounds for Online Line Chasing.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Winning Strategies for Streaming Rewriting Games.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
Streaming Rewriting Games: Winning Strategies and Complexity.
CoRR, 2018


  Loading...