{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:10:07Z","timestamp":1765545007988,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"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.3723449","type":"proceedings-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T12:33:27Z","timestamp":1746189207000},"page":"28-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimized Parallel Breadth-First Search with Adaptive Strategies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7559-0626","authenticated-orcid":false,"given":"Chaoqun","family":"Li","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-0005-0901-530X","authenticated-orcid":false,"given":"Runbang","family":"Hu","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, NJ, 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\/3477141"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01170006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/702694"},{"key":"e_1_3_2_1_4_1","unstructured":"OpenMP Architecture Review Board. 2018. OpenMP API specification for parallel programming. https:\/\/www.openmp.org. Accessed: 2025-02-03."},{"volume-title":"Proceedings of RAID.","author":"Bowman Benjamin","key":"e_1_3_2_1_5_1","unstructured":"Benjamin Bowman, Craig Laprade, Yuede Ji, and H. Howie Huang. 2020. Detecting Lateral Movement in Enterprise Computer Networks with Unsupervised Graph AI. In Proceedings of RAID."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584053"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063471"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tsep.2018.04.004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598054"},{"key":"e_1_3_2_1_10_1","volume-title":"9th DIMACS Challenge on Shortest Paths","author":"Delling Daniel","year":"2006","unstructured":"Daniel Delling, Martin Holzer, Kirill M\u00fcller, Frank Schulz, and Dorothea Wagner. 2006. High-performance multi-level graphs. 9th DIMACS Challenge on Shortest Paths (2006), 1--13."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607110"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307681.3326606"},{"volume-title":"Illuminati: Towards Explaining Graph Neural Networks for Cybersecurity Analysis. In IEEE European Symposium on Security and Privacy (EuroS&P).","author":"He Haoyu","key":"e_1_3_2_1_13_1","unstructured":"Haoyu He, Yuede Ji, and H. Howie Huang. 2022. Illuminati: Towards Explaining Graph Neural Networks for Cybersecurity Analysis. In IEEE European Symposium on Security and Privacy (EuroS&P)."},{"key":"e_1_3_2_1_14_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_15_1","volume-title":"Structured pruning for deep convolutional neural networks: A survey","author":"He Yang","year":"2023","unstructured":"Yang He and Lingao Xiao. 2023. Structured pruning for deep convolutional neural networks: A survey. IEEE transactions on pattern analysis and machine intelligence (2023)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503246"},{"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_17_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_18_1","volume-title":"Vestige: Identifying Binary Code Provenance for Vulnerability Detection. In International Conference on Applied Cryptography and Network Security (ACNS). Springer, 287--310","author":"Ji Yuede","year":"2021","unstructured":"Yuede Ji, Lei Cui, and H Howie Huang. 2021. Vestige: Identifying Binary Code Provenance for Vulnerability Detection. In International Conference on Applied Cryptography and Network Security (ACNS). Springer, 287--310."},{"key":"e_1_3_2_1_19_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)."},{"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_20_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":"NestedGNN: Detecting Malicious Network Activity with Nested Graph Neural Networks. In IEEE International Conference on Communications (ICC).","author":"Ji Yuede","key":"e_1_3_2_1_21_1","unstructured":"Yuede Ji and H. Howie Huang. 2022. NestedGNN: Detecting Malicious Network Activity with Nested Graph Neural Networks. In IEEE International Conference on Communications (ICC)."},{"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_22_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_23_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."},{"key":"e_1_3_2_1_24_1","volume-title":"Fast and efficient parallel breadth-first search with power-law graph transformation. arXiv preprint arXiv:2012.10026","author":"Jiang Zite","year":"2020","unstructured":"Zite Jiang, Tao Liu, Shuai Zhang, Zhen Guan, Mengting Yuan, and Haihang You. 2020. Fast and efficient parallel breadth-first search with power-law graph transformation. arXiv preprint arXiv:2012.10026 (2020)."},{"key":"e_1_3_2_1_25_1","volume-title":"Comparative analysis of various web crawler algorithms. arXiv preprint arXiv:2306.12027","author":"Nithin T K","year":"2023","unstructured":"Nithin T K, Chandana S, Barani G, Chavva Dharani, and M S Karishma. 2023. Comparative analysis of various web crawler algorithms. arXiv preprint arXiv:2306.12027 (2023)."},{"key":"e_1_3_2_1_26_1","volume-title":"The Art of Computer Programming, Volume 1: Fundamental Algorithms","author":"Knuth Donald E.","unstructured":"Donald E. Knuth. 1974. The Art of Computer Programming, Volume 1: Fundamental Algorithms (2nd ed.). Addison-Wesley.","edition":"2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882959"},{"key":"e_1_3_2_1_28_1","unstructured":"J. S. Plank and N. Zeldovich. 2019. OpenCilk: A parallel programming model for efficient scalable execution. https:\/\/www.opencilk.org. Accessed: 2025-02-03."},{"key":"e_1_3_2_1_29_1","volume-title":"Social network analysis: developments, advances, and prospects. Social network analysis and mining 1","author":"Scott John","year":"2011","unstructured":"John Scott. 2011. Social network analysis: developments, advances, and prospects. Social network analysis and mining 1 (2011), 21--26."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.64"},{"key":"e_1_3_2_1_31_1","unstructured":"Speedcode. [n. d.]. Speedcode. https:\/\/speedcode.org\/"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Pauli Virtanen Ralf Gommers Travis E Oliphant Matt Haberland Tyler Reddy David Cournapeau Evgeni Burovski Pearu Peterson Warren Weckesser Jonathan Bright et al. 2020. SciPy 1.0: fundamental algorithms for scientific computing in Python. Nature methods 17 3 (2020) 261--272.","DOI":"10.1038\/s41592-020-0772-5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3378111"}],"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.3723449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711708.3723449","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711708.3723449","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.3723449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":33,"alternative-id":["10.1145\/3711708.3723449","10.1145\/3711708"],"URL":"https:\/\/doi.org\/10.1145\/3711708.3723449","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"}}]}}