{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:41:24Z","timestamp":1729676484974,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/hpcsim.2013.6641446","type":"proceedings-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T23:23:43Z","timestamp":1383089023000},"page":"398-404","source":"Crossref","is-referenced-by-count":0,"title":["Modular design of data-parallel graph algorithms"],"prefix":"10.1109","author":[{"given":"Santanu Kumar","family":"Dash","sequence":"first","affiliation":[]},{"given":"Sven-Bodo","family":"Scholz","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Christianson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"3","DOI":"10.1137\/0913067"},{"key":"2","doi-asserted-by":"crossref","first-page":"1366","DOI":"10.1016\/j.jpdc.2006.06.001","article-title":"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs","volume":"66","author":"bader","year":"2006","journal-title":"Journal of Parallel and Distribibuted Computing"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1017\/S0956796801004075"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1007\/b106453","article-title":"Network analysis: Methodological foundations [outcome of a dagstuhl seminar","volume":"3418","author":"brandes","year":"2005","journal-title":"13-16 April 2004] Ser Lecture Notes in Computer Science"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"6","first-page":"3","author":"hassaan","year":"2011","journal-title":"Ordered Vs Unordered A Comparison of Parallelism and Work-efficiency in Irregular Algorithms"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1145\/1993498.1993501"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1145\/1250734.1250759"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1017\/S0956796802004458"},{"key":"8","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0055425","article-title":"With-loop-folding in sac-condensing consecutive array operations","volume":"1467","author":"scholz","year":"1998","journal-title":"The implementation of functional languages"}],"event":{"name":"2013 International Conference on High Performance Computing & Simulation (HPCS)","start":{"date-parts":[[2013,7,1]]},"location":"Helsinki, Finland","end":{"date-parts":[[2013,7,5]]}},"container-title":["2013 International Conference on High Performance Computing & Simulation (HPCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6619547\/6641375\/06641446.pdf?arnumber=6641446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T01:02:10Z","timestamp":1498093330000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6641446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/hpcsim.2013.6641446","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}