{"id":"https://openalex.org/W3041142425","doi":"https://doi.org/10.1145/3350755.3400222","title":"Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths","display_name":"Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3041142425","doi":"https://doi.org/10.1145/3350755.3400222","mag":"3041142425"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400222","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400222","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400222","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd 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/3350755.3400222","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030710270","display_name":"Nairen Cao","orcid":"https://orcid.org/0000-0002-4961-763X"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nairen Cao","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022670058","display_name":"Katina Russell","orcid":"https://orcid.org/0009-0005-6230-8427"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Katina Russell","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030710270"],"corresponding_institution_ids":["https://openalex.org/I184565670"],"apc_list":null,"apc_paid":null,"fwci":0.7225,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76725399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"511","last_page":"513"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/reachability","display_name":"Reachability","score":0.9427787065505981},{"id":"https://openalex.org/keywords/span","display_name":"Span (engineering)","score":0.8228373527526855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5784198045730591},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.5524080991744995},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.502112865447998},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3821946084499359},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3059003949165344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1606282889842987},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07562384009361267}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9427787065505981},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.8228373527526855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5784198045730591},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.5524080991744995},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.502112865447998},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3821946084499359},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3059003949165344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1606282889842987},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07562384009361267},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3350755.3400222","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400222","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400222","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3350755.3400222","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400222","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400222","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G7681175234","display_name":null,"funder_award_id":"CCF-1918989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8051948103","display_name":"SPX: Automatically Parallelizing Approximate Data Analysis with Mergeable Summaries","funder_award_id":"1918989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G826657743","display_name":null,"funder_award_id":"CCF-1718700, CCF-1918989","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8543173072","display_name":"AF: Small: Algorithms for New Memory Models","funder_award_id":"1718700","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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3041142425.pdf","grobid_xml":"https://content.openalex.org/works/W3041142425.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1986816824","https://openalex.org/W2056496054","https://openalex.org/W2075862701","https://openalex.org/W2964070308","https://openalex.org/W2972207998","https://openalex.org/W2996098186"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W2772294324","https://openalex.org/W4253760428","https://openalex.org/W2047831585"],"abstract_inverted_index":{"This":[0],"brief":[1],"announcement":[2],"presents":[3],"parallel":[4],"algorithms":[5,25],"with":[6],"a":[7],"tradeoff":[8],"between":[9],"work":[10,30],"and":[11,17,31],"span":[12,35],"for":[13,36],"single":[14],"source":[15],"reachability":[16],"approximate":[18],"shortest":[19],"paths":[20],"on":[21],"directed":[22],"graphs.":[23],"Both":[24],"have":[26],"~O(m\u03c12":[27],"+":[28],"n\u03c14)":[29],"achieve":[32],"n1/2+":[33],"o(1)/\u03c1":[34],"all":[37],"\u03c1":[38],"\u2208":[39],"[1,\u221an].":[40]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}