{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:00Z","timestamp":1783576920683,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"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":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210404","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"205-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Online Generalized Caching with Varying Weights and Costs"],"prefix":"10.1145","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[{"name":"Ben Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[{"name":"Bar Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Anna Adamaszek Artur Czumaj Matthias Englert and Harald R\"acke . 2012. An O(log k)-competitive algorithm for generalized caching 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. 1681--1689.   Anna Adamaszek Artur Czumaj Matthias Englert and Harald R\"acke . 2012. An O(log k)-competitive algorithm for generalized caching 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. 1681--1689.","DOI":"10.1137\/1.9781611973099.133"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/090779000"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374412"},{"key":"e_1_3_2_1_4_1","unstructured":"Allan Borodin and Ran El-Yaniv . 2005. Online computation and competitive analysis. cambridge university press.  Allan Borodin and Ran El-Yaniv . 2005. Online computation and competitive analysis. cambridge university press."},{"key":"e_1_3_2_1_5_1","volume-title":"Cost-Aware WWW Proxy Caching Algorithms. In 1st USENIX Symposium on Internet Technologies and Systems. 193--206","author":"Cao Pei","year":"1997"},{"key":"e_1_3_2_1_6_1","unstructured":"Fred Douglis . 1993. The Compression Cache: Using On-line Compression to Extend Physical Memory. USENIX Winter. Citeseer 519--529.  Fred Douglis . 1993. The Compression Cache: Using On-line Compression to Extend Physical Memory. USENIX Winter. Citeseer 519--529."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755585"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2494232.2479781"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0124-5"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Vienna Austria","acronym":"SPAA '18","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"]},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:20Z","timestamp":1750210760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":9,"alternative-id":["10.1145\/3210377.3210404","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210404","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}