{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:21:22Z","timestamp":1777965682882,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"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":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090246","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"113-127","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Paging for multi-core shared caches"],"prefix":"10.1145","author":[{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Ontario, Canada"}]},{"given":"Alejandro","family":"Salinger","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-002-1057-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"D.\n       \n      Ajwani N.\n       \n      Sitchinava and \n      \n      \n      N.\n       \n      Zeh\n      \n  \n  . \n  Geometric algorithms for private-cache chip multiprocessors. In M. de Berg and U. Meyer editors Proceedings of the 18th Annual European Symposium (ESA\n   \n  2010\n  ) volume \n  6347\n   of \n  LNCS pages \n  75\n  --\n  86\n  . \n  Springer 2010.   D. Ajwani N. Sitchinava and N. Zeh. Geometric algorithms for private-cache chip multiprocessors. In M. de Berg and U. Meyer editors Proceedings of the 18th Annual European Symposium (ESA 2010) volume 6347 of LNCS pages 75--86. Springer 2010.","DOI":"10.1007\/978-3-642-15781-3_7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647910.740334"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378573"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470440"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797324278"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 2008 ACM-SIAM Symposium on Discrete Algorithms","author":"Blelloch G. E.","year":"2008"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007948"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/237502.237574"},{"key":"e_1_3_2_1_12_1","volume-title":"Cambridge University Press","author":"Borodin A.","year":"1998"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1021"},{"key":"e_1_3_2_1_14_1","first-page":"11","volume-title":"Proceedings of the USENIX","volume":"1","author":"Cao P.","year":"1994"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1274971.1275005"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378574"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470354"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"M.\n       \n      Cieliebak S.\n       \n      Eidenbenz and \n      \n      \n      G.\n       \n      Woeginger\n      \n  \n  . \n  Double digest revisited: Complexity and approximability in the presence of noisy data. In T. Warnow and B. Zhu editors Computing and Combinatorics volume \n  2697\n   of \n  Lecture Notes in Computer Science pages \n  519\n  --\n  527\n  . \n  Springer Berlin\/Heidelberg 2003\n  . 10.1007\/3-540-45071-8_52.   M. Cieliebak S. Eidenbenz and G. Woeginger. Double digest revisited: Complexity and approximability in the presence of noisy data. In T. Warnow and B. Zhu editors Computing and Combinatorics volume 2697 of Lecture Notes in Computer Science pages 519--527. Springer Berlin\/Heidelberg 2003. 10.1007\/3-540-45071-8_52.","DOI":"10.1007\/3-540-45071-8_52"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378568"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0073-z"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225280"},{"key":"e_1_3_2_1_23_1","volume-title":"Freeman","author":"Garey M. R.","year":"1979"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392236.2392320"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of 1st Symposium on Innovations in Computer Science","author":"Hassidim A.","year":"2010"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454145"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762111"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989513"},{"key":"e_1_3_2_1_29_1","first-page":"185","volume-title":"ICSAMOS","author":"Molnos A. M.","year":"2006"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/647910.740474"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250709"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00144-5"},{"issue":"2","key":"e_1_3_2_1_33_1","first-page":"148","article-title":"Randomized online multi-threaded paging","volume":"6","author":"Seiden S. S.","year":"1999","journal-title":"Nord. J. Comput."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669177"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.165388"},{"issue":"1","key":"e_1_3_2_1_37_1","first-page":"21","article-title":"New results on fair multi-threaded paging","volume":"1","author":"Strejilevich de Loma A.","year":"1998","journal-title":"Electronic Journal of SADIO"},{"key":"e_1_3_2_1_38_1","first-page":"116","volume-title":"Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems","author":"Suh G. E.","year":"2001"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009192"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555778"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts","acronym":"ITCS '12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090246","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":40,"alternative-id":["10.1145\/2090236.2090246","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090246","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}