{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:28:27Z","timestamp":1742966907832,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_13","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T11:46:58Z","timestamp":1740052018000},"page":"152-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Approach to\u00a0Tight I\/O Lower Bounds for\u00a0Algorithms with\u00a0Composite Procedures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1444-6778","authenticated-orcid":false,"given":"Rui","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ligang","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huajian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4712-1320","authenticated-orcid":false,"given":"Xiaowei","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaimin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2395116.2395121","volume":"59","author":"G Ballard","year":"2013","unstructured":"Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Graph expansion and communication costs of fast matrix multiplication. J. ACM (JACM) 59(6), 1\u201323 (2013)","journal-title":"J. ACM (JACM)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Elango, V., Rastello, F., Pouchet, L.N., Ramanujam, J., Sadayappan, P.: On characterizing the data movement complexity of computational dags for parallel execution. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 296\u2013306 (2014)","DOI":"10.1145\/2612669.2612694"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Communication-optimal parallel algorithm for Strassen\u2019s matrix multiplication. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 193\u2013204 (2012)","DOI":"10.1145\/2312005.2312044"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-031-21395-3_5","volume-title":"Network and Parallel Computing","author":"J Yan","year":"2022","unstructured":"Yan, J., Chen, X., Liu, J.: CSR &RV: an efficient value compression format for sparse matrix-vector multiplication. In: Liu, S., Wei, X. (eds.) Network and Parallel Computing, pp. 54\u201360. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21395-3_5"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jpdc.2022.03.006","volume":"164","author":"X Chen","year":"2022","unstructured":"Chen, X., Gong, C., Liu, J., Pang, Y., Deng, L., Chi, L., Li, K.: A novel neural network approach for airfoil mesh quality evaluation. J. Parallel Distrib. Comput. 164, 123\u2013132 (2022)","journal-title":"J. Parallel Distrib. Comput."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Jia-Wei, H., Kung, H.T.: I\/o complexity: the red-blue pebble game. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC \u201981, pp. 326\u2014-333. Association for Computing Machinery, New York (1981). https:\/\/doi.org\/10.1145\/800076.802486","DOI":"10.1145\/800076.802486"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Olivry, A., Langou, J., Pouchet, L.N., Sadayappan, P., Rastello, F.: Automated derivation of parametric data movement lower bounds for affine programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2020, pp. 808\u2014-822. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3385412.3385989","DOI":"10.1145\/3385412.3385989"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Zhang, X., Xiao, J., Tan, G.: I\/o lower bounds for auto-tuning of convolutions in cnns. In: Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2021, pp. 247\u2014-261. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3437801.3441609","DOI":"10.1145\/3437801.3441609"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Kwasniewski, G., et al.: Pebbles, graphs, and a pinch of combinatorics: towards tight i\/o lower bounds for statically analyzable programs. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2021, pp. 328\u2013339. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3409964.3461796","DOI":"10.1145\/3409964.3461796"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Jain, S., Zaharia, M.: Spectral lower bounds on the i\/o complexity of computation graphs. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 329\u2013338 (2020)","DOI":"10.1145\/3350755.3400210"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Liu, Q.C.: Red-blue pebble game: complexity of computing the trade-off between cache size and memory transfers. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pp. 195\u2013204 (2018)","DOI":"10.1145\/3210377.3210387"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0910005","volume":"10","author":"R Schreiber","year":"1989","unstructured":"Schreiber, R., Van Loan, C.: A storage-efficient $wy$ representation for products of householder transformations. SIAM J. Sci. Stat. Comput. 10(1), 53\u201357 (1989). https:\/\/doi.org\/10.1137\/0910005","journal-title":"SIAM J. Sci. Stat. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T11:47:02Z","timestamp":1740052022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}