{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T10:30:22Z","timestamp":1786703422697,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032352477","type":"print"},{"value":"9783032352484","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:00:00Z","timestamp":1786752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:00:00Z","timestamp":1786752000000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-35248-4_1","type":"book-chapter","created":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T09:43:55Z","timestamp":1786700635000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Driven Global Data Layout Optimization for\u00a0Tensor Expressions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0999-1053","authenticated-orcid":false,"given":"Yi","family":"Miao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1249-2167","authenticated-orcid":false,"given":"Stephen","family":"Jarvis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Apra, E., Klemm, M., Kowalski, K.: Efficient implementation of many-body quantum chemical methods on the intel\u00ae xeon phi coprocessor. In: SC\u201914: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 674\u2013684. IEEE (2014)","DOI":"10.1109\/SC.2014.60"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/567806.567807","volume":"28","author":"LS Blackford","year":"2002","unstructured":"Blackford, L.S., et al.: An updated set of basic linear algebra subprograms (BLAS). ACM Trans. Math. Softw. 28(2), 135\u2013151 (2002)","journal-title":"ACM Trans. Math. Softw."},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Breuer, A., et al.: Einsum trees: an abstraction for optimizing the execution of tensor expressions. In: Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, vol. 2, pp. 275\u2013292. ASPLOS \u201925, Association for Computing Machinery, New York, NY, USA (2025). https:\/\/doi.org\/10.1145\/3676641.3716254","DOI":"10.1145\/3676641.3716254"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Breuer, A., et al.: Einsum trees: an abstraction for optimizing the execution of tensor expressions. In: Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, vol. 2, pp. 275\u2013292 (2025)","DOI":"10.1145\/3676641.3716254"},{"issue":"26","key":"1_CR5","doi-asserted-by":"publisher","first-page":"753","DOI":"10.21105\/joss.00753","volume":"3","author":"G Daniel","year":"2018","unstructured":"Daniel, G., Gray, J., et al.: Opt$$\\backslash $$_einsum-a python package for optimizing contraction order for einsum-like expressions. J. Open Source Softw. 3(26), 753 (2018)","journal-title":"J. Open Source Softw."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"De Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 337\u2013340. Springer (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"1_CR7","first-page":"454","volume":"235","author":"E Di Napoli","year":"2014","unstructured":"Di Napoli, E., Fabregat-Traver, D., Quintana-Ort\u00ed, G., Bientinesi, P.: Towards an efficient use of the blas library for multilinear tensor contractions. Appl. Math. Comput. 235, 454\u2013468 (2014)","journal-title":"Appl. Math. Comput."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Epifanovsky, E., et al.: New implementation of high-level correlated methods using a general block tensor library for high-performance electronic structure calculations (2013)","DOI":"10.1002\/jcc.23377"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"410","DOI":"10.22331\/q-2021-03-15-410","volume":"5","author":"J Gray","year":"2021","unstructured":"Gray, J., Kourtis, S.: Hyper-optimized tensor network contraction. Quantum 5, 410 (2021)","journal-title":"Quantum"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Heinecke, A., Henry, G., Hutchinson, M., Pabst, H.: LIBXSMM: accelerating small matrix multiplications by runtime code generation. In: SC \u201916: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 981\u2013991 (2016). https:\/\/doi.org\/10.1109\/SC.2016.83","DOI":"10.1109\/SC.2016.83"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Jumper, J., et al.: Highly accurate protein structure prediction with alphafold. Nature 596(7873), 583\u2013589 (2021)","DOI":"10.1038\/s41586-021-03819-2"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Liu, Y., Yao, Q., Li, Y.: Generalizing tensor decomposition for n-ARY relational knowledge bases. In: Proceedings of the Web Conference 2020, pp. 1104\u20131114 (2020)","DOI":"10.1145\/3366423.3380188"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1137\/050644756","volume":"38","author":"IL Markov","year":"2008","unstructured":"Markov, I.L., Shi, Y.: Simulating quantum computation by contracting tensor networks. SIAM J. Comput. 38(3), 963\u2013981 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"C1","DOI":"10.1137\/16M108968X","volume":"40","author":"DA Matthews","year":"2018","unstructured":"Matthews, D.A.: High-performance tensor contraction without transposition. SIAM J. Sci. Comput. 40(1), C1\u2013C24 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Miao, Y., Jarvis, S.: Artifact of the paper:constraint driven global data layout optimization for tensor expressions (2026). https:\/\/doi.org\/10.5281\/zenodo.20515887","DOI":"10.5281\/zenodo.20515887"},{"key":"1_CR17","unstructured":"Nayar, S.: Columbia object image library (coil100) (1996). http:\/\/www1cs.columbia.edu\/CAVE\/software\/softlib\/coil-100.php"},{"key":"1_CR18","unstructured":"Novikov, A., Podoprikhin, D., Osokin, A., Vetrov, D.P.: Tensorizing neural networks. In: Advances in Neural Information Processing Systems, p. 28 (2015)"},{"key":"1_CR19","unstructured":"NVIDIA Corporation: cuquantum sdk: a high-performance library for accelerating quantum science (2025). https:\/\/docs.nvidia.com\/cuda\/cuquantum\/24.11.0\/. Accessed 20 May 2025"},{"issue":"9","key":"1_CR20","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1038\/s42254-019-0086-7","volume":"1","author":"R Or\u00fas","year":"2019","unstructured":"Or\u00fas, R.: Tensor networks for complex quantum systems. Nat. Rev. Phys. 1(9), 538\u2013550 (2019)","journal-title":"Nat. Rev. Phys."},{"key":"1_CR21","unstructured":"Peharz, R., et al.: Einsum networks: fast and scalable learning of tractable probabilistic circuits. In: International Conference on Machine Learning, pp. 7563\u20137574. PMLR (2020)"},{"key":"1_CR22","unstructured":"PyTorch Developers: ATen, PyTorch\u2019s tensor library (2025). https:\/\/github.com\/pytorch\/pytorch\/tree\/main\/aten\/src\/ATen. Accessed 31 Mar 2025"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Springer, P., Bientinesi, P.: Design of a high-performance gemm-like tensor-tensor multiplication. ACM Trans. Math. Softw. 44(3) (2018). https:\/\/doi.org\/10.1145\/3157733","DOI":"10.1145\/3157733"},{"key":"1_CR24","unstructured":"Stoudenmire, E., Schwab, D.J.: Supervised learning with tensor networks. Adv. Neural. Inf. Process. Syst. 29 (2016)"},{"key":"1_CR25","unstructured":"Usvyatsov, M., Ballester-Ripoll, R., Schindler, K.: tntorch: tensor network learning with pytorch (2022). https:\/\/arxiv.org\/abs\/2206.11128"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Wang, W., Sun, Y., Eriksson, B., Wang, W., Aggarwal, V.: Wide compression: tensor ring nets. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 9329\u20139338 (2018)","DOI":"10.1109\/CVPR.2018.00972"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"27008","DOI":"10.52202\/068431-1958","volume":"35","author":"ZC Wu","year":"2022","unstructured":"Wu, Z.C., Huang, T.Z., Deng, L.J., Dou, H.X., Meng, D.: Tensor wheel decomposition and its tensor completion application. Adv. Neural. Inf. Process. Syst. 35, 27008\u201327020 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Zheng, Y.B., Huang, T.Z., Zhao, X.L., Zhao, Q., Jiang, T.X.: Fully-connected tensor network decomposition and its application to higher-order tensor completion. In: Proceedings of the AAAI Conference On Artificial Intelligence. vol.\u00a035, pp. 11071\u201311078 (2021)","DOI":"10.1609\/aaai.v35i12.17321"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2026: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35248-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T09:44:02Z","timestamp":1786700642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35248-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,15]]},"ISBN":["9783032352477","9783032352484"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35248-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,15]]},"assertion":[{"value":"15 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2026.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}