Christian Coester : Publications

Conference papers

• [1]

  Learning−Augmented Weighted Paging

  Nikhil Bansal‚ Christian Coester‚ Ravi Kumar‚ Manish Purohit and Erik Vee

  In Proceedings of the 2022 ACM−SIAM Symposium on Discrete Algorithms (SODA). 2022.

  Details about Learning−Augmented Weighted Paging | BibTeX data for Learning−Augmented Weighted Paging | Download (pdf) of Learning−Augmented Weighted Paging

• [2]

  Online Metric Allocation and Time−Varying Regularization

  Nikhil Bansal and Christian Coester

  In 30th Annual European Symposium on Algorithms (ESA). 2022.

  Details about Online Metric Allocation and Time−Varying Regularization | BibTeX data for Online Metric Allocation and Time−Varying Regularization | Download (pdf) of Online Metric Allocation and Time−Varying Regularization

• [3]

  Shortest Paths without a Map‚ but with an Entropic Regularizer

  Sébastien Bubeck‚ Christian Coester and Yuval Rabani

  In 63nd IEEE Annual Symposium on Foundations of Computer Science (FOCS). 2022.

  Details about Shortest Paths without a Map‚ but with an Entropic Regularizer | BibTeX data for Shortest Paths without a Map‚ but with an Entropic Regularizer | Download (pdf) of Shortest Paths without a Map‚ but with an Entropic Regularizer

• [4]

  Unbounded Lower Bound for k−Server against Weak Adversaries

  Marcin Bienkowski‚ Jaroslaw Byrka‚ Christian Coester and Łukasz Jeż

  In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC). 2020.

  Details about Unbounded Lower Bound for k−Server against Weak Adversaries | BibTeX data for Unbounded Lower Bound for k−Server against Weak Adversaries | Download (pdf) of Unbounded Lower Bound for k−Server against Weak Adversaries

• [5]

  Online Metric Algorithms with Untrusted Predictions

  Antonios Antoniadis‚ Christian Coester‚ Marek Eliás‚ Adam Polak and Bertrand Simon

  In Proceedings of the 37th International Conference on Machine Learning (ICML). 2020.

  Details about Online Metric Algorithms with Untrusted Predictions | BibTeX data for Online Metric Algorithms with Untrusted Predictions | Download (pdf) of Online Metric Algorithms with Untrusted Predictions

• [6]

  The Online k−Taxi Problem

  Christian Coester and Elias Koutsoupias

  In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC). 2019.

  Details about The Online k−Taxi Problem | BibTeX data for The Online k−Taxi Problem | Download (pdf) of The Online k−Taxi Problem

• [7]

  Pure Entropic Regularization for Metrical Task Systems

  Christian Coester and James R. Lee

  In Conference on Learning Theory (COLT). 2019.

  Details about Pure Entropic Regularization for Metrical Task Systems | BibTeX data for Pure Entropic Regularization for Metrical Task Systems | Download (pdf) of Pure Entropic Regularization for Metrical Task Systems