{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:59:50Z","timestamp":1764842390175,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Education, Youth and Sports","award":["LM2015070"],"award-info":[{"award-number":["LM2015070"]}]},{"name":"Czech Ministry of Education, Youth and Sports","award":["CZ.02.1.01\/0.0\/0.0\/16 019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16 019\/0000765"]}]},{"name":"Grant Agency of the Czech Technical University in Prague","award":["SGS20\/212\/OHK3\/3T\/18"],"award-info":[{"award-number":["SGS20\/212\/OHK3\/3T\/18"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,23]]},"DOI":"10.1145\/3369583.3392692","type":"proceedings-article","created":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T03:27:27Z","timestamp":1592796447000},"page":"29-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Space-Efficient k-d Tree-Based Storage Format for Sparse Tensors"],"prefix":"10.1145","author":[{"given":"Ivan","family":"\u0160ime\u010dek","sequence":"first","affiliation":[{"name":"Czech Technical University in Prague, Prague, Czech Rep"}]},{"given":"Claudio","family":"Kozick\u00fd","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague, Prague, Czech Rep"}]},{"given":"Daniel","family":"Langr","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague, Prague, Czech Rep"}]},{"given":"Pavel","family":"Tvrd\u00edk","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague, Prague, Czech Rep"}]}],"member":"320","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Mart'in Abadi Ashish Agarwal Paul Barham Eugene Brevdo Zhifeng Chen Craig Citro Greg S. Corrado Andy Davis Jeffrey Dean Matthieu Devin Sanjay Ghemawat Ian Goodfellow Andrew Harp Geoffrey Irving Michael Isard Yangqing Jia Rafal Jozefowicz Lukasz Kaiser Manjunath Kudlur Josh Levenberg Dandelion Man\u00e9 Rajat Monga Sherry Moore Derek Murray Chris Olah Mike Schuster Jonathon Shlens Benoit Steiner Ilya Sutskever Kunal Talwar Paul Tucker Vincent Vanhoucke Vijay Vasudevan Fernanda Vi\u00e9gas Oriol Vinyals Pete Warden Martin Wattenberg Martin Wicke Yuan Yu and Xiaoqiang Zheng. 2015. TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems. https:\/\/www.tensorflow.org\/ Software available from tensorflow.org."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11760146_19"},{"volume-title":"Matrix and Tensor Calculus: With Applications to Mechanics, Elasticity and Aeronautics","author":"Aristotle D. Michal","key":"e_1_3_2_2_3_1","unstructured":"D. Michal Aristotle. 2008. Matrix and Tensor Calculus: With Applications to Mechanics, Elasticity and Aeronautics .Dover Publications."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/060676489"},{"key":"e_1_3_2_2_5_1","volume-title":"Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods","author":"Barrett R.","unstructured":"R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. Van der Vorst. 1994. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods 2nd ed.). SIAM, Philadelphia, PA.","edition":"2"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/355815.355817"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--1--4615--8675--3_4"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3018843.3018848"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00022"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1252859"},{"key":"e_1_3_2_2_14_1","volume-title":"2017 IEEE International Conference on Cluster Computing (CLUSTER) (May","author":"Liu Bangtian","year":"2017","unstructured":"Bangtian Liu, Chengyao Wen, Anand D. Sarwate, and Maryam Mehri Dehnavi. 2017. A Unified Optimization Approach for Sparse Tensor Operations on GPUs. 2017 IEEE International Conference on Cluster Computing (CLUSTER) (May 2017), 47--57."},{"volume-title":"A computer Oriented Geodetic Data Base","author":"Morton G. M.","key":"e_1_3_2_2_15_1","unstructured":"G. M. Morton. 1966. A computer Oriented Geodetic Data Base; and a New Technique in File Sequencing. IBM Ltd."},{"key":"e_1_3_2_2_16_1","volume-title":"FROSTT: The Formidable Repository of Open Sparse Tensors and Tools","author":"Smith Shaden","year":"2017","unstructured":"Shaden Smith, Jee W. Choi, Jiajia Li, Richard Vuduc, Jongsoo Park, Xing Liu, and George Karypis. 2017. FROSTT: The Formidable Repository of Open Sparse Tensors and Tools. http:\/\/frostt.io\/"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.27"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_3_2_2_19_1","unstructured":"Parker Allen Tew. 2016. An Investigation of Sparse Tensor Formats for Tensor Libraries. http:\/\/groups.csail.mit.edu\/commit\/papers\/2016\/parker-thesis.pdf"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2009.55"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2014.25"},{"key":"e_1_3_2_2_22_1","volume-title":"Minimal Quadtree Format for Compression of Sparse Matrices Storage. In 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'2012)","author":"Simevcek I.","year":"2012","unstructured":"I. Simevcek, D. Langr, and P. Tvrdik. 2012. Minimal Quadtree Format for Compression of Sparse Matrices Storage. In 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'2012) (SYNASC'2012). Timisoara, Romania, 359--364. https:\/\/doi.org\/10.1109\/SYNASC.2012.30"}],"event":{"name":"HPDC '20: The 29th International Symposium on High-Performance Parallel and Distributed Computing","sponsor":["University of Arizona University of Arizona","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Stockholm Sweden","acronym":"HPDC '20"},"container-title":["Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369583.3392692","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3369583.3392692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:07Z","timestamp":1750200067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3369583.3392692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,23]]},"references-count":22,"alternative-id":["10.1145\/3369583.3392692","10.1145\/3369583"],"URL":"https:\/\/doi.org\/10.1145\/3369583.3392692","relation":{},"subject":[],"published":{"date-parts":[[2020,6,23]]},"assertion":[{"value":"2020-06-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}