{"id":"https://openalex.org/W3216768296","doi":"https://doi.org/10.1137/20m1312782","title":"Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time","display_name":"Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time","publication_year":2021,"publication_date":"2021-11-23","ids":{"openalex":"https://openalex.org/W3216768296","doi":"https://doi.org/10.1137/20m1312782","mag":"3216768296"},"language":"en","primary_location":{"id":"doi:10.1137/20m1312782","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312782","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033889707","display_name":"Aaron Bernstein","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aaron Bernstein","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4468-2675","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033889707"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21698113,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"52","issue":"2","first_page":"STOC19","last_page":"112"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9986000061035156,"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.6212007403373718},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5282133221626282},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4815831184387207},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4795674681663513},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.45299506187438965},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4196412265300751},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41114991903305054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3952085077762604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30437415838241577},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28085821866989136},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.1637740135192871}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6212007403373718},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5282133221626282},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4815831184387207},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4795674681663513},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.45299506187438965},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4196412265300751},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41114991903305054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3952085077762604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30437415838241577},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28085821866989136},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.1637740135192871}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1312782","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1312782","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.75,"id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G737535551","display_name":null,"funder_award_id":"2015-04659","funder_id":"https://openalex.org/F4320321033","funder_display_name":"Svenska Forskningsr\u00e5det Formas"},{"id":"https://openalex.org/G7895858154","display_name":null,"funder_award_id":"715672","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320321033","display_name":"Svenska Forskningsr\u00e5det Formas","ror":"https://ror.org/03pjs1y45"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W147275194","https://openalex.org/W816673839","https://openalex.org/W1497938971","https://openalex.org/W1534484868","https://openalex.org/W1984090926","https://openalex.org/W1993913882","https://openalex.org/W2006444174","https://openalex.org/W2015819397","https://openalex.org/W2022980325","https://openalex.org/W2026798971","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2045446569","https://openalex.org/W2048098617","https://openalex.org/W2058191123","https://openalex.org/W2075862701","https://openalex.org/W2083323175","https://openalex.org/W2101014999","https://openalex.org/W2107008873","https://openalex.org/W2107282727","https://openalex.org/W2112702616","https://openalex.org/W2116055396","https://openalex.org/W2121852952","https://openalex.org/W2163097371","https://openalex.org/W2227557434","https://openalex.org/W2511108295","https://openalex.org/W2592613193","https://openalex.org/W2952490263","https://openalex.org/W2963420932","https://openalex.org/W2964031269","https://openalex.org/W3041120191","https://openalex.org/W4205300528","https://openalex.org/W4256354285"],"related_works":["https://openalex.org/W1588423764","https://openalex.org/W4306705875","https://openalex.org/W2124626211","https://openalex.org/W2043605126","https://openalex.org/W2082298232","https://openalex.org/W4287990679","https://openalex.org/W3109004708","https://openalex.org/W2489430093","https://openalex.org/W2023126570","https://openalex.org/W1975344016"],"abstract_inverted_index":{"Related":[0],"DatabasesWeb":[1],"of":[2],"Science":[3],"You":[4],"must":[5],"be":[6],"logged":[7],"in":[8],"with":[9],"an":[10],"active":[11],"subscription":[12],"to":[13],"view":[14],"this.Article":[15],"DataHistorySubmitted:":[16],"16":[17],"January":[18],"2020Accepted:":[19],"19":[20],"July":[21],"2021Published":[22],"online:":[23],"23":[24],"November":[25],"2021Keywordsdistributed":[26],"algorithms,":[27],"CONGEST,":[28],"all-pairs":[29],"shortest":[30],"paths,":[31],"graph":[32],"algorithmsAMS":[33],"Subject":[34],"Headings68W15,":[35],"05C85,":[36],"05C12Publication":[37],"DataISSN":[38],"(print):":[39],"0097-5397ISSN":[40],"(online):":[41],"1095-7111Publisher:":[42],"Society":[43],"for":[44],"Industrial":[45],"and":[46],"Applied":[47],"MathematicsCODEN:":[48],"smjcat":[49]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}