{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:33:13Z","timestamp":1758475993690,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["160364472"],"award-info":[{"award-number":["160364472"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538595","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"345-356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The k-Server with Preferences Problem"],"prefix":"10.1145","author":[{"given":"Jannik","family":"Castenow","sequence":"first","affiliation":[{"name":"Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany"}]},{"given":"Bj\u00f6rn","family":"Feldkord","sequence":"additional","affiliation":[{"name":"Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany"}]},{"given":"Till","family":"Knollmann","sequence":"additional","affiliation":[{"name":"Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany"}]},{"given":"Manuel","family":"Malatyali","sequence":"additional","affiliation":[{"name":"Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[{"name":"Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Paderborn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459925"},{"key":"e_1_3_2_1_2_1","volume-title":"The online k -server problem with rejection. Discrete Optimization 13 (Aug","author":"Bittner Emese","year":"2014","unstructured":"Emese Bittner , Csan\u00e1d Imreh , and Judit Nagy-Gy\u00f6rgy . 2014. The online k -server problem with rejection. Discrete Optimization 13 (Aug . 2014 ), 1--15. https: \/\/doi.org\/10.1016\/j.disopt.2014.03.002 10.1016\/j.disopt.2014.03.002 Emese Bittner, Csan\u00e1d Imreh, and Judit Nagy-Gy\u00f6rgy. 2014. The online k -server problem with rejection. Discrete Optimization 13 (Aug. 2014), 1--15. https: \/\/doi.org\/10.1016\/j.disopt.2014.03.002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146588"},{"key":"e_1_3_2_1_4_1","volume-title":"Automata, Languages and Programming (Lecture Notes in Computer Science), Luca Aceto, Monika Henzinger, and Ji?\u00ed Sgall (Eds.)","author":"B\u00f6ckenhauer Hans-Joachim","year":"2006","unstructured":"Hans-Joachim B\u00f6ckenhauer , Dennis Komm , and Richard Kr\u00e1lovi?. 2011. On the Advice Complexity of the k-Server Problem . In Automata, Languages and Programming (Lecture Notes in Computer Science), Luca Aceto, Monika Henzinger, and Ji?\u00ed Sgall (Eds.) . Springer , Berlin, Heidelberg , 207--218. https:\/\/doi.org\/10.1007\/978--3--642--2 2006 --7_18 10.1007\/978--3--642--22006--7_18 Hans-Joachim B\u00f6ckenhauer, Dennis Komm, and Richard Kr\u00e1lovi?. 2011. On the Advice Complexity of the k-Server Problem. In Automata, Languages and Programming (Lecture Notes in Computer Science), Luca Aceto, Monika Henzinger, and Ji?\u00ed Sgall (Eds.). Springer, Berlin, Heidelberg, 207--218. https:\/\/doi.org\/10.1007\/978--3--642--22006--7_18"},{"key":"#cr-split#-e_1_3_2_1_5_1.1","doi-asserted-by":"crossref","unstructured":"Jannik Castenow Bj\u00f6rn Feldkord Till Knollmann Manuel Malatyali and Friedhelm Meyer auf der Heide. 2022. The k-Server with Preferences Problem. https:\/\/doi.org\/10.48550\/ARXIV.2205.11102 10.48550\/ARXIV.2205.11102","DOI":"10.1145\/3490148.3538595"},{"key":"#cr-split#-e_1_3_2_1_5_1.2","doi-asserted-by":"crossref","unstructured":"Jannik Castenow Bj\u00f6rn Feldkord Till Knollmann Manuel Malatyali and Friedhelm Meyer auf der Heide. 2022. The k-Server with Preferences Problem. https:\/\/doi.org\/10.48550\/ARXIV.2205.11102","DOI":"10.1145\/3490148.3538595"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320209"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220008"},{"key":"e_1_3_2_1_8_1","unstructured":"Jon Kleinberg and \u00c9va Tardos. 2014. Algorithm design (pearson new internat. ed. [der] 1.ed ed.). Pearson Harlow.  Jon Kleinberg and \u00c9va Tardos. 2014. Algorithm design (pearson new internat. ed. [der] 1.ed ed.). Pearson Harlow."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.04.002"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00010-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/210118.210128"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46541-3_48"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62243"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538595","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":15,"alternative-id":["10.1145\/3490148.3538595","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538595","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}