{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:57:46Z","timestamp":1775282266514,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374412","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"235-244","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Randomized competitive algorithms for generalized caching"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"IBM T. J. Watson Research, Yorktown Heights, USA"}]},{"given":"Niv","family":"Buchbinder","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00116-9"},{"key":"e_1_3_2_1_2_1","first-page":"31","volume-title":"Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Albers S.","year":"1999","unstructured":"S. Albers , S. Arora , and S. Khanna . Page replacement for general caching problems . In Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 31 -- 40 , 1999 . S. Albers, S. Arora, and S. Khanna. Page replacement for general caching problems. In Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 31--40, 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/050625382"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/290169"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_61"},{"key":"e_1_3_2_1_8_1","first-page":"193","volume-title":"USENIX Symposium on Internet Technologies and Systems","author":"Cao P.","year":"1997","unstructured":"P. Cao and S. Irani . Cost-aware www proxy caching algorithms . In USENIX Symposium on Internet Technologies and Systems , pages 193 -- 206 , 1997 . P. Cao and S. Irani. Cost-aware www proxy caching algorithms. In USENIX Symposium on Internet Technologies and Systems, pages 193--206, 1997."},{"key":"e_1_3_2_1_9_1","first-page":"106","volume-title":"Symposium on Discrete Algorithms","author":"Carr R.","year":"2000","unstructured":"R. Carr , L. Fleischer , V. Leung , and C. A. Phillips . Strengthening integrality gaps for capacitated network design and covering problems . In Symposium on Discrete Algorithms , pages 106 -- 115 , 2000 . R. Carr, L. Fleischer, V. Leung, and C. A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Symposium on Discrete Algorithms, pages 106--115, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404017"},{"key":"e_1_3_2_1_11_1","first-page":"879","volume-title":"Proceedings of the 10th Annual ACM-SIAM symposium on Discrete algorithms","author":"Cohen E.","year":"1999","unstructured":"E. Cohen and H. Kaplan . LP-based analysis of greedy-dual-size . In Proceedings of the 10th Annual ACM-SIAM symposium on Discrete algorithms , pages 879 -- 880 , 1999 . E. Cohen and H. Kaplan. LP-based analysis of greedy-dual-size. In Proceedings of the 10th Annual ACM-SIAM symposium on Discrete algorithms, pages 879--880, 1999."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Workshop on Online Algorithms","author":"Irani S.","unstructured":"S. Irani . Competitive analysis of paging: a survey . In Proceedings of the Workshop on Online Algorithms , Dagstuhl, Germany. Springer Verlag Lecture Notes in Computer Science. S. Irani. Competitive analysis of paging: a survey. In Proceedings of the Workshop on Online Algorithms, Dagstuhl, Germany. Springer Verlag Lecture Notes in Computer Science."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258666"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0095-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759073"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/127787.127832"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189992"},{"key":"e_1_3_2_1_20_1","first-page":"82","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Young N. E.","year":"1998","unstructured":"N. E. Young . On-line file caching . In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 82 -- 86 , 1998 . N. E. Young. On-line file caching. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 82--86, 1998."}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374412","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374412"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":20,"alternative-id":["10.1145\/1374376.1374412","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374412","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}