{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:03Z","timestamp":1750308663891,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T00:00:00Z","timestamp":1292457600000},"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":["SIGACT News"],"published-print":{"date-parts":[[2010,12,16]]},"DOI":"10.1145\/1907450.1907547","type":"journal-article","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T15:55:04Z","timestamp":1292860504000},"page":"114-121","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["SIGACT news online algorithms column 17"],"prefix":"10.1145","volume":"41","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[{"name":"University of California, Riverside"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,12,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735223.1735245"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.50"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_12"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1021"},{"key":"e_1_2_1_6_1","first-page":"193","volume-title":"Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems","author":"Cao Pei","year":"1997","unstructured":"Pei Cao and Sandy Irani . Cost-aware www proxy caching algorithms . In Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems , pages 193 -- 206 , 1997 . Pei Cao and Sandy Irani. Cost-aware www proxy caching algorithms. In Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems, pages 193--206, 1997."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/782814.782829"},{"key":"e_1_2_1_8_1","first-page":"136","volume-title":"Proc. 15th European Symp. on Algorithms (ESA)","author":"Chrobak Marek","year":"2007","unstructured":"Marek Chrobak , Philippe Baptiste , and Christoph Drr . Polynomial time algorithms for minimum energy scheduling . In Proc. 15th European Symp. on Algorithms (ESA) , pages 136 -- 150 , 2007 . Marek Chrobak, Philippe Baptiste, and Christoph Drr. Polynomial time algorithms for minimum energy scheduling. In Proc. 15th European Symp. on Algorithms (ESA), pages 136--150, 2007."},{"key":"e_1_2_1_9_1","first-page":"87","volume-title":"Proc. 9th Symp. on Discrete Algorithms (SODA)","author":"Chrobak Marek","year":"1998","unstructured":"Marek Chrobak and John Noga . Competitive algorithms for multilevel caching and relaxed list update . In Proc. 9th Symp. on Discrete Algorithms (SODA) , pages 87 -- 96 . ACM\/SIAM, 1998 . Marek Chrobak and John Noga. Competitive algorithms for multilevel caching and relaxed list update. In Proc. 9th Symp. on Discrete Algorithms (SODA), pages 87--96. ACM\/SIAM, 1998."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/762761.762819"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250699"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086649.1086670"},{"key":"e_1_2_1_13_1","volume-title":"Proc. USENIX","author":"Douglis Fred","year":"1994","unstructured":"Fred Douglis , P. Krishnan , and Brian Marsh . Thwarting the power-hungry disk . In Proc. USENIX Winter 1994 Technical Conference (WTEC'94), pages 23--23 , 1994. Fred Douglis, P. Krishnan, and Brian Marsh. Thwarting the power-hungry disk. In Proc. USENIX Winter 1994 Technical Conference (WTEC'94), pages 23--23, 1994."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753171.1753195"},{"issue":"1","key":"e_1_2_1_15_1","first-page":"8","article-title":"Inter-program optimisations for disk energy reduction","volume":"3","author":"Hom Jerry","year":"2007","unstructured":"Jerry Hom and Ulrich Kremer . Inter-program optimisations for disk energy reduction . International Journal of Engineering Science , 3 ( 1\/2 ): 8 -- 16 , 2007 . Jerry Hom and Ulrich Kremer. Inter-program optimisations for disk energy reduction. International Journal of Engineering Science, 3(1\/2):8--16, 2007.","journal-title":"International Journal of Engineering Science"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1067309.1067324"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/860176.860180"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796299540"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1006209.1006220"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140103.1140281"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/GREENCOMP.2010.5598307"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217959"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189992"},{"key":"e_1_2_1_24_1","first-page":"82","volume-title":"Proc. 9th Symp. on Discrete Algorithms (SODA)","author":"Young Neal E.","year":"1998","unstructured":"Neal E. Young . On-line file caching . In Proc. 9th Symp. on Discrete Algorithms (SODA) , pages 82 -- 86 . ACM\/SIAM, 1998 . Neal E. Young. On-line file caching. In Proc. 9th Symp. on Discrete Algorithms (SODA), pages 82--86. ACM\/SIAM, 1998."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1907450.1907547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1907450.1907547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:27Z","timestamp":1750276827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1907450.1907547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,16]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12,16]]}},"alternative-id":["10.1145\/1907450.1907547"],"URL":"https:\/\/doi.org\/10.1145\/1907450.1907547","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2010,12,16]]},"assertion":[{"value":"2010-12-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}