{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:04:47Z","timestamp":1769828687381,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T00:00:00Z","timestamp":1499731200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER-1453472,CCF-1423230"],"award-info":[{"award-number":["CAREER-1453472,CCF-1423230"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0012489"],"award-info":[{"award-number":["DE-SC0012489"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935807","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T11:03:00Z","timestamp":1467975780000},"page":"161-163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Timothy","family":"Carpenter","sequence":"first","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, LIG, Grenoble, France"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}]},{"given":"Anastasios","family":"Sidiropoulos","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060675"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_2"},{"key":"e_1_3_2_1_3_1","volume-title":"Graph partitioning and graph clustering - 10th DIMACS implementation challenge workshop","author":"Bader D. A.","unstructured":"D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner. Graph partitioning and graph clustering - 10th DIMACS implementation challenge workshop."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.36"},{"key":"e_1_3_2_1_5_1","volume-title":"OSU-CISRC-7\/13-TR16","author":"Elango V.","year":"2013","unstructured":"V. Elango, F. Rastello, L.-N. Pouchet, J. Ramanujam, and P. Sadayappan. Data access complexity: The red\/blue pebble game revisited. Technical report, OSU-CISRC-7\/13-TR16, Ohio State University, 2013."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060674"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_8_1","volume-title":"Metis--unstructured graph partitioning and sparse matrix ordering system, version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar. Metis--unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89595"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_12_1","unstructured":"J. Nordstr\u00f6m. New wine into old wineskins: A survey of some pebbling classics with supplemental results. Foundations and Trends in Theoretical Computer Science. http:\/\/people.csail.mit.edu\/jakobn 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0012787"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.12.005"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646714.701412"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77620"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pacific Grove California USA","acronym":"SPAA '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935807","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:44:03Z","timestamp":1763459043000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935807"}},"subtitle":["Approximating the I\/O Complexity of One-Shot Red-Blue Pebbling"],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":16,"alternative-id":["10.1145\/2935764.2935807","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935807","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}