Regular biography
Christian Coester is an Associate Professor of Computer Science at the University of Oxford, Department of Computer Science. His research focuses on algorithms and complexity theory, particularly online algorithms and learning-augmented algorithms. He is interested in the design and theoretical analysis of algorithms, especially those that handle uncertainty and make decisions without complete information. His work includes contributions to problems such as the k-server conjecture and the development of new algorithmic techniques. Coester is also involved in mentoring and supervising postdoctoral researchers and students. His research is supported by an ERC Starting Grant.
Scholar-generated biography
Christian Coester is a researcher at the University of Oxford, specializing in online algorithms and learning-augmented algorithms. His work explores the design and analysis of algorithms that make decisions in real-time with incomplete information, often incorporating predictive models to improve performance. Coester's research includes topics such as online metric algorithms, weighted paging, and dynamic power management, with a focus on integrating machine learning predictions into algorithmic decision-making. His publications address challenges in areas like priority queues, metric allocation, and the k-server problem, contributing to the theoretical foundations of online computation and algorithmic robustness.