{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:42Z","timestamp":1772164062789,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T00:00:00Z","timestamp":1488153600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1111407"],"award-info":[{"award-number":["CNS 1111407"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,2,27]]},"DOI":"10.1145\/2851141.2851183","type":"proceedings-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T08:18:49Z","timestamp":1456129129000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["DSMR"],"prefix":"10.1145","author":[{"given":"Saeed","family":"Maleki","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Nguyen","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lenharth","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda","family":"Garzar\u00e1n","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Padua","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,2,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science'99."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.96"},{"key":"e_1_3_2_1_3_1","volume-title":"SDM'04","author":"Chakrabarti D.","unstructured":"D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM'04."},{"key":"e_1_3_2_1_4_1","volume-title":"Encyclopedia of Algorithms'08.","author":"Demetrescu C.","unstructured":"C. Demetrescu, A. V. Goldberg, and D. S. Johnson. Implementation challenge for shortest paths. In Encyclopedia of Algorithms'08."},{"key":"e_1_3_2_1_5_1","unstructured":"Galois System. http:\/\/iss.ices.utexas.edu\/?p=projects\/galois."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"U. Meyer and P. Sanders. Delta-stepping: A parallelizable shortest path algorithm. J. Algorithms'03. 10.1016\/S0196-6774(03)00076-2","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_7_1","author":"Palla G.","unstructured":"G. Palla, I. J. Farkas, P. Pollner, I. Dernyi, and T. Vicsek. Fundamental statistical features and self-similar properties of tagged networks. New Journal of Physics.","journal-title":"New Journal of Physics."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384644"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"}],"event":{"name":"PPoPP '16: 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Barcelona Spain","acronym":"PPoPP '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851141.2851183","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851141.2851183","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851141.2851183","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:18:26Z","timestamp":1763457506000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851141.2851183"}},"subtitle":["a shared and distributed memory algorithm for single-source shortest path problem"],"short-title":[],"issued":{"date-parts":[[2016,2,27]]},"references-count":9,"alternative-id":["10.1145\/2851141.2851183","10.1145\/2851141"],"URL":"https:\/\/doi.org\/10.1145\/2851141.2851183","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3016078.2851183","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,2,27]]},"assertion":[{"value":"2016-02-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}