{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:23Z","timestamp":1772164043108,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429077","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Cache and I\/O efficent functional algorithms"],"prefix":"10.1145","author":[{"given":"Guy E.","family":"Blelloch","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Harper","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0088-5"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90175-X"},{"key":"e_1_3_2_2_4_1","series-title":"Dagstuhl Seminar Proceedings","volume-title":"Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004","author":"Arge L.","year":"2005","unstructured":"L. Arge , M. A. Bender , E. D. Demaine , C. E. Leiserson , and K. Mehlhorn , editors . Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004 , volume 04301 of Dagstuhl Seminar Proceedings , 2005 . IBFI, Schloss Dagstuhl , Germany . L. Arge, M. A. Bender, E. D. Demaine, C. E. Leiserson, and K. Mehlhorn, editors. Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004, volume 04301 of Dagstuhl Seminar Proceedings, 2005. IBFI, Schloss Dagstuhl, Germany."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224210"},{"key":"e_1_3_2_2_6_1","first-page":"139","volume-title":"External-memory graph algorithms","author":"Chiang Y.-J.","year":"1995","unstructured":"Y.-J. Chiang , M. T. Goodrich , E. F. Grove , R. Tamassia , D. E. Vengroff , and J. S. Vitter . External-memory graph algorithms . In K. L. Clarkson, editor, SODA, pages 139 -- 149 . ACM\/SIAM , 1995 . ISBN 0--89871--349--8. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In K. L. Clarkson, editor, SODA, pages 139--149. ACM\/SIAM, 1995. ISBN 0--89871--349--8."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/286860.286865"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48536"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366816"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316690"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155107"},{"key":"e_1_3_2_2_13_1","volume-title":"Practical Foundations for Programming Languages","author":"Harper R.","year":"2013","unstructured":"R. Harper . Practical Foundations for Programming Languages . Cambridge University Press , 2013 . (Draft available at http:\/\/www.cs.cmu.edu\/ rwh\/plbook\/book.pdf.). R. Harper. Practical Foundations for Programming Languages. Cambridge University Press, 2013. (Draft available at http:\/\/www.cs.cmu.edu\/ rwh\/plbook\/book.pdf.)."},{"key":"e_1_3_2_2_14_1","volume-title":"Garbage Collection: Algorithms for Automatic Dynamic Memory Management","author":"Jones R.","year":"1996","unstructured":"R. Jones and R. Lins . Garbage Collection: Algorithms for Automatic Dynamic Memory Management . Wiley , 1996 . R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, 1996."},{"key":"e_1_3_2_2_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45448-9","volume-title":"Advanced Lectures {Dagstuhl Research Seminar, March 10--14","author":"Meyer U.","year":"2002","unstructured":"U. Meyer , P. Sanders , and J. F. Sibeyn , editors . Algorithms for Memory Hierarchies , Advanced Lectures {Dagstuhl Research Seminar, March 10--14 , 2002 }, volume 2625 of Lecture Notes in Computer Science , 2003. Springer . ISBN 3--540-00883--7. U. Meyer, P. Sanders, and J. F. Sibeyn, editors. Algorithms for Memory Hierarchies, Advanced Lectures {Dagstuhl Research Seminar, March 10--14, 2002}, volume 2625 of Lecture Notes in Computer Science, 2003. Springer. ISBN 3--540-00883--7."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224182"},{"key":"e_1_3_2_2_17_1","first-page":"687","volume-title":"I\/o-complexity of graph algorithms","author":"Munagala K.","year":"1999","unstructured":"K. Munagala and A. G. Ranade . I\/o-complexity of graph algorithms . In R. E. Tarjan and T. Warnow, editors, SODA, pages 687 -- 694 . ACM\/SIAM , 1999 . ISBN 0--89871--434--6. K. Munagala and A. G. Ranade. I\/o-complexity of graph algorithms. In R. E. Tarjan and T. Warnow, editors, SODA, pages 687--694. ACM\/SIAM, 1999. ISBN 0--89871--434--6."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"e_1_3_2_2_19_1","first-page":"685","volume-title":"F. Li","author":"Rahn M.","year":"2010","unstructured":"M. Rahn , P. Sanders , and J. Singler . Scalable distributed-memory external sorting . In F. Li , M. M. Moro, S. Ghandeharizadeh, J. R. Haritsa, G. Weikum, M. J. Carey, F. Casati, E. Y. Chang, I. Manolescu, S. Mehrotra, U. Dayal, and V. J. Tsotras, editors, ICDE, pages 685 -- 688 . IEEE, 2010 . ISBN 978--1--4244--5444-0. M. Rahn, P. Sanders, and J. Singler. Scalable distributed-memory external sorting. In F. Li, M. M. Moro, S. Ghandeharizadeh, J. R. Haritsa, G. Weikum, M. J. Carey, F. Casati, E. Y. Chang, I. Manolescu, S. Mehrotra, U. Dayal, and V. J. Tsotras, editors, ICDE, pages 685--688. IEEE, 2010. ISBN 978--1--4244--5444-0."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411240"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000014"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/141471.141500"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429077","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":23,"alternative-id":["10.1145\/2429069.2429077","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429077","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429077","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}