{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:46Z","timestamp":1777954606753,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","funder":[{"name":"NSF","award":["CCF-2008241"],"award-info":[{"award-number":["CCF-2008241"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743333","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"628-632","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0561-8558","authenticated-orcid":false,"given":"Vignesh","family":"Manoharan","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7561-5235","authenticated-orcid":false,"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222017"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009. ACM","author":"Bernstein Aaron","unstructured":"Aaron Bernstein and David R. Karger. 2009. A nearly optimal oracle for avoiding failed vertices and edges. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009. ACM, Bethesda, MD, USA, 101--110."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. SIAM","author":"Cao Nairen","unstructured":"Nairen Cao and Jeremy T. Fineman. 2023. Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. SIAM, Florence, Italy, 4354--4372."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705429847"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.17"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0888"},{"key":"e_1_3_2_1_7_1","volume-title":"32nd International Colloquium, SIROCCO 2025, Proceedings (LNCS","volume":"383","author":"Manoharan Vignesh","year":"2025","unstructured":"Vignesh Manoharan and Vijaya Ramachandran. 2025. Distributed Distance Sensitivity Oracles. In Structural Information and Communication Complexity - 32nd International Colloquium, SIROCCO 2025, Proceedings (LNCS, Vol. 15671). Springer, Delphi, Greece, 366--383."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2021.08.005"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2438645.2438646"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:18:37Z","timestamp":1777922317000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":9,"alternative-id":["10.1145\/3694906.3743333","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743333","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}