{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:24:37Z","timestamp":1768029877578,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,24]],"date-time":"2014-08-24T00:00:00Z","timestamp":1408838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["RI-1217991"],"award-info":[{"award-number":["RI-1217991"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0917266"],"award-info":[{"award-number":["IIS-0917266"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0916053"],"award-info":[{"award-number":["IIS-0916053"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["B575363"],"award-info":[{"award-number":["B575363"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004358","name":"Samsung","doi-asserted-by":"publisher","award":["KUS-C1-016-04"],"award-info":[{"award-number":["KUS-C1-016-04"]}],"id":[{"id":"10.13039\/100004358","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0830753"],"award-info":[{"award-number":["CCF-0830753"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0833199"],"award-info":[{"award-number":["CCF-0833199"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004682","name":"Oracle","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004682","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000150","name":"Division of Emerging Frontiers in Research and Innovation","doi-asserted-by":"publisher","award":["EFRI-1240483"],"award-info":[{"award-number":["EFRI-1240483"]}],"id":[{"id":"10.13039\/100000150","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0551685"],"award-info":[{"award-number":["CNS-0551685"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004366","name":"Chevron","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004366","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006168","name":"National Nuclear Security Administration","doi-asserted-by":"publisher","award":["DE-NA0002376"],"award-info":[{"award-number":["DE-NA0002376"]}],"id":[{"id":"10.13039\/100006168","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,24]]},"DOI":"10.1145\/2628071.2628091","type":"proceedings-article","created":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T12:19:23Z","timestamp":1408623563000},"page":"27-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["KLA"],"prefix":"10.1145","author":[{"family":"Harshvardhan","sequence":"first","affiliation":[{"name":"Texas A&amp;M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Fidel","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nancy M.","family":"Amato","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Rauchwerger","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University, College Station, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/www.graph500.org","author":"0","year":"2013","unstructured":"The graph 50 0 list. http:\/\/www.graph500.org , 2013 . The graph 500 list. http:\/\/www.graph500.org, 2013."},{"key":"e_1_3_2_1_2_1","volume-title":"http:\/\/snap.stanford.edu\/data\/index.html","year":"2013","unstructured":"Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/index.html , 2013 . Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/index.html, 2013."},{"key":"e_1_3_2_1_3_1","volume-title":"http:\/\/www.dis.uniroma1.it\/challenge9\/","author":"Implementation Challenge MACS","year":"2013","unstructured":"9th DI MACS Implementation Challenge . http:\/\/www.dis.uniroma1.it\/challenge9\/ , 2013 . 9th DIMACS Implementation Challenge. http:\/\/www.dis.uniroma1.it\/challenge9\/, 2013."},{"key":"e_1_3_2_1_4_1","first-page":"41","article-title":"Large scale networks fingerprinting and visualization using the k-core decomposition","volume":"18","author":"J. I.","year":"2006","unstructured":"J. I. Alvarez-hamelin, A. Barrat , and A. Vespignani . Large scale networks fingerprinting and visualization using the k-core decomposition . In Adv. in Neural Inf. Proc. Syst. 18 , pp. 41 -- 50 . MIT Press, 2006 . J. I. Alvarez-hamelin, A. Barrat, and A. Vespignani. Large scale networks fingerprinting and visualization using the k-core decomposition. In Adv. in Neural Inf. Proc. Syst. 18, pp. 41--50. MIT Press, 2006.","journal-title":"Adv. in Neural Inf. Proc. Syst."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"e_1_3_2_1_6_1","first-page":"163","volume-title":"Sociology","author":"Brandes U.","year":"2001","unstructured":"U. Brandes . A faster algorithm for betweenness centrality. J. of Math . Sociology , pp. 163 -- 177 , 2001 . U. Brandes. A faster algorithm for betweenness centrality. J. of Math. Sociology, pp. 163--177, 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_1_9_1","volume-title":"Intl. Workshop on Languages and Compilers for Parallel Computing (LCPC), in Lecture Notes in Computer Science (LNCS)","author":"Buss A.","year":"2010","unstructured":"A. Buss , A. Fidel , Harshvardhan, T. Smith , G. Tanase , N. Thomas , X. Xu , M. Bianco , N. M. Amato , and L. Rauchwerger . The STAPL pView . In Intl. Workshop on Languages and Compilers for Parallel Computing (LCPC), in Lecture Notes in Computer Science (LNCS) , Houston, TX, USA , 2010 . A. Buss, A. Fidel, Harshvardhan, T. Smith, G. Tanase, N. Thomas, X. Xu, M. Bianco, N. M. Amato, and L. Rauchwerger. The STAPL pView. In Intl. Workshop on Languages and Compilers for Parallel Computing (LCPC), in Lecture Notes in Computer Science (LNCS), Houston, TX, USA, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815695.1815713"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442549"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_13_1","volume-title":"POOSC","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine . The Parallel BGL: A generic library for distributed graph computations. In Parallel Object-Oriented Scientific Computing , POOSC , 2005 . D. Gregor and A. Lumsdaine. The Parallel BGL: A generic library for distributed graph computations. In Parallel Object-Oriented Scientific Computing, POOSC, 2005."},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","first-page":"46","volume-title":"Languages and Compilers for Parallel Computing","author":"Fidel A.","year":"2012","unstructured":"Harshvardhan, A. Fidel , N. M. Amato , and L. Rauchwerger . The STAPL Parallel Graph Library . In Languages and Compilers for Parallel Computing , Lecture Notes in Computer Science , pp. 46 -- 60 . Springer Berlin Heidelberg , 2012 . Harshvardhan, A. Fidel, N. M. Amato, and L. Rauchwerger. The STAPL Parallel Graph Library. In Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, pp. 46--60. Springer Berlin Heidelberg, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854341"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/133889"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810534"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/647908.740136"},{"key":"e_1_3_2_1_23_1","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani and T. Winograd . The PageRank Citation Ranking: Bringing Order to the Web . 1998 . L. Page, S. Brin, R. Motwani and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. 1998."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.34"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384644"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2514.2515"},{"key":"e_1_3_2_1_27_1","volume-title":"Morgan Kaufmann","author":"Reif J. H.","year":"1993","unstructured":"J. H. Reif , editor. Synthesis of Parallel Algorithms . Morgan Kaufmann , San Mateo, CA , 1993 . J. H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann, San Mateo, CA, 1993."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1940281.1940330"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941586"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_31_1","volume-title":"CIDR","author":"Wang G.","year":"2013","unstructured":"G. Wang , W. Xie , A. J. Demers , and J. Gehrke . Asynchronous large-scale graph processing made easy . In CIDR , 2013 . G. Wang, W. Xie, A. J. Demers, and J. Gehrke. Asynchronous large-scale graph processing made easy. In CIDR, 2013."},{"key":"e_1_3_2_1_32_1","first-page":"440","volume-title":"Nature","author":"Watts D. J.","year":"1998","unstructured":"D. J. Watts and S. H. Strogatz . Collective dynamics of 'small-world' networks . Nature , pp. 440 -- 442 , 1998 . D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, pp. 440--442, 1998."}],"event":{"name":"PACT '14: International Conference on Parallel Architectures and Compilation","location":"Edmonton AB Canada","acronym":"PACT '14","sponsor":["IFIP WG 10.3 IFIP WG 10.3","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS TCPP IEEE Computer Society Technical Committee on Parallel Processing","IEEE CS TCAA IEEE CS technical committee on architectural acoustics"]},"container-title":["Proceedings of the 23rd international conference on Parallel architectures and compilation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2628071.2628091","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2628071.2628091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:38Z","timestamp":1750231178000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2628071.2628091"}},"subtitle":["a new algorithmic paradigm for parallel graph computations"],"short-title":[],"issued":{"date-parts":[[2014,8,24]]},"references-count":32,"alternative-id":["10.1145\/2628071.2628091","10.1145\/2628071"],"URL":"https:\/\/doi.org\/10.1145\/2628071.2628091","relation":{},"subject":[],"published":{"date-parts":[[2014,8,24]]},"assertion":[{"value":"2014-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}