{"id":"https://openalex.org/W2060427246","doi":"https://doi.org/10.1145/1374376.1374412","title":"Randomized competitive algorithms for generalized caching","display_name":"Randomized competitive algorithms for generalized caching","publication_year":2008,"publication_date":"2008-05-17","ids":{"openalex":"https://openalex.org/W2060427246","doi":"https://doi.org/10.1145/1374376.1374412","mag":"2060427246"},"language":"en","primary_location":{"id":"doi:10.1145/1374376.1374412","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374412","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["IBM T. J. Watson Research, Yorktown Heights, USA"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research, Yorktown Heights, USA","institution_ids":["https://openalex.org/I4210114115"]}]},{"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/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":"Niv Buchbinder","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"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, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":5.3363,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.95731022,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"244"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.973800003528595,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.9030342102050781},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7238284945487976},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7110328674316406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7081526517868042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6954687237739563},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6877237558364868},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6075398921966553},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5283689498901367},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4674694538116455},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.28569746017456055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22593840956687927},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.16790908575057983},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.13697469234466553},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13692015409469604}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9030342102050781},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7238284945487976},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7110328674316406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7081526517868042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6954687237739563},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6877237558364868},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6075398921966553},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5283689498901367},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4674694538116455},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.28569746017456055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22593840956687927},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.16790908575057983},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13697469234466553},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13692015409469604},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/1374376.1374412","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374412","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/8398c62b-654c-4166-9dbb-7aff14281b28","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/8398c62b-654c-4166-9dbb-7aff14281b28","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 & Naor, J 2008, Randomized competitive algorithms for generalized caching. in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08, Victoria BC, Canada, May 17-20, 2008). Association for Computing Machinery, Inc., New York, pp. 235-244.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:733342","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=733342","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.848","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.848","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/um/people/nivbuchb/papers/web-caching/web-caching.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:694847","is_oa":false,"landing_page_url":"http://repository.tue.nl/694847","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:733342","is_oa":false,"landing_page_url":"http://repository.tue.nl/733342","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:pure.tue.nl:publications/8398c62b-654c-4166-9dbb-7aff14281b28","is_oa":false,"landing_page_url":"http://doi.acm.org/10.1145/1374376.1374412","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bansal, N, Buchbinder, N & Naor, J 2008, Randomized competitive algorithms for generalized caching. in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08, Victoria BC, Canada, May 17-20, 2008). Association for Computing Machinery, Inc., New York, pp. 235-244.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/8398c62b-654c-4166-9dbb-7aff14281b28","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/8398c62b-654c-4166-9dbb-7aff14281b28","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":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08, Victoria BC, Canada, May 17-20, 2008), 235 - 244","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1574334008","https://openalex.org/W1860570137","https://openalex.org/W1918432491","https://openalex.org/W1984628625","https://openalex.org/W1998843748","https://openalex.org/W2003902046","https://openalex.org/W2025180076","https://openalex.org/W2041645394","https://openalex.org/W2042789015","https://openalex.org/W2043344147","https://openalex.org/W2044156187","https://openalex.org/W2051233655","https://openalex.org/W2052476895","https://openalex.org/W2054033098","https://openalex.org/W2083392624","https://openalex.org/W2089998595","https://openalex.org/W2106410102","https://openalex.org/W3023912806","https://openalex.org/W3125910951","https://openalex.org/W6635323731","https://openalex.org/W6640272449","https://openalex.org/W6656439708","https://openalex.org/W6670862824"],"related_works":["https://openalex.org/W2214256523","https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W3089449646","https://openalex.org/W2781235162","https://openalex.org/W2058681277","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2951573806","https://openalex.org/W2088826026"],"abstract_inverted_index":{"We":[0,47,70,151],"consider":[1],"online":[2,50,141,189,197],"algorithms":[3,76,130,142,207],"for":[4,61,77,124,140,159,205],"the":[5,32,37,42,45,58,62,78,82,89,92,98,101,105,137,160,190],"generalized":[6],"caching":[7,206],"problem.":[8,161],"Here":[9],"we":[10,187],"are":[11,111,131,178,209],"given":[12],"a":[13,27,167,183,195,202],"cache":[14],"of":[15,30,40,81,100,126,136,182],"size":[16,99],"k":[17],"and":[18,23,85,103,148,193,208],"pages":[19,43],"with":[20,52,64,171],"arbitrary":[21],"sizes":[22],"fetching":[24,41,93,109],"costs.":[25],"Given":[26],"request":[28],"sequence":[29],"pages,":[31],"goal":[33],"is":[34,57,95,163],"to":[35,97,119],"minimize":[36],"total":[38],"cost":[39,94],"into":[44],"cache.":[46],"give":[48,72],"an":[49,114,134,154],"algorithm":[51,60,117,158],"competitive":[53,65],"ratio":[54,66],"O(log2k),":[55],"which":[56,143],"first":[59,152],"problem":[63],"sublinear":[67],"in":[68,104],"k.":[69],"also":[71],"improved":[73],"O(log":[74,155],"k)-competitive":[75,116,156],"special":[79],"cases":[80],"Bit":[83,90],"Model":[84],"Fault":[86,106],"model.":[87],"In":[88],"Model,":[91],"proportional":[96],"page":[102],"model":[107],"all":[108],"costs":[110],"uniform.":[112],"Previously,":[113],"O(log2":[115],"due":[118],"Irani":[120],"[14]":[121],"was":[122,144],"known":[123],"both":[125],"these":[127],"models.":[128],"Our":[129,199],"based":[132],"on":[133],"extension":[135],"primal-dual":[138],"framework":[139,204],"developed":[145],"by":[146,165],"Buchbinder":[147],"Naor":[149],"[7].":[150],"generate":[153],"fractional":[157,191],"This":[162],"done":[164],"using":[166],"strengthened":[168],"LP":[169],"formulation":[170],"knapsack-cover":[172],"constraints,":[173],"where":[174],"exponentially":[175],"many":[176],"constraints":[177],"added":[179],"upon":[180],"arrival":[181],"new":[184],"request.":[185],"Second,":[186],"round":[188],"solution":[192],"obtain":[194],"randomized":[196],"algorithm.":[198],"techniques":[200],"provide":[201],"unified":[203],"substantially":[210],"simpler":[211],"than":[212],"those":[213],"previously":[214],"used.":[215]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}