{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:06:11Z","timestamp":1750309571671,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1145\/3711708.3723447","type":"proceedings-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:33:27Z","timestamp":1746189207000},"page":"48-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Hyb-Stepping: Hybrid Stepping for Parallel Shortest Paths"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2128-5735","authenticated-orcid":false,"given":"Ashkan","family":"Vedadi Gargary","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7586-4753","authenticated-orcid":false,"given":"Sakib","family":"Fuad","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Congressus Numerantium, vol32","volume":"32","author":"Bermond Jean-Claude","year":"1981","unstructured":"Jean-Claude Bermond and Bela Bollobas. 1981. The diameter of graphs: A survey. In Congressus Numerantium, vol32, Vol. 32. 3--27."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/2935764.2935765"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/TPDS.2016.2634535"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/IPDPS.2014.45"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/BF01386390"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/j.jda.2017.01.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1016\/j.cpc.2012.10.015"},{"key":"e_1_3_2_1_8_1","first-page":"8097","article-title":"Parallel Algorithms Can Be Provably Fast and Scalable. Proceedings of the VLDB Endowment","volume":"2150","author":"Dong Xiaojun","year":"2024","unstructured":"Xiaojun Dong. 2024. Parallel Algorithms Can Be Provably Fast and Scalable. Proceedings of the VLDB Endowment. ISSN 2150 (2024), 8097.","journal-title":"ISSN"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/3626183.3660258"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3409964.3461782"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/28869.28874"},{"doi-asserted-by":"crossref","unstructured":"Andrew V Goldberg and Tomasz Radzik. 1993. A heuristic improvement of the Bellman-Ford algorithm. Citeseer.","key":"e_1_3_2_1_12_1","DOI":"10.1016\/0893-9659(93)90022-F"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/ICCD.2010.5647747"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1137\/1.9781611978322.178"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/IPDPSW63119.2024.00087"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 47th International Youth School-Conference \u201eModern Problems in Mathematics and its Applications\" (MPMA). 164--169","author":"Lesnikov Dmitry","year":"2016","unstructured":"Dmitry Lesnikov and Mikhail Chernoskutov. 2016. Performance analysis of-stepping algorithm on CPU and GPU. In Proceedings of the 47th International Youth School-Conference \u201eModern Problems in Mathematics and its Applications\" (MPMA). 164--169."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_18_1","volume-title":"Diameter of a Graph. https:\/\/transportgeography.org\/contents\/methods\/graph-theory-measures-indices\/diameter-graph\/ Accessed","author":"Rodrigue Jean-Paul","year":"2025","unstructured":"Jean-Paul Rodrigue. 2025. Diameter of a Graph. https:\/\/transportgeography.org\/contents\/methods\/graph-theory-measures-indices\/diameter-graph\/ Accessed: March 11, 2025."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/DCC.2015.8"},{"key":"e_1_3_2_1_20_1","volume-title":"Parallel local graph clustering. arXiv preprint arXiv:1604.07515","author":"Shun Julian","year":"2016","unstructured":"Julian Shun, Farbod Roosta-Khorasani, Kimon Fountoulakis, and Michael W Mahoney. 2016. Parallel local graph clustering. arXiv preprint arXiv:1604.07515 (2016)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/3589259"},{"volume-title":"Cache and Memory Optimized Data Structures for High Performance Applications. Ph. D. Dissertation","author":"Wheatman Brian","unstructured":"Brian Wheatman. 2024. Cache and Memory Optimized Data Structures for High Performance Applications. Ph. D. Dissertation. Johns Hopkins University.","key":"e_1_3_2_1_22_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3627535.3638492"}],"event":{"sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"],"acronym":"FCPC '25","name":"FCPC '25: 1st FastCode Programming Challenge","location":"The Westin Las Vegas Hotel & Spa Las Vegas NV USA"},"container-title":["Proceedings of the 1st FastCode Programming Challenge"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711708.3723447","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711708.3723447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:19:15Z","timestamp":1750295955000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711708.3723447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":23,"alternative-id":["10.1145\/3711708.3723447","10.1145\/3711708"],"URL":"https:\/\/doi.org\/10.1145\/3711708.3723447","relation":{},"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"2025-05-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}