{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T06:00:29Z","timestamp":1780639229380,"version":"3.54.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T00:00:00Z","timestamp":1776643200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T00:00:00Z","timestamp":1776643200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,4,20]]},"DOI":"10.23919\/date69613.2026.11539323","type":"proceedings-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:53:10Z","timestamp":1780602790000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs"],"prefix":"10.23919","author":[{"given":"Yanru","family":"Chen","sequence":"first","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheyu","family":"Li","sequence":"additional","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keming","family":"Fan","sequence":"additional","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Runyang","family":"Tian","sequence":"additional","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Hsu","sequence":"additional","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weihong","family":"Xu","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique Fédérale de Lausanne,Lausanne,Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minxuan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology,Chicago,IL,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tajana","family":"Rosing","sequence":"additional","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"issue":"2","key":"ref1","first-page":"44","article-title":"Comparison of the dijkstra\u2019s algorithm and the floyd-warshall\u2019s algorithm to determine the shortest path between hospitals in several cities in lampung province","volume":"1","author":"Putriani","year":"2024","journal-title":"Journal of Mathematical Sciences and Optimization"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106647"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2024.02.163"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2021.3071609"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3544585.3544600"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3128571"},{"key":"ref9","article-title":"Gpu architectures in graph analytics: A comparative experimental study","author":"Xie","year":"2025"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.06.008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3431379.3460651"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3577193.3593728"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00052"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.54"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2872887.2750386"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3451214"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00053"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2017.51"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358256"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12112426"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IMW61990.2025.11026972"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-024-07230-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-42792-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2070050"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240811"},{"key":"ref27","first-page":"586","article-title":"36.1 a 32gb\/s 10.5 tb\/s\/mm 0.6 pj\/b ucie-compliant low-latency interface in 3nm featuring matched-delay for dynamic clock gating","volume":"68","author":"Lin","year":"2025","journal-title":"ISSCC"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3390\/electronics13020316"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IEDM50854.2024.10873526"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3007787.3001139"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"issue":"290-297","key":"ref33","first-page":"18","article-title":"On random graphs i","volume":"6","year":"1959","journal-title":"Publ. math. debrecen"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.46471\/gigabyte.37"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS57955.2024.00064"},{"issue":"11","key":"ref36","first-page":"2306","article-title":"Dnn+ neurosim v2. 0: An end-to-end benchmarking framework for compute-in-memory accelerators for on-chip training","author":"Xiaochen","year":"2020","journal-title":"TCAD"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2017.02.002"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3620665.3640422"}],"event":{"name":"2026 Design, Automation & Test in Europe Conference (DATE)","location":"Verona, Italy","start":{"date-parts":[[2026,4,20]]},"end":{"date-parts":[[2026,4,22]]}},"container-title":["2026 Design, Automation & Test in Europe Conference (DATE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11539023\/11539024\/11539323.pdf?arnumber=11539323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:07:26Z","timestamp":1780636046000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11539323\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,20]]},"references-count":38,"URL":"https:\/\/doi.org\/10.23919\/date69613.2026.11539323","relation":{},"subject":[],"published":{"date-parts":[[2026,4,20]]}}}