{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:21:09Z","timestamp":1778595669903,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"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":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384277","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"1125-1138","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Caching with time windows"],"prefix":"10.1145","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[{"name":"IIT Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[{"name":"Duke University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The Linux Kernel-Deadline Task Scheduling. https:\/\/www.kernel.org\/doc\/html\/ latest\/scheduler\/sched-deadline.html.  The Linux Kernel-Deadline Task Scheduling. https:\/\/www.kernel.org\/doc\/html\/ latest\/scheduler\/sched-deadline.html."},{"key":"e_1_3_2_1_2_1","volume-title":"APPROX\/RANDOM 2017","author":"Ashlagi I.","year":"2017","unstructured":"I. Ashlagi , Y. Azar , M. Charikar , A. Chiplunkar , O. Geri , H. Kaplan , R. M. Makhijani , Y. Wang , and R. Wattenhofer . Min-cost bipartite perfect matching with delays. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , APPROX\/RANDOM 2017 , August 16-18, 2017 , Berkeley, CA, USA, pages 1 : 1-1 : 20 , 2017. I. Ashlagi, Y. Azar, M. Charikar, A. Chiplunkar, O. Geri, H. Kaplan, R. M. Makhijani, Y. Wang, and R. Wattenhofer. Min-cost bipartite perfect matching with delays. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pages 1 : 1-1 : 20, 2017."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039753"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055475"},{"key":"e_1_3_2_1_5_1","first-page":"07131","author":"Azar Y.","year":"1904","unstructured":"Y. Azar and N. Touitou . General framework for metric optimization problems with delay or with deadlines. CoRR, abs\/ 1904 . 07131 , 2019. Y. Azar and N. Touitou. General framework for metric optimization problems with delay or with deadlines. CoRR, abs\/ 1904.07131, 2019.","journal-title":"CoRR, abs\/"},{"key":"e_1_3_2_1_6_1","first-page":"19","volume":"59","author":"Bansal N.","year":"2012","unstructured":"N. Bansal , N. Buchbinder , and J. Naor . A primal-dual randomized algorithm for weighted paging. J. ACM , 59 ( 4 ): 19 : 1-19 : 24, 2012 . N. Bansal, N. Buchbinder, and J. Naor. A primal-dual randomized algorithm for weighted paging. J. ACM, 59 ( 4 ): 19 : 1-19 : 24, 2012.","journal-title":"A primal-dual randomized algorithm for weighted paging. J. ACM"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_3_2_1_8_1","volume-title":"A study of replacement algorithms for virtual-storage computer. IBM Systems Journal, 5 ( 2 ): 78-101","author":"Belady L. A.","year":"1966","unstructured":"L. A. Belady . A study of replacement algorithms for virtual-storage computer. IBM Systems Journal, 5 ( 2 ): 78-101 , 1966 . L. A. Belady. A study of replacement algorithms for virtual-storage computer. IBM Systems Journal, 5 ( 2 ): 78-101, 1966."},{"key":"e_1_3_2_1_9_1","volume-title":"24th Annual European Symposium on Algorithms, ESA 2016","author":"Bienkowski M.","year":"2016","unstructured":"M. Bienkowski , M. B\u00f6hm , J. Byrka , M. Chrobak , C. D\u00fcrr , L. Folwarczn\u00fd , L. Jez , J. Sgall , N. K. Thang , and P. Vesel\u00fd . Online algorithms for multi-level aggregation . In 24th Annual European Symposium on Algorithms, ESA 2016 , August 22-24, 2016 , Aarhus, Denmark, pages 12 : 1-12 : 17 , 2016. M. Bienkowski, M. B\u00f6hm, J. Byrka, M. Chrobak, C. D\u00fcrr, L. Folwarczn\u00fd, L. Jez, J. Sgall, N. K. Thang, and P. Vesel\u00fd. Online algorithms for multi-level aggregation. In 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pages 12 : 1-12 : 17, 2016."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.80"},{"key":"e_1_3_2_1_11_1","volume-title":"Online make-to-order joint replenishment model: Primal-dual competitive algorithms. Operations Research, 61 ( 4 ):  1014-1029","author":"Buchbinder N.","year":"2013","unstructured":"N. Buchbinder , T. Kimbrel , R. Levi , K. Makarychev , and M. Sviridenko . Online make-to-order joint replenishment model: Primal-dual competitive algorithms. Operations Research, 61 ( 4 ): 1014-1029 , 2013 . N. Buchbinder, T. Kimbrel, R. Levi, K. Makarychev, and M. Sviridenko. Online make-to-order joint replenishment model: Primal-dual competitive algorithms. Operations Research, 61 ( 4 ): 1014-1029, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CNSM.2015.7367376"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/314500.315064"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2012.6211912"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897557"},{"key":"e_1_3_2_1_17_1","first-page":"685","volume":"12","author":"Fiat A.","year":"1991","unstructured":"A. Fiat , R. M. Karp , M. Luby , L. A. McGeoch , D. D. Sleator , and N. E. Young . Competitive paging algorithms. J. Algorithms , 12 ( 4 ): 685 - 699 , 1991 . A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young. Competitive paging algorithms. J. Algorithms, 12 ( 4 ): 685-699, 1991.","journal-title":"Competitive paging algorithms. J. Algorithms"},{"key":"e_1_3_2_1_18_1","volume-title":"Dynamic TCP acknowledgment and other stories about e\/(e-1). Algorithmica, 36 ( 3 ):  209-224","author":"Karlin A. R.","year":"2003","unstructured":"A. R. Karlin , C. Kenyon , and D. Randall . Dynamic TCP acknowledgment and other stories about e\/(e-1). Algorithmica, 36 ( 3 ): 209-224 , 2003 . A. R. Karlin, C. Kenyon, and D. Randall. Dynamic TCP acknowledgment and other stories about e\/(e-1). Algorithmica, 36 ( 3 ): 209-224, 2003."},{"key":"e_1_3_2_1_19_1","volume-title":"Amortized eficiency of list update and paging rules. Commun. ACM, 28 ( 2 ):  202-208","author":"Sleator D. D.","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan . Amortized eficiency of list update and paging rules. Commun. ACM, 28 ( 2 ): 202-208 , 1985 . D. D. Sleator and R. E. Tarjan. Amortized eficiency of list update and paging rules. Commun. ACM, 28 ( 2 ): 202-208, 1985."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/127787.127832"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384277","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":20,"alternative-id":["10.1145\/3357713.3384277","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384277","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}