{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:23:40Z","timestamp":1780356220309,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T00:00:00Z","timestamp":1525737600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,8]]},"DOI":"10.1145\/3203217.3205342","type":"proceedings-article","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T07:58:06Z","timestamp":1532591886000},"page":"260-267","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["GraphBLAS"],"prefix":"10.1145","author":[{"given":"Manoj","family":"Kumar","sequence":"first","affiliation":[{"name":"Yorktown Heights"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 E.","family":"Moreira","sequence":"additional","affiliation":[{"name":"Yorktown Heights"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pratap","family":"Pattnaik","sequence":"additional","affiliation":[{"name":"Yorktown Heights"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE","author":"Azad A.","unstructured":"A. Azad and A. Buluc. 2017. A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm. In 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, New York, NY, 688--697."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926278"},{"key":"e_1_3_2_1_4_1","first-page":"442","article-title":"R-MAT: A Recursive Model for Graph Mining","volume":"4","author":"Chakrabarti Deepayan","year":"2004","unstructured":"Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. SDM 4 (2004), 442--446.","journal-title":"SDM"},{"key":"e_1_3_2_1_5_1","volume-title":"graph algorithms via sparse matrix operations on semirings. (October","author":"Davis T.","year":"2017","unstructured":"T. Davis. 2017. SuiteSparse:GraphBLAS: graph algorithms via sparse matrix operations on semirings. (October 2017)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903150.2903164"},{"key":"e_1_3_2_1_7_1","volume-title":"Bader et.al. Released","author":"David","year":"2007","unstructured":"David A. Bader et.al. Released 5 September 2007. HPCS Scalable Synthetic Compact Applications #2 Graph Analysis (v2.2 ed.). Technical Report. GraphAnalysis.org. arXiv:http:\/\/www.graphanalysis.org\/benchmark\/HPCS-SSCA2_Graph-Theory_v2.2.pdf"},{"key":"e_1_3_2_1_8_1","volume-title":"2016 IEEE High Performance Extreme Computing Conference (HPEC). IEEE","author":"Kepner J.","unstructured":"J. Kepner, P. Aaltonen, D. Bader, A. Buluc, F. Franchetti, J. Gilbert, D. Hutchison, M. Kumar, A. Lumsdaine, H. Meyerhenke, S. McMillan, C. Yang, J. D. Owens, M. Zalewski, T. Mattson, and J. Moreira. 2016. Mathematical foundations of the GraphBLAS. In 2016 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, New York, NY, 1--9."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Jeremy Kepner and John Gilbert (Eds.). 2011. Graph Algorithms in the Language of Linear Algebra. Society for Industrial and Applied Mathematics Philadelphia PA.","DOI":"10.5555\/2039367"},{"key":"e_1_3_2_1_10_1","volume-title":"2017 IEEE High Performance Extreme Computing Conference (HPEC). IEEE","author":"Kepner J.","unstructured":"J. Kepner, M. Kumar, J. Moreira, P. Pattnaik, M. Serrano, and H. Tufo. 2017. Enabling massive deep neural networks with the GraphBLAS. In 2017 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, New York, NY, 1--10."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2018.2846958"},{"key":"e_1_3_2_1_12_1","volume-title":"2016 IEEE High Performance Extreme Computing Conference (HPEC). IEEE","author":"Kumar M.","unstructured":"M. Kumar, M. Serrano, J. Moreira, P. Pattnaik, W. P. Horn, J. Jann, and G. Tanase. 2016. Efficient implementation of scatter-gather operations for large scale graph analytics. In 2016 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, New York, NY, 1--7."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_14_1","article-title":". Special Issue: Graphs and Networks","volume":"20","author":"Lincoln Laboratory MIT","year":"2013","unstructured":"MIT Lincoln Laboratory 2013. Special Issue: Graphs and Networks. MIT Lincoln Laboratory Journal 20, 1 (2013).","journal-title":"MIT Lincoln Laboratory Journal"},{"key":"e_1_3_2_1_15_1","unstructured":"D. Mulnix. 2017. Intel\u00c2\u0151 Xeon\u00c2\u0151 Processor Scalable Family Technical Overview. Technical Report. Intel Corporation. arXiv:https:\/\/software.intel.com\/en-us\/articles\/intel-xeon-processor-scalable-family-technical-overview"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2014.2376112"}],"event":{"name":"CF '18: Computing Frontiers Conference","location":"Ischia Italy","acronym":"CF '18","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 15th ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3203217.3205342","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3203217.3205342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:40:57Z","timestamp":1776876057000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3203217.3205342"}},"subtitle":["handling performance concerns in large graph analytics"],"short-title":[],"issued":{"date-parts":[[2018,5,8]]},"references-count":17,"alternative-id":["10.1145\/3203217.3205342","10.1145\/3203217"],"URL":"https:\/\/doi.org\/10.1145\/3203217.3205342","relation":{},"subject":[],"published":{"date-parts":[[2018,5,8]]},"assertion":[{"value":"2018-05-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}