{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:54:17Z","timestamp":1765486457753,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400258","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"497-499","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Provable Neuromorphic Advantages for Computing Shortest Paths"],"prefix":"10.1145","author":[{"given":"James B.","family":"Aimone","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Ho","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ojas","family":"Parekh","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia A.","family":"Phillips","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Severa","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yipu","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana-Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding. Frontiers in neuroscience 9","author":"Agarwal S.","year":"2015","unstructured":"Agarwal , S. , Quach , T.-T. , Parekh , O. , Hsia , A. H. , DeBenedictis , E. P. , James , C. D. , Marinella , M. J. , and Aimone , J. B . Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding. Frontiers in neuroscience 9 ( 2015 ). Agarwal, S., Quach, T.-T., Parekh, O., Hsia, A. H., DeBenedictis, E. P., James, C. D., Marinella, M. J., and Aimone, J. B. Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding. Frontiers in neuroscience 9 (2015)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3231589"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3354265.3354285"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/cne.21974"},{"key":"e_1_3_2_1_5_1","volume-title":"On the computational power and complexity of Spiking Neural Networks. arXiv:2001.08439 [cs] (Jan","author":"Kwisthout J.","year":"2020","unstructured":"Kwisthout , J. , and Donselaar , N . On the computational power and complexity of Spiking Neural Networks. arXiv:2001.08439 [cs] (Jan . 2020 ). arXiv: 2001.08439. Kwisthout, J., and Donselaar, N. On the computational power and complexity of Spiking Neural Networks. arXiv:2001.08439 [cs] (Jan. 2020). arXiv: 2001.08439."},{"key":"e_1_3_2_1_6_1","unstructured":"Moore S. Intel's Neuromorphic System Hits 8 Million Neurons 100 Million Coming by 2020 - IEEE Spectrum. https:\/\/spectrum.ieee.org\/tech-talk\/artificial-intelligence\/embedded-ai\/intels-neuromorphic-system-hits-8-million-neurons-100-million-coming-by-2020.  Moore S. Intel's Neuromorphic System Hits 8 Million Neurons 100 Million Coming by 2020 - IEEE Spectrum. https:\/\/spectrum.ieee.org\/tech-talk\/artificial-intelligence\/embedded-ai\/intels-neuromorphic-system-hits-8-million-neurons-100-million-coming-by-2020."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210410"},{"key":"e_1_3_2_1_8_1","volume-title":"A survey of neuromorphic computing and neural networks in hardware. arXiv preprint arXiv:1705.06963","author":"Schuman C. D.","year":"2017","unstructured":"Schuman , C. D. , Potok , T. E. , Patton , R. M. , Birdwell , J. D. , Dean , M. E. , Rose , G. S. , and Plank , J. S . A survey of neuromorphic computing and neural networks in hardware. arXiv preprint arXiv:1705.06963 ( 2017 ). Schuman, C. D., Potok, T. E., Patton, R. M., Birdwell, J. D., Dean, M. E., Rose, G. S., and Plank, J. S. A survey of neuromorphic computing and neural networks in hardware. arXiv preprint arXiv:1705.06963 (2017)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:35Z","timestamp":1750202015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":9,"alternative-id":["10.1145\/3350755.3400258","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400258","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}