Christian Coester

Full Name: C.E. Coester
Function(s): Researcher

Email: Christian.Coester@cwi.nl
Telephone: +31 20 592 4386
Room: M237
Department(s): Networks and Optimization

Biography

I'm a postdoctoral researcher, hosted by Nikhil Bansal. My research interests are in theoretical computer science, with a focus on online algorithms. Before coming to CWI, I completed my PhD at the University of Oxford under the supervision of Elias Koutsoupias.

Research

Metrical service systems with transformations, with S. Bubeck, N. Buchbinder, M. Sellke (ITCS '21) (24-minute video)
Online metric algorithms with untrusted predictions, with A. Antoniadis, M. Eliás, A. Polak, B. Simon (ICML '20) (15-minute video)
Unbounded lower bound for k-server against weak adversaries, with M. Bienkowski, J. Byrka, Ł. Jeż (STOC '20) (25-minute video, 6-minute video)
Pure entropic regularization for metrical task systems, with J. R. Lee (COLT '19)
The online k-taxi problem, with E. Koutsoupias (STOC '19)
Better bounds for online line chasing, with M. Bienkowski, J. Byrka, M. Chrobak, Ł. Jeż, E. Koutsoupias (MFCS '19)
Winning strategies for streaming rewriting games, with T. Schwentick, M. Schuster (FCT '19)
The infinite server problem, with E. Koutsoupias, P. Lazos (ICALP '17)

Publications

Bienkowski, M, Byrka, J, Coester, C.E, & Jeż, L. (2020). Unbounded lower bound for k-server against weak adversaries. In Proceedings of the Annual ACM SIGACT Symposium on Theory of Computing (pp. 1165–1169). doi:10.1145/3357713.3384306

Current projects with external funding

Continuous Methods in Discrete Optimization ()