{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:19:32Z","timestamp":1766067572732,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031087530"},{"type":"electronic","value":"9783031087547"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08754-7_2","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T07:06:09Z","timestamp":1655795169000},"page":"11-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Compiling Linear Algebra Expressions into\u00a0Efficient Code"],"prefix":"10.1007","author":[{"given":"Julien","family":"Klaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Blacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Giesen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul Gerhardt","family":"Rump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Wiedom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"2_CR1","unstructured":"Ascher, D., Dubois, P.F., Hinsen, K., Hugunin, J., Oliphant, T., et al.: Numerical Python (2001)"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3446632","volume":"47","author":"H Barthels","year":"2021","unstructured":"Barthels, H., Psarras, C., Bientinesi, P.: Linnea: automatic generation of efficient linear algebra programs. ACM Trans. Math. Softw. 47(3), 1\u201326 (2021)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/JPROC.2004.840311","volume":"93","author":"G Baumgartner","year":"2005","unstructured":"Baumgartner, G., et al.: Synthesis of high-performance parallel programs for a class of ab initio quantum chemistry models. Proc. IEEE 93(2), 276\u2013292 (2005)","journal-title":"Proc. IEEE"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bilmes, J.A., Asanovic, K., Chin, C., Demmel, J.: Author retrospective for optimizing matrix multiply using PHiPAC: a portable high-performance ANSI C coding methodology. In: ACM International Conference on Supercomputing 25th Anniversary Volume. ACM (2014)","DOI":"10.1145\/2591635.2591656"},{"key":"2_CR5","unstructured":"Buitinck, L., et al.: API design for machine learning software: experiences from the Scikit-learn project. In: ECML PKDD Workshop (2013)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cai, X., Langtangen, H.P., Moe, H.: On the performance of the python programming language for serial and parallel scientific computations. Sci. Program. 13(1) (2005)","DOI":"10.1155\/2005\/619804"},{"issue":"11","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1109\/JPROC.2018.2873289","volume":"106","author":"F Franchetti","year":"2018","unstructured":"Franchetti, F., et al.: SPIRAL: extreme performance portability. Proc. IEEE 106(11), 1935\u20131968 (2018)","journal-title":"Proc. IEEE"},{"key":"2_CR8","unstructured":"Guennebaud, G., Jacob, B., et al.: Eigen v3. http:\/\/eigen.tuxfamily.org (2010)"},{"issue":"7825","key":"2_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris, C.R., et al.: Array programming with NumPy. Nature 585(7825), 357\u2013362 (2020)","journal-title":"Nature"},{"key":"2_CR10","unstructured":"The Mathworks Inc, Natick, Massachusetts: MATLAB version R2021a (2021)"},{"issue":"1","key":"2_CR11","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":"2_CR12","doi-asserted-by":"crossref","unstructured":"Nuzman, D., et al.: Vapor SIMD: auto-vectorize once, run everywhere. In: Proceedings of the CGO 2011. IEEE Computer Society (2011)","DOI":"10.1109\/CGO.2011.5764683"},{"issue":"7","key":"2_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1090\/conm\/443\/08555","volume":"443","author":"AB Owen","year":"2007","unstructured":"Owen, A.B.: A robust hybrid of lasso and ridge regression. Contemp. Math. 443(7), 59\u201372 (2007)","journal-title":"Contemp. Math."},{"key":"2_CR14","unstructured":"Psarras, C., Barthels, H., Bientinesi, P.: The linear algebra mapping problem. arXiv preprint arXiv:1911.09421 (2019)"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"R Sethi","year":"1970","unstructured":"Sethi, R., Ullman, J.D.: The generation of optimal code for arithmetic expressions. J. ACM 17(4), 715\u2013728 (1970)","journal-title":"J. ACM"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Spampinato, D.G., Fabregat-Traver, D., Bientinesi, P., P\u00fcschel, M.: Program generation for small-scale linear algebra applications. In: Proceedings of the 2018 International Symposium on Code Generation and Optimization. ACM (2018)","DOI":"10.1145\/3168812"},{"key":"2_CR17","unstructured":"Vasilache, N., et al.: Tensor comprehensions: framework-agnostic high-performance machine learning abstractions. CoRR abs\/1802.04730 (2018)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08754-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T07:24:44Z","timestamp":1655796284000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08754-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087530","9783031087547"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08754-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"474","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"175","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}