{"id":"https://openalex.org/W2113184918","doi":"https://doi.org/10.1145/2783434","title":"A Polylogarithmic-Competitive Algorithm for the <i>k</i> -Server Problem","display_name":"A Polylogarithmic-Competitive Algorithm for the <i>k</i> -Server Problem","publication_year":2015,"publication_date":"2015-11-02","ids":{"openalex":"https://openalex.org/W2113184918","doi":"https://doi.org/10.1145/2783434","mag":"2113184918"},"language":"en","primary_location":{"id":"doi:10.1145/2783434","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2783434","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Technical University of Eindhoven"],"affiliations":[{"raw_affiliation_string":"Technical University of Eindhoven","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["Tel Aviv University","Tel-Aviv University"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel-Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032574693","display_name":"Aleksander M\u0105dry","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aleksander Madry","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion"],"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":4.6595,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.952005,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"62","issue":"5","first_page":"1","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9678000211715698,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8753965497016907},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7326278686523438},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.6036386489868164},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.593007504940033},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5531179904937744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5495603680610657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5454207062721252},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5246018171310425},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49240219593048096},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4509904682636261},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44579482078552246},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4362638592720032},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4089079797267914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35164323449134827},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.0936884880065918}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8753965497016907},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7326278686523438},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.6036386489868164},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.593007504940033},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5531179904937744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5495603680610657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5454207062721252},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5246018171310425},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49240219593048096},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4509904682636261},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44579482078552246},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4362638592720032},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4089079797267914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35164323449134827},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0936884880065918},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2783434","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2783434","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/67676ed4-9084-459c-97c0-15a318425911","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/67676ed4-9084-459c-97c0-15a318425911","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Buchbinder, N, Madry, A & Naor, J 2015, 'A polylogarithmic-competitive algorithm for the k-server problem', Journal of the ACM, vol. 62, no. 5, 40, pp. 1-49. https://doi.org/10.1145/2783434","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/67676ed4-9084-459c-97c0-15a318425911","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/67676ed4-9084-459c-97c0-15a318425911","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM, 62(5):40, 1 - 49. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1923724101","https://openalex.org/W1974264551","https://openalex.org/W1998843748","https://openalex.org/W2006393845","https://openalex.org/W2007840228","https://openalex.org/W2012286291","https://openalex.org/W2013255427","https://openalex.org/W2025874591","https://openalex.org/W2033156334","https://openalex.org/W2041571997","https://openalex.org/W2041645394","https://openalex.org/W2051069559","https://openalex.org/W2054033098","https://openalex.org/W2062780596","https://openalex.org/W2067086474","https://openalex.org/W2069255833","https://openalex.org/W2082099352","https://openalex.org/W2082353536","https://openalex.org/W2083392624","https://openalex.org/W2086989193","https://openalex.org/W2089998595","https://openalex.org/W2114493937","https://openalex.org/W2116677113","https://openalex.org/W2134666295","https://openalex.org/W2147541332","https://openalex.org/W2150495379","https://openalex.org/W2157650361","https://openalex.org/W2161029651","https://openalex.org/W2170981586","https://openalex.org/W2571257893","https://openalex.org/W3103476680"],"related_works":["https://openalex.org/W2949774048","https://openalex.org/W1867520515","https://openalex.org/W2567853751","https://openalex.org/W1981660486","https://openalex.org/W3081862881","https://openalex.org/W2052224952","https://openalex.org/W2113184918","https://openalex.org/W2767280224","https://openalex.org/W4300816375","https://openalex.org/W2807287186"],"abstract_inverted_index":{"We":[0],"give":[1],"the":[2,9,46],"first":[3],"polylogarithmic-competitive":[4],"randomized":[5],"online":[6],"algorithm":[7,22,43,51],"for":[8,35,60],"k":[10,33,49],"-server":[11],"problem":[12],"on":[13,39],"an":[14],"arbitrary":[15],"finite":[16],"metric":[17,37],"space.":[18],"In":[19],"particular,":[20],"our":[21],"achieves":[23],"a":[24,61],"competitive":[25],"ratio":[26],"of":[27,52,64],"\u00d5(log":[28],"3":[29],"n":[30,40,65],"log":[31],"2":[32],")":[34],"any":[36],"space":[38],"points.":[41],"Our":[42],"improves":[44],"upon":[45],"deterministic":[47],"(2":[48],"-1)-competitive":[50],"Koutsoupias":[53],"and":[54,57],"Papadimitriou":[55,58],"[Koutsoupias":[56],"1995]":[59],"wide":[62],"range":[63],".":[66]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-19T23:35:23.961156","created_date":"2016-06-24T00:00:00"}