{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:10:23Z","timestamp":1760440223937,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cw.2002.1180861","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"page":"62-69","source":"Crossref","is-referenced-by-count":1,"title":["Efficient data compression methods for multi-dimensional sparse array operations"],"prefix":"10.1109","author":[{"family":"Chun-Yuan Lin","sequence":"first","affiliation":[]},{"family":"Yeh-Ching Chung","sequence":"additional","affiliation":[]},{"family":"Jen-Shiuh Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"200","article-title":"The SP ARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations","author":"kehler","year":"1999","journal-title":"Proc Seventh Int l Workshop on Program Comprehension"},{"key":"ref11","article-title":"A Relation Approach to the Compilation of Sparse Matrix Programs","author":"vladimir","year":"1997","journal-title":"Euro Par"},{"key":"ref12","article-title":"Compiling Parallel Code for Sparse Matrix Applications","author":"vladimir","year":"1997","journal-title":"Proceedings of the Supercomouting Conference"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/12.990130"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.2000.900289"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1998.669899"},{"key":"ref16","article-title":"Parallelization Techniques for Sparse Matrix Applications","author":"manuel","year":"1996","journal-title":"J Parallel Distribut Comput"},{"key":"ref4","article-title":"Unifying Data and Control Transformations for Distributed Shared Memory Machines","author":"cierniak","year":"1994","journal-title":"Technical Report"},{"key":"ref3","article-title":"Parallel Sparse Supports for Array Intrinsic Functions of Fortran 90","author":"rong-guey","year":"0","journal-title":"accepted by Journal of Supercomputing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0057857"},{"key":"ref5","article-title":"Algorithms for Large Symmetric Eignenvalue Computations","volume":"1","author":"cullum","year":"1985"},{"journal-title":"Matrix Computations","year":"1989","author":"golub","key":"ref8"},{"key":"ref7","first-page":"345","article-title":"Cache Probabilistic Modeling for Basic Sparse Algebra Kernels Involving Matrices with a Non-Uniform Distribution","author":"fraguela","year":"1998","journal-title":"The 24th EUROMICRO Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1999.797394"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971538"},{"key":"ref9","article-title":"Improving Cache Locality bya Combination of Loop and Data Transformations","volume":"48","author":"mahmut","year":"1999","journal-title":"IEEE Trans on Computers"}],"event":{"name":"2002 International Symposium Cyber Worlds: Theory and Practices. CW2002","acronym":"CW-02","location":"Tokyo, Japan"},"container-title":["First International Symposium on Cyber Worlds, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8409\/26515\/01180861.pdf?arnumber=1180861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T22:49:10Z","timestamp":1489445350000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1180861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/cw.2002.1180861","relation":{},"subject":[]}}