{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T18:38:05Z","timestamp":1772303885868,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":85,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":75,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2103483, CCF-2238358, CCF-2339310, IIS-2227669, TI-2346223"],"award-info":[{"award-number":["CCF-2103483, CCF-2238358, CCF-2339310, IIS-2227669, TI-2346223"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UCR Regents Faculty Fellowship"},{"name":"UCR Regents Faculty Development Award"},{"name":"Google Research Scholar Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,8]]},"DOI":"10.1145\/3721145.3725744","type":"proceedings-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T12:57:17Z","timestamp":1755867437000},"page":"670-688","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Contraction Hierarchies Can Be Efficient and Scalable"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6372-0843","authenticated-orcid":false,"given":"Zijin","family":"Wan","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4828-7066","authenticated-orcid":false,"given":"Xiaojun","family":"Dong","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0420-732X","authenticated-orcid":false,"given":"Letong","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7796-7431","authenticated-orcid":false,"given":"Enzuo","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4392-4022","authenticated-orcid":false,"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3212-0934","authenticated-orcid":false,"given":"Yihan","family":"Sun","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Tenindra Abeywickrama Muhammad\u00a0Aamir Cheema and David Taniar. 2016. k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation. Proceedings of the VLDB Endowment (PVLDB) 9 6 (2016).","DOI":"10.14778\/2904121.2904125"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.64"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.14"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"crossref","unstructured":"Nimar\u00a0S Arora Robert\u00a0D Blumofe and C\u00a0Greg Plaxton. 2001. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems (TOCS) 34 2 (2001) 115\u2013144.","DOI":"10.1007\/s00224-001-0004-z"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_7"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Hannah Bast Daniel Delling Andrew Goldberg Matthias M\u00fc\u00a0ller Hannemann Thomas Pajor Peter Sanders Dorothea Wagner and Renato\u00a0F Werneck. 2016. Route planning in transportation networks. Algorithm engineering: Selected results and surveys (2016) 19\u201380.","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Hannah Bast Stefan Funke and Domagoj Matijevic. 2006. Ultrafast Shortest-Path Queries via Transit Nodes. The Shortest Path Problem 74 (2006) 175\u2013192.","DOI":"10.1090\/dimacs\/074\/07"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Holger Bast Stefan Funke Peter Sanders and Dominik Schultes. 2007. Fast routing in road networks with transit nodes. Science 316 5824 (2007) 566\u2013566.","DOI":"10.1126\/science.1137521"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_15"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"crossref","unstructured":"G\u00a0Veit Batz Robert Geisberger Peter Sanders and Christian Vetter. 2013. Minimum time-dependent travel times with contraction hierarchies. Journal of Experimental Algorithmics (JEA) 18 (2013) 1\u20131.","DOI":"10.1145\/2444016.2444020"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Reinhard Bauer Daniel Delling Peter Sanders Dennis Schieferdecker Dominik Schultes and Dorothea Wagner. 2010. Combining hierarchical and goal-directed speed-up techniques for dijkstra\u2019s algorithm. Journal of Experimental Algorithmics (JEA) 15 (2010) 2\u20131.","DOI":"10.1145\/1671970.1671976"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935767"},{"key":"e_1_3_3_1_17_2","first-page":"507","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"Blelloch Guy\u00a0E.","year":"2020","unstructured":"Guy\u00a0E. Blelloch, Daniel Anderson, and Laxman Dhulipala. 2020. ParlayLib \u2014 a toolkit for parallel algorithms on shared-memory multicore machines. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 507\u2013509."},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977042.16"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400227"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Johannes Blum Stefan Funke and Sabine Storandt. 2021. Sublinear search spaces for shortest path planning in grid and road networks. Journal of Combinatorial Optimization 42 2 (2021) 231\u2013257.","DOI":"10.1007\/s10878-021-00777-3"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0D. Blumofe and Charles\u00a0E. Leiserson. 1999. Scheduling multithreaded computations by work stealing. J. ACM 46 5 (1999) 720\u2013748.","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Stefan B\u00fchler and Andr\u00e9 Nusser. 2024. Contraction Hierarchies Constructor. 10.5281\/zenodo.14008202","DOI":"10.5281\/zenodo.14008202"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Zi Chen Xinyu Ji Long Yuan Xuemin Lin Wenjie Zhang and Shan Huang. 2024. Parallel Contraction Hierarchies Construction on Road Networks. IEEE Transactions on Knowledge and Data Engineering (2024).","DOI":"10.1109\/TKDE.2024.3437243"},{"key":"e_1_3_3_1_25_2","unstructured":"Tobias Columbus and Reinhard Bauer. 2009. On the complexity of contraction hierarchies. Student Thesis Karlsruhe Inst. Technol. Karlsruhe Germany (2009)."},{"key":"e_1_3_3_1_26_2","unstructured":"RoutingKit contributors. 2024. RoutingKit. https:\/\/github.com\/RoutingKit\/RoutingKit."},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Daniel Delling Andrew\u00a0V Goldberg Andreas Nowatzyk and Renato\u00a0F Werneck. 2013. PHAST: Hardware-accelerated shortest path trees. J. Parallel and Distrib. Comput. 73 7 (2013) 940\u2013952.","DOI":"10.1016\/j.jpdc.2012.02.007"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"crossref","unstructured":"Daniel Delling Andrew\u00a0V Goldberg Thomas Pajor and Renato\u00a0F Werneck. 2017. Customizable route planning in road networks. Transportation Science 51 2 (2017) 566\u2013591.","DOI":"10.1287\/trsc.2014.0579"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_4"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"Laxman Dhulipala Guy\u00a0E. Blelloch and Julian Shun. 2021. Theoretically efficient parallel graph algorithms can be fast and scalable. ACM Transactions on Parallel Computing (TOPC) 8 1 (2021) 1\u201370.","DOI":"10.1145\/3434393"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659973"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Julian Dibbelt Ben Strasser and Dorothea Wagner. 2016. Customizable contraction hierarchies. J. Experimental Algorithmics 21 (2016) 1\u201349.","DOI":"10.1145\/2886843"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"crossref","unstructured":"Edsger\u00a0W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1 1 (1959).","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638483"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3660258"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461782"},{"key":"e_1_3_3_1_37_2","first-page":"52","volume-title":"ACM Symposium on Principles and Practice of Parallel Programming (PPOPP)","author":"Dong Xiaojun","year":"2023","unstructured":"Xiaojun Dong, Letong Wang, Yan Gu, and Yihan Sun. 2023. Provably Fast and Space-Efficient Parallel Biconnectivity. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 52\u201365."},{"key":"e_1_3_3_1_38_2","doi-asserted-by":"crossref","unstructured":"Jordi Fonollosa Sadique Sheik Ram\u00f3n Huerta and Santiago Marco. 2015. Reservoir computing compensates slow response of chemosensor arrays exposed to fast varying gas concentrations in continuous monitoring. Sensors and Actuators B: Chemical 215 (2015) 618\u2013629.","DOI":"10.1016\/j.snb.2015.03.028"},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"crossref","unstructured":"Stefan Funke Andr\u00e9 Nusser and Sabine Storandt. 2015. Placement of loading stations for electric vehicles: No detours necessary! Journal of Artificial Intelligence Research 53 (2015) 633\u2013658.","DOI":"10.1613\/jair.4688"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340964.3340978"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48971-0_41"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"e_1_3_3_1_43_2","doi-asserted-by":"crossref","unstructured":"Robert Geisberger Peter Sanders Dominik Schultes and Christian Vetter. 2012. Exact routing in large road networks using contraction hierarchies. Transportation Science 46 3 (2012) 388\u2013404.","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_3_1_44_2","first-page":"156","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Goldberg Andrew\u00a0V","year":"2005","unstructured":"Andrew\u00a0V Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In ACM-SIAM Symposium on Discrete Algorithms (SODA) , Vol.\u00a05. 156\u2013165."},{"key":"e_1_3_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00345"},{"key":"e_1_3_3_1_46_2","unstructured":"KIT ITI\u00a0Algorithmics Group. 2024. PHAST. https:\/\/github.com\/kit-algo\/ULTRA-PHAST."},{"key":"e_1_3_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591069"},{"key":"e_1_3_3_1_48_2","doi-asserted-by":"crossref","unstructured":"Michael Hamann and Ben Strasser. 2018. Graph bisection with pareto optimization. J. Experimental Algorithmics 23 (2018) 1\u201334.","DOI":"10.1145\/3173045"},{"key":"e_1_3_3_1_49_2","volume-title":"Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS)","author":"Hespe Demian","year":"2019","unstructured":"Demian Hespe and Peter Sanders. 2019. More Hierarchy in Route Planning Using Edge Hierarchies. In Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS)."},{"key":"e_1_3_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00038"},{"key":"e_1_3_3_1_51_2","doi-asserted-by":"crossref","unstructured":"Ramon Huerta Thiago Mosqueiro Jordi Fonollosa Nikolai\u00a0F Rulkov and Irene Rodriguez-Lujan. 2016. Online decorrelation of humidity and temperature in chemical sensors for continuous monitoring. Chemometrics and Intelligent Laboratory Systems 157 (2016) 169\u2013176.","DOI":"10.1016\/j.chemolab.2016.07.004"},{"key":"e_1_3_3_1_52_2","unstructured":"Intel Threading Building Blocks [n. d.]. Intel Threading Building Blocks (TBB). https:\/\/www.threadingbuildingblocks.org."},{"key":"e_1_3_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3330345.3330368"},{"key":"e_1_3_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286141"},{"key":"e_1_3_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_8"},{"key":"e_1_3_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"e_1_3_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407822"},{"key":"e_1_3_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"e_1_3_3_1_59_2","unstructured":"Youzhe Liu Xiaojun Dong Yan Gu and Yihan Sun. 2025. Parallel k-Core Decomposition: Theory and Practice. ACM SIGMOD International Conference on Management of Data (SIGMOD) 3 3 (2025)."},{"key":"e_1_3_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094062"},{"key":"e_1_3_3_1_61_2","unstructured":"Dennis Luxen and Christian Vetter. 2024. Open Source Routing Machine. https:\/\/github.com\/Project-OSRM\/osrm-backend."},{"key":"e_1_3_3_1_62_2","unstructured":"Amgad Madkour Walid\u00a0G Aref Faizan\u00a0Ur Rehman Mohamed\u00a0Abdur Rahman and Saleh Basalamah. 2017. A survey of shortest-path algorithms. arXiv preprint:1705.02044 (2017)."},{"key":"e_1_3_3_1_63_2","doi-asserted-by":"crossref","unstructured":"Ulrich Meyer and Peter Sanders. 2003. \u0394 -stepping: a parallelizable shortest path algorithm. Journal of Algorithms 49 1 (2003) 114\u2013152.","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_3_1_64_2","unstructured":"OpenCilk 2020. OpenCilk. https:\/\/www.opencilk.org\/."},{"key":"e_1_3_3_1_65_2","unstructured":"OpenStreetMap contributors. 2010. OpenStreetMap. https:\/\/www.openstreetmap.org\/."},{"key":"e_1_3_3_1_66_2","doi-asserted-by":"crossref","unstructured":"Dian Ouyang Long Yuan Lu Qin Lijun Chang Ying Zhang and Xuemin Lin. 2020. Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees. Proceedings of the VLDB Endowment (PVLDB) 13 5 (2020) 602\u2013615.","DOI":"10.14778\/3377369.3377371"},{"key":"e_1_3_3_1_67_2","unstructured":"Yu-Xuan Qiu Dong Wen Lu Qin Wentao Li Rong-Hua Li Zhang Ying et\u00a0al. 2022. Efficient shortest path counting on large road networks. Proceedings of the VLDB Endowment (PVLDB) (2022)."},{"key":"e_1_3_3_1_68_2","doi-asserted-by":"crossref","unstructured":"Naroa\u00a0Coretti Sanchez I\u00f1igo Martinez Luis\u00a0Alonso Pastor and Kent Larson. 2022. On the simulation of shared autonomous micro-mobility. Communications in Transportation Research 2 (2022) 100065.","DOI":"10.1016\/j.commtr.2022.100065"},{"key":"e_1_3_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_71"},{"key":"e_1_3_3_1_70_2","doi-asserted-by":"crossref","unstructured":"Peter Sanders Christian Schulz and Dorothea Wagner. 2014. Benchmarking for graph clustering and partitioning. Encyclopedia of social network analysis and mining Springer (2014).","DOI":"10.1007\/978-1-4614-6170-8_23"},{"key":"e_1_3_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"e_1_3_3_1_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538574"},{"key":"e_1_3_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612687"},{"key":"e_1_3_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722159"},{"key":"e_1_3_3_1_75_2","doi-asserted-by":"crossref","unstructured":"Christian Sommer. 2014. Shortest-path queries in static networks. ACM Computing Surveys (CSUR) 46 4 (2014) 1\u201331.","DOI":"10.1145\/2530531"},{"key":"e_1_3_3_1_76_2","doi-asserted-by":"crossref","unstructured":"William\u00a0F Tinney and John\u00a0W Walker. 1967. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55 11 (1967) 1801\u20131809.","DOI":"10.1109\/PROC.1967.6011"},{"key":"e_1_3_3_1_77_2","unstructured":"Christian Vetter. 2009. Parallel time-dependent contraction hierarchies. Student Research Project (2009) 134."},{"key":"e_1_3_3_1_78_2","unstructured":"Zijin Wan Xiaojun Dong Letong Wang Enzuo Zhu Yan Gu and Yihan Sun. 2024. Implementations for Parallel Contraction Hierarchies. https:\/\/github.com\/ucrparlay\/Parallel-Contraction-Hierarchy."},{"key":"e_1_3_3_1_79_2","doi-asserted-by":"crossref","unstructured":"Letong Wang Xiaojun Dong Yan Gu and Yihan Sun. 2023. Parallel Strong Connectivity Based on Faster Reachability. ACM SIGMOD International Conference on Management of Data (SIGMOD) 1 2 (2023) 1\u201329.","DOI":"10.1145\/3589259"},{"key":"e_1_3_3_1_80_2","doi-asserted-by":"crossref","unstructured":"Yiqiu Wang Shangdi Yu Laxman Dhulipala Yan Gu and Julian Shun. 2021. GeoGraph: A Framework for Graph Processing on Geometric Data. ACM SIGOPS Operating Systems Review 55 1 (2021) 38\u201346.","DOI":"10.1145\/3469379.3469384"},{"key":"e_1_3_3_1_81_2","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665859"},{"key":"e_1_3_3_1_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389735"},{"key":"e_1_3_3_1_83_2","doi-asserted-by":"crossref","unstructured":"Junhua Zhang Wentao Li Long Yuan Lu Qin Ying Zhang and Lijun Chang. 2022. Shortest-path queries on complex networks: experiments analyses and improvement. Proceedings of the VLDB Endowment (PVLDB) 15 11 (2022) 2640\u20132652.","DOI":"10.14778\/3551793.3551820"},{"key":"e_1_3_3_1_84_2","doi-asserted-by":"crossref","unstructured":"U Zhang Long Yuan Wentao Li Lu Qin and Ying Zhang. 2021. Efficient label-constrained shortest path queries on road networks: A tree decomposition approach. Proceedings of the VLDB Endowment (PVLDB) (2021).","DOI":"10.14778\/3494124.3494148"},{"key":"e_1_3_3_1_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389737"},{"key":"e_1_3_3_1_86_2","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367532"}],"event":{"name":"ICS '25: 2025 International Conference on Supercomputing","location":"Salt Lake City USA","acronym":"ICS '25","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 39th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3721145.3725744","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3721145.3725744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:03:29Z","timestamp":1755867809000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3721145.3725744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,8]]},"references-count":85,"alternative-id":["10.1145\/3721145.3725744","10.1145\/3721145"],"URL":"https:\/\/doi.org\/10.1145\/3721145.3725744","relation":{},"subject":[],"published":{"date-parts":[[2025,6,8]]},"assertion":[{"value":"2025-08-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}