default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Coester
Person information
- affiliation: University of Oxford, UK
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i20]Xingjian Bai, Christian Coester, Romain Cosson:
Unweighted Layered Graph Traversal. CoRR abs/2404.16176 (2024)- [i19]Ziyad Benomar, Christian Coester:
Learning-Augmented Priority Queues. CoRR abs/2406.04793 (2024) - 2023
- [j4]Niv Buchbinder, Christian Coester
, Joseph Naor:
Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. 197(2): 499-527 (2023) - [j3]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online Metric Algorithms with Untrusted Predictions. ACM Trans. Algorithms 19(2): 19:1-19:34 (2023) - [c18]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Mixing Predictions for Online Metric Algorithms. ICML 2023: 969-983 - [c17]Xingjian Bai, Christian Coester:
Sorting with Predictions. NeurIPS 2023 - [c16]Sébastien Bubeck, Christian Coester, Yuval Rabani:
The Randomized k-Server Conjecture Is False! STOC 2023: 581-594 - [i18]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Mixing predictions for online metric algorithms. CoRR abs/2304.01781 (2023) - [i17]Xingjian Bai, Christian Coester:
Sorting with Predictions. CoRR abs/2311.00749 (2023) - 2022
- [j2]Christian Coester, James R. Lee:
Pure Entropic Regularization for Metrical Task Systems. Adv. Math. Commun. 18: 1-24 (2022) - [c15]Nikhil Bansal, Christian Coester:
Online Metric Allocation and Time-Varying Regularization. ESA 2022: 13:1-13:13 - [c14]Sébastien Bubeck, Christian Coester, Yuval Rabani:
Shortest Paths without a Map, but with an Entropic Regularizer. FOCS 2022: 1102-1113 - [c13]Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee:
Learning-Augmented Weighted Paging. SODA 2022: 67-89 - [c12]Christian Coester, Roie Levin, Joseph (Seffi) Naor, Ohad Talmon:
Competitive Algorithms for Block-Aware Caching. SPAA 2022: 161-172 - [i16]Sébastien Bubeck, Christian Coester, Yuval Rabani:
Shortest Paths without a Map, but with an Entropic Regularizer. CoRR abs/2202.04551 (2022) - [i15]Christian Coester, Roie Levin, Joseph Naor, Ohad Talmon:
Competitive Algorithms for Block-Aware Caching. CoRR abs/2205.12249 (2022) - [i14]Sébastien Bubeck, Christian Coester, Yuval Rabani:
The Randomized k-Server Conjecture is False! CoRR abs/2211.05753 (2022) - 2021
- [j1]Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. ACM Trans. Algorithms 17(3): 20:1-20:23 (2021) - [c11]Christian Coester, Elias Koutsoupias:
Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle. ICALP 2021: 57:1-57:20 - [c10]Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke:
Metrical Service Systems with Transformations. ITCS 2021: 21:1-21:20 - [c9]Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. IPCO 2021: 15-29 - [c8]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. NeurIPS 2021: 16714-16726 - [i13]Christian Coester, Elias Koutsoupias:
Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle. CoRR abs/2102.10474 (2021) - [i12]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. CoRR abs/2110.13116 (2021) - [i11]Nikhil Bansal, Christian Coester:
Online metric allocation. CoRR abs/2111.15169 (2021) - 2020
- [b1]Christian Coester:
Competitive analysis of k-server variants and metrical task systems. University of Oxford, UK, 2020 - [c7]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. ICML 2020: 345-355 - [c6]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. STOC 2020: 1165-1169 - [i10]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. CoRR abs/2003.02144 (2020) - [i9]Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke:
Metrical Service Systems with Transformations. CoRR abs/2009.08266 (2020) - [i8]Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee:
Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging. CoRR abs/2011.09076 (2020) - [i7]Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR abs/2012.02226 (2020)
2010 – 2019
- 2019
- [c5]Christian Coester, James R. Lee:
Pure entropic regularization for metrical task systems. COLT 2019: 835-848 - [c4]Christian Coester, Thomas Schwentick, Martin Schuster:
Winning Strategies for Streaming Rewriting Games. FCT 2019: 49-63 - [c3]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. MFCS 2019: 8:1-8:13 - [c2]Christian Coester, Elias Koutsoupias:
The online k-taxi problem. STOC 2019: 1136-1147 - [i6]Christian Coester, James R. Lee:
Pure entropic regularization for metrical task systems. CoRR abs/1906.04270 (2019) - [i5]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. CoRR abs/1911.01592 (2019) - 2018
- [i4]Christian Coester, Thomas Schwentick, Martin Schuster:
Streaming Rewriting Games: Winning Strategies and Complexity. CoRR abs/1804.10292 (2018) - [i3]Christian Coester, Elias Koutsoupias:
The Online k-Taxi Problem. CoRR abs/1807.06645 (2018) - [i2]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. CoRR abs/1811.09233 (2018) - 2017
- [c1]Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. ICALP 2017: 14:1-14:14 - [i1]Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. CoRR abs/1702.08474 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
