{"id":"https://openalex.org/W4412480921","doi":"https://doi.org/10.1145/3694906.3743333","title":"Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM","display_name":"Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412480921","doi":"https://doi.org/10.1145/3694906.3743333"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743333","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743333","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743333","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743333","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051616462","display_name":"Vignesh Manoharan","orcid":"https://orcid.org/0000-0003-0561-8558"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vignesh Manoharan","raw_affiliation_strings":["The University of Texas at Austin, Austin, TX, USA"],"raw_orcid":"https://orcid.org/0000-0003-0561-8558","affiliations":[{"raw_affiliation_string":"The University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101698836","display_name":"Vijaya Ramachandran","orcid":"https://orcid.org/0000-0001-7561-5235"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijaya Ramachandran","raw_affiliation_strings":["The University of Texas at Austin, Austin, TX, USA"],"raw_orcid":"https://orcid.org/0000-0001-7561-5235","affiliations":[{"raw_affiliation_string":"The University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051616462"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19377464,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"628","last_page":"632"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6876596808433533},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.6873670816421509},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5017099380493164},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38588958978652954},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06634458899497986}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6876596808433533},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.6873670816421509},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5017099380493164},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38588958978652954},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06634458899497986},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743333","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743333","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743333","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743333","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743333","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743333","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2812707083","display_name":null,"funder_award_id":"CCF-2008241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6177743983","display_name":"CCF: AF: Small: Algorithms, Parallelism and Communication Efficiency in Shortest Path Computations","funder_award_id":"2008241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412480921.pdf","grobid_xml":"https://content.openalex.org/works/W4412480921.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1963633992","https://openalex.org/W1989169588","https://openalex.org/W2056496054","https://openalex.org/W2092901467","https://openalex.org/W3196355459","https://openalex.org/W4231170555"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"The":[0],"distance":[1,33],"sensitivity":[2],"oracle":[3],"(DSO)":[4],"problem":[5,51],"asks":[6],"us":[7],"to":[8,19,39,83,95],"preprocess":[9],"a":[10,105,111],"given":[11],"graph":[12],"G":[13,35],"=":[14],"(V,":[15],"E)":[16],"in":[17,34,61,71,98,107],"order":[18],"answer":[20,104],"queries":[21],"of":[22],"the":[23,30,62,72,84,91],"form":[24],"d(x,":[25],"y,":[26],"e),":[27],"which":[28],"denotes":[29],"shortest":[31],"path":[32],"from":[36],"vertex":[37,40],"x":[38],"y":[41],"when":[42],"edge":[43],"e":[44],"is":[45,48],"removed.":[46],"This":[47],"an":[49],"important":[50],"for":[52],"network":[53],"communication,":[54],"and":[55,69],"it":[56],"has":[57],"been":[58],"extensively":[59],"studied":[60],"sequential":[63],"setting":[64,86],"[2,":[65],"4,":[66],"8,":[67],"9]":[68],"recently":[70],"distributed":[73],"CONGEST":[74],"model":[75],"[7].":[76],"However,":[77],"no":[78],"prior":[79],"DSO":[80],"results":[81],"tailored":[82],"parallel":[85],"were":[87],"known.":[88],"We":[89],"present":[90],"first":[92],"PRAM":[93],"algorithms":[94],"construct":[96],"DSOs":[97],"directed":[99],"weighted":[100],"graphs,":[101],"that":[102],"can":[103],"query":[106],"O(1)":[108],"time":[109],"with":[110],"single":[112],"processor":[113],"after":[114],"preprocessing.":[115]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}