{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:10Z","timestamp":1750221130775,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T00:00:00Z","timestamp":1552003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Xi'an Jiatong-Liverpool University","award":["KSF-E-21,RDF-17-02-23"],"award-info":[{"award-number":["KSF-E-21,RDF-17-02-23"]}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20171237"],"award-info":[{"award-number":["BK20171237"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501044, 11871339,11571002,11571047,11671051,61672003"],"award-info":[{"award-number":["11501044, 11871339,11571002,11571047,11671051,61672003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,3,8]]},"DOI":"10.1145\/3318265.3318278","type":"proceedings-article","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T12:34:06Z","timestamp":1554813246000},"page":"20-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast sparse kernel summation on cartesian grids"],"prefix":"10.1145","author":[{"given":"Shengxin","family":"Zhu","sequence":"first","affiliation":[{"name":"Xi'an Jiaotong-Liverpool University, Suzhou, P.R.China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J","family":"Wathen","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,3,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1093\/imanum\/drl027"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/383259.383266"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1137\/120903002"},{"doi-asserted-by":"crossref","unstructured":"T. Gu X. Liu Z. Mo X. Xu and S. Zhu. 2015. On the Memory Wall and Performance of Symmetric Sparse Matrix Vector Multiplications In Different Data Structures on Shared Memory Machines. In 2015 IEEE UIC-ATC-ScalCom. IEEE Beijing China 1439--1444.  T. Gu X. Liu Z. Mo X. Xu and S. Zhu. 2015. On the Memory Wall and Performance of Symmetric Sparse Matrix Vector Multiplications In Different Data Structures on Shared Memory Machines. In 2015 IEEE UIC-ATC-ScalCom. IEEE Beijing China 1439--1444.","key":"e_1_3_2_1_4_1","DOI":"10.1109\/UIC-ATC-ScalCom-CBDCom-IoP.2015.259"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1137\/090779851"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/j.jcp.2005.09.010"},{"volume-title":"All of statistics","author":"Wasserman L.","unstructured":"L. Wasserman . 2004. All of statistics . Springer . L. Wasserman. 2004. All of statistics. Springer.","key":"e_1_3_2_1_7_1"},{"volume-title":"Scattered Data Approximation","author":"Wendland H.","unstructured":"H. Wendland . 2004. Scattered Data Approximation . Cambridge University Press . H. Wendland. 2004. Scattered Data Approximation. Cambridge University Press.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","volume-title":"Wuxi, China","author":"Xu X.","year":"2018","unstructured":"X. Xu and S. Zhu . 2018. Symmetric Sweeping Algorithms for Overlaps of Quadrilateral Meshes of the Same Connectivity. In Computational Science - ICCS 2018 - 18th International Conference , Wuxi, China , June 11-13, 2018 Proceedings, Part III. 61--75. X. Xu and S. Zhu. 2018. Symmetric Sweeping Algorithms for Overlaps of Quadrilateral Meshes of the Same Connectivity. In Computational Science - ICCS 2018 - 18th International Conference, Wuxi, China, June 11-13, 2018 Proceedings, Part III. 61--75."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/j.cma.2010.02.008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/j.camwa.2013.11.008"},{"volume-title":"Information Splitting for Big Data Analytics. In 2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","author":"Zhu S.","unstructured":"S. Zhu , T. Gu , Xu. X. , and Z. Mo . 2016 . Information Splitting for Big Data Analytics. In 2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) . Chengdu, China, 294--302. S. Zhu, T. Gu, Xu. X., and Z. Mo. 2016. Information Splitting for Big Data Analytics. In 2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). Chengdu, China, 294--302.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Technical Report NA-14-06. University of Oxford","author":"Zhu S.","year":"2014","unstructured":"S. Zhu and A.J. Wathen . 2014 . Fast sparse kernel summation on Cartesian grids. Technical Report NA-14-06. University of Oxford , Oxford , http:\/\/eprints.maths.ox.ac.uk\/1820\/ S. Zhu and A.J. Wathen. 2014. Fast sparse kernel summation on Cartesian grids. Technical Report NA-14-06. University of Oxford, Oxford, http:\/\/eprints.maths.ox.ac.uk\/1820\/"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/s10915-014-9919-9"}],"event":{"acronym":"HP3C '19","name":"HP3C '19: 2019 the 3rd International Conference on High Performance Compilation, Computing and Communications","location":"Xi'an China"},"container-title":["Proceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318265.3318278","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318265.3318278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:23Z","timestamp":1750208543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318265.3318278"}},"subtitle":["an on-chip algorithm for 3D implicit surface visualization"],"short-title":[],"issued":{"date-parts":[[2019,3,8]]},"references-count":14,"alternative-id":["10.1145\/3318265.3318278","10.1145\/3318265"],"URL":"https:\/\/doi.org\/10.1145\/3318265.3318278","relation":{},"subject":[],"published":{"date-parts":[[2019,3,8]]},"assertion":[{"value":"2019-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}