{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:48:48Z","timestamp":1750308528708,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T00:00:00Z","timestamp":1463961600000},"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":[[2016,5,23]]},"DOI":"10.1145\/2906363.2915925","type":"proceedings-article","created":{"date-parts":[[2016,5,13]],"date-time":"2016-05-13T18:21:10Z","timestamp":1463163670000},"page":"197-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring Single Source Shortest Path Parallelization on Shared Memory Accelerators"],"prefix":"10.1145","author":[{"given":"Daniele","family":"Palossi","sequence":"first","affiliation":[{"name":"IIS, ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marongiu","sequence":"additional","affiliation":[{"name":"IIS, ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442549"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6094629"},{"key":"e_1_3_2_1_4_1","unstructured":"M. Kranj\u010devi\u0107 D. Palossi and S. Pintarelli. Parallel delta-stepping algorithm for shared memory architectures arXiv:1604.02113v1 {cs.DC}.  M. Kranj\u010devi\u0107 D. Palossi and S. Pintarelli. Parallel delta-stepping algorithm for shared memory architectures arXiv:1604.02113v1 {cs.DC}."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509725"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSNDSP.2012.6292692"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/572636"}],"event":{"name":"SCOPES '16: 19th International Workshop on Software and Compilers for Embedded Systems","sponsor":["EDAA European Design Automation Association","SIGBED"],"location":"Sankt Goar Germany","acronym":"SCOPES '16"},"container-title":["Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2906363.2915925","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2906363.2915925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:55:50Z","timestamp":1750272950000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2906363.2915925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,23]]},"references-count":8,"alternative-id":["10.1145\/2906363.2915925","10.1145\/2906363"],"URL":"https:\/\/doi.org\/10.1145\/2906363.2915925","relation":{},"subject":[],"published":{"date-parts":[[2016,5,23]]},"assertion":[{"value":"2016-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}