{"id":"https://openalex.org/W2062780596","doi":"https://doi.org/10.1137/s0097539799351882","title":"A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems","display_name":"A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2062780596","doi":"https://doi.org/10.1137/s0097539799351882","mag":"2062780596"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799351882","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799351882","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Avrim Blum","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087578885","display_name":"Howard Karloff","orcid":"https://orcid.org/0000-0003-4490-2324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Howard Karloff","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010842984","display_name":"Yuval Rabani","orcid":"https://orcid.org/0000-0001-7772-2544"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Rabani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Saks","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024803432"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":3.0002,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.91955585,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"30","issue":"5","first_page":"1624","last_page":"1661"},"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.9914000034332275,"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.9733999967575073,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7031283974647522},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6888270378112793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6802273988723755},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5958391427993774},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5654023289680481},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5113431811332703},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5041743516921997},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4496399462223053},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.43070217967033386},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10251298546791077},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09153765439987183}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7031283974647522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6888270378112793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6802273988723755},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5958391427993774},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5654023289680481},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5113431811332703},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5041743516921997},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4496399462223053},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.43070217967033386},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10251298546791077},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09153765439987183},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539799351882","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799351882","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W148397604","https://openalex.org/W1552828154","https://openalex.org/W1970647593","https://openalex.org/W1981660486","https://openalex.org/W2003016446","https://openalex.org/W2011670396","https://openalex.org/W2038661317","https://openalex.org/W2041645394","https://openalex.org/W2051069559","https://openalex.org/W2054033098","https://openalex.org/W2056760235","https://openalex.org/W2069255833","https://openalex.org/W2073083283","https://openalex.org/W2082099352","https://openalex.org/W2083392624","https://openalex.org/W2114538202","https://openalex.org/W2157650361","https://openalex.org/W2161029651"],"related_works":["https://openalex.org/W2391321755","https://openalex.org/W238609530","https://openalex.org/W2896134808","https://openalex.org/W2094708479","https://openalex.org/W3127082728","https://openalex.org/W4301494121","https://openalex.org/W2951569031","https://openalex.org/W2067936666","https://openalex.org/W2019137296","https://openalex.org/W2567853751"],"abstract_inverted_index":{"A":[0],"lower":[1,43,58,88,113],"bound":[2,28,44,59,89,114],"of":[3,16,60,90,115,135,200,205,219],"$\\Omega(\\sqrt{\\log":[4],"k":[5],"/":[6],"\\log":[7,8,62,118],"k})$":[9,119],"is":[10,120,150,176],"proved":[11],"for":[12,19,30,45,64,131,187],"the":[13,20,46,55,86,94,137,140,146,172,184,201,206,216],"competitive":[14,185,217],"ratio":[15,186,218],"randomized":[17],"algorithms":[18],"k-server":[21,138],"problem":[22,50,96],"against":[23],"an":[24],"oblivious":[25],"adversary.":[26],"The":[27,122],"holds":[29],"arbitrary":[31,65],"metric":[32,66,155],"spaces":[33,67,164],"(having":[34],"at":[35],"least":[36],"k+1":[37,98],"points)":[38],"and":[39,72,82,139,167],"provides":[40],"a":[41,103,108,112,127,132,154,211,220],"new":[42],"metrical":[47,141],"task":[48,142],"system":[49,143],"as":[51],"well.":[52],"This":[53,209],"improves":[54],"previous":[56],"best":[57],"$\\Omega(\\log":[61,91],"k)$":[63],"[H.J.":[68],"Karloff,":[69],"Y.":[70,73],"Rabani,":[71],"Ravid,":[74],"SIAM":[75],"J.":[76],"Comput.,":[77],"23":[78],"(1994),":[79],"pp.":[80],"293--312]":[81],"more":[83],"closely":[84],"approaches":[85],"conjectured":[87],"k)$.":[92],"For":[93],"server":[95],"on":[97,102,190,203],"equally":[99],"spaced":[100],"points":[101],"line,":[104],"which":[105],"corresponds":[106],"to":[107,180,214],"natural":[109],"motion-planning":[110],"problem,":[111],"$\\Omega(\\frac{\\log":[116],"k}{\\log":[117],"obtained.":[121],"results":[123],"are":[124],"deduced":[125],"from":[126],"general":[128],"decomposition":[129],"theorem":[130],"simpler":[133],"version":[134],"both":[136],"problems,":[144],"called":[145],"\"pursuit-evasion":[147],"game.\"":[148],"It":[149],"shown":[151],"that":[152,171],"if":[153],"space":[156],"$\\cal":[157,165,168,191],"M$":[158,192],"can":[159,193],"be":[160,194],"decomposed":[161],"into":[162],"two":[163,207],"M_L$":[166],"M_R$":[169],"such":[170],"distance":[173],"between":[174],"them":[175],"sufficiently":[177],"large":[178],"compared":[179],"their":[181],"diameter,":[182],"then":[183],"this":[188],"game":[189],"expressed":[195],"nearly":[196],"exactly":[197],"in":[198],"terms":[199],"ratios":[202],"each":[204],"subspaces.":[208],"yields":[210],"divide-and-conquer":[212],"approach":[213],"bounding":[215],"space.":[221]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}