{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:09:57Z","timestamp":1765544997137,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2331301","2508118","2516003","2419843"],"award-info":[{"award-number":["2331301","2508118","2516003","2419843"]}],"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":[[2025,3]]},"DOI":"10.1145\/3711708.3723450","type":"proceedings-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:33:27Z","timestamp":1746189207000},"page":"53-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive Optimizations for Parallel Single-Source Shortest Paths"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0901-530X","authenticated-orcid":false,"given":"Runbang","family":"Hu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7559-0626","authenticated-orcid":false,"given":"Chaoqun","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4235-9671","authenticated-orcid":false,"given":"Xiaojiang","family":"Du","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2419-6592","authenticated-orcid":false,"given":"Yuede","family":"Ji","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404397.3404433"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2015.11"},{"key":"e_1_3_2_1_3_1","volume-title":"Patterson","author":"Beamer Scott","year":"2015","unstructured":"Scott Beamer, Krste Asanovic, and David A. Patterson. 2015. The GAP Benchmark Suite. CoRR abs\/1508.03619 (2015). arXiv:1508.03619 http:\/\/arxiv.org\/abs\/1508.03619"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584053"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-014-0330-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598054"},{"key":"e_1_3_2_1_7_1","volume-title":"A Note on Two Problems in Connexion with Graphs. Numerische mathematik 1, 1","author":"Dijkstra Edsger W","year":"1959","unstructured":"Edsger W Dijkstra. 1959. A Note on Two Problems in Connexion with Graphs. Numerische mathematik 1, 1 (1959), 269--271."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461782"},{"key":"e_1_3_2_1_9_1","volume-title":"Stopping the cyberattack in the early stage: assessing the security risks of social network users. Security and Communication Networks 2019","author":"Feng Bo","year":"2019","unstructured":"Bo Feng, Qiang Li, Yuede Ji, Dong Guo, and Xiangyu Meng. 2019. Stopping the cyberattack in the early stage: assessing the security risks of social network users. Security and Communication Networks 2019 (2019)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607110"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5120\/16667-6659"},{"key":"e_1_3_2_1_12_1","volume-title":"The 33rd USENIX Security Symposium (USENIX Security).","author":"He Haojie","year":"2024","unstructured":"Haojie He, Xingwei Lin, Ziang Weng, Ruijie Zhao, Shuitao Gan, Libo Chen, Yuede Ji, Jiashui Wang, and Zhi Xue. 2024. Code is not Natural Language: Unlock the Power of Semantics-Oriented Graph Representation for Binary Code Similarity Detection. In The 33rd USENIX Security Symposium (USENIX Security)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1177\/1550147717694170"},{"key":"e_1_3_2_1_14_1","volume-title":"2012 proceedings of the 35th international convention MIPRO. IEEE","author":"Jasika Nadira","year":"2012","unstructured":"Nadira Jasika, Naida Alispahic, Arslanagic Elma, Kurtovic Ilvana, Lagumdzija Elma, and Novica Nosovic. 2012. Dijkstra's shortest path algorithm serial and parallel execution performance analysis. In 2012 proceedings of the 35th international convention MIPRO. IEEE, 1811--1815."},{"volume-title":"BugGraph: Differentiating Source-Binary Code Similarity with Graph Triplet-Loss Network. In 16th ACM ASIA Conference on Computer and Communications Security (AsiaCCS).","author":"Ji Yuede","key":"e_1_3_2_1_15_1","unstructured":"Yuede Ji, Lei Cui, and H. Howie Huang. 2021. BugGraph: Differentiating Source-Binary Code Similarity with Graph Triplet-Loss Network. In 16th ACM ASIA Conference on Computer and Communications Security (AsiaCCS)."},{"key":"e_1_3_2_1_16_1","volume-title":"DEFInit: An Analysis of Exposed Android Init Routines. In 30th USENIX Security Symposium (USENIX Security).","author":"Ji Yuede","year":"2021","unstructured":"Yuede Ji, Mohamed Elsabagh, Ryan Johnson, and Angelos Stavrou. 2021. DEFInit: An Analysis of Exposed Android Init Routines. In 30th USENIX Security Symposium (USENIX Security)."},{"key":"e_1_3_2_1_17_1","volume-title":"Combating the evasion mechanisms of social bots. Computers & Security","author":"Ji Yuede","year":"2016","unstructured":"Yuede Ji, Yukun He, Xinyang Jiang, Jian Cao, and Qiang Li. 2016. Combating the evasion mechanisms of social bots. Computers & Security (2016)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/PADSW.2014.7097824"},{"volume-title":"Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing (HPDC).","author":"Ji Yuede","key":"e_1_3_2_1_19_1","unstructured":"Yuede Ji and H. Howie Huang. 2020. Aquila: Adaptive Parallel Computation of Graph Connectivity Queries. In Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing (HPDC)."},{"volume-title":"International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE, 731--742","author":"Ji Yuede","key":"e_1_3_2_1_20_1","unstructured":"Yuede Ji, Hang Liu, and H. Howie Huang. 2018. iSpan: Parallel Identification of Strongly Connected Components with Spanning Trees. In International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE, 731--742."},{"volume-title":"SwarmGraph: Analyzing Large-Scale In-Memory Graphs on GPUs. In International Conference on High Performance Computing and Communications (HPCC). IEEE.","author":"Ji Yuede","key":"e_1_3_2_1_21_1","unstructured":"Yuede Ji, Hang Liu, and H. Howie Huang. 2020. SwarmGraph: Analyzing Large-Scale In-Memory Graphs on GPUs. In International Conference on High Performance Computing and Communications (HPCC). IEEE."},{"volume-title":"A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP. In 2023 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics (RI2C)","author":"Khadka Mandeep","key":"e_1_3_2_1_22_1","unstructured":"Mandeep Khadka, Rachata Ausavarungnirun, and Christian Terboven. 2023. A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP. In 2023 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics (RI2C). IEEE, 112--119."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882959"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2014.37"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00227"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767844"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICINIS.2008.147"},{"key":"e_1_3_2_1_29_1","volume-title":"John Yannis Goulermas, and Terrence Fernando","author":"Soltani Amir R","year":"2002","unstructured":"Amir R Soltani, Hissam Tawfik, John Yannis Goulermas, and Terrence Fernando. 2002. Path planning in construction sites: performance evaluation of the Dijkstra, A*, and GA search algorithms. Advanced engineering informatics 16, 4 (2002), 291--303."},{"key":"e_1_3_2_1_30_1","unstructured":"Speedcode. [n. d.]. Speedcode. https:\/\/speedcode.org\/"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2019.00047"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377909"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3605731.3605746"}],"event":{"name":"FCPC '25: 1st FastCode Programming Challenge","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"],"location":"The Westin Las Vegas Hotel & Spa Las Vegas NV USA","acronym":"FCPC '25"},"container-title":["Proceedings of the 1st FastCode Programming Challenge"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711708.3723450","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711708.3723450","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711708.3723450","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.3723450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":33,"alternative-id":["10.1145\/3711708.3723450","10.1145\/3711708"],"URL":"https:\/\/doi.org\/10.1145\/3711708.3723450","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"}}]}}