{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:51:19Z","timestamp":1771951879425,"version":"3.50.1"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/cgo.2019.8661185","type":"proceedings-article","created":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T00:01:46Z","timestamp":1552003306000},"page":"180-192","source":"Crossref","is-referenced-by-count":41,"title":["Tensor Algebra Compilation with Workspaces"],"prefix":"10.1109","author":[{"given":"Fredrik","family":"Kjolstad","sequence":"first","affiliation":[{"name":"MIT, USA"}]},{"given":"Willow","family":"Ahrens","sequence":"additional","affiliation":[{"name":"MIT, USA"}]},{"given":"Shoaib","family":"Kamil","sequence":"additional","affiliation":[{"name":"Adobe Research, USA"}]},{"given":"Saman","family":"Amarasinghe","sequence":"additional","affiliation":[{"name":"Adobe Research, USA"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions","author":"vasilache","year":"2018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/800025.808380"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20119-1_4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115709"},{"key":"ref15","first-page":"61","article-title":"Set and Relation Manipulation for the Sparse Polyhedral Framework","author":"strout","year":"2012","journal-title":"Languages and Compilers for Parallel Computing Ser Lecture Notes in Computer Science"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.40"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.06.002"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3133898"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/00268970500275780"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/233561.233564"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185528"},{"key":"ref33","first-page":"52","article-title":"Taco: Compilation et génération de code dexpressions tensorielles","author":"lugato","year":"2018","journal-title":"AVANCÉES"},{"key":"ref10","year":"2014","journal-title":"Massachusetts The MathWorks Inc"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48319-5_14"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0002751"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/165939.166023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1033099"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19595-2_8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2010.04.232"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2857721"},{"key":"ref19","article-title":"Era of big data processing: A new approach via tensor networks and tensor decompositions","author":"cichocki","year":"2014","journal-title":"arXiv preprint arXiv 1403 2048"},{"key":"ref18","first-page":"164","article-title":"The expression of a tensor or a polyadic as a sum of products","volume":"6","author":"hitchcock","year":"1927","journal-title":"Studies in Applied Mathematics"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.80"},{"key":"ref25","author":"smith","year":"2017","journal-title":"FROSTT The formidable repository of open sparse tensors and tools"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1587\/nolta.1.37"},{"key":"ref42","first-page":"233","article-title":"Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks","author":"bulu\u00e7","year":"2009","journal-title":"Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures ACM"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2001.990454"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2002.10025"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/10.2119"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-45545-0_22","article-title":"Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY","author":"im","year":"2001","journal-title":"Computational Science ICCS 2001 ser Lecture Notes in Computer Science"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1460833.1460872"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2017.20"},{"key":"ref29","article-title":"Optimizing supercompilers for supercomputers","author":"wolfe","year":"1982","journal-title":"Ph D Dissertation University of Illinois at Urbana-Champaign"},{"key":"ref8","article-title":"Intel math kernel library reference manual","year":"2012","journal-title":"630813-051US"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.27"},{"key":"ref9","author":"guennebaud","year":"2010","journal-title":"Eigen V3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3133901"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738003"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3276493"},{"key":"ref40","author":"pissanetzky","year":"1984","journal-title":"Sparse Matrix Technology-electronic edition"}],"event":{"name":"2019 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)","location":"Washington, DC, USA","start":{"date-parts":[[2019,2,16]]},"end":{"date-parts":[[2019,2,20]]}},"container-title":["2019 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8653576\/8661160\/08661185.pdf?arnumber=8661185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T22:06:35Z","timestamp":1693433195000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8661185\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/cgo.2019.8661185","relation":{},"subject":[],"published":{"date-parts":[[2019,2]]}}}