{"id":"https://openalex.org/W2963245981","doi":"https://doi.org/10.1145/3212734.3212773","title":"A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in \u00d5(n 3/2 ) Rounds","display_name":"A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in \u00d5(n 3/2 ) Rounds","publication_year":2018,"publication_date":"2018-07-23","ids":{"openalex":"https://openalex.org/W2963245981","doi":"https://doi.org/10.1145/3212734.3212773","mag":"2963245981"},"language":"en","primary_location":{"id":"doi:10.1145/3212734.3212773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212773","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212773","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","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/3212734.3212773","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067669150","display_name":"Udit Agarwal","orcid":"https://orcid.org/0009-0007-2446-1310"},"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":"Udit Agarwal","raw_affiliation_strings":["University of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","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":["University of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110426531","display_name":"Valerie King","orcid":"https://orcid.org/0000-0001-5138-6925"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Valerie King","raw_affiliation_strings":["University of Victoria, Victoria, BC, Canada"],"affiliations":[{"raw_affiliation_string":"University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085978350","display_name":"Matteo Pontecorvi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210149358","display_name":"Nokia (France)","ror":"https://ror.org/04kwfkk85","country_code":"FR","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210149358"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Matteo Pontecorvi","raw_affiliation_strings":["Nokia Bell Labs, Nozay, France"],"affiliations":[{"raw_affiliation_string":"Nokia Bell Labs, Nozay, France","institution_ids":["https://openalex.org/I4210149358"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5067669150"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":5.3435,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.9648591,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"199","last_page":"205"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991000294685364,"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/T10237","display_name":"Cryptography and Data Security","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/distributed-algorithm","display_name":"Distributed algorithm","score":0.6947599649429321},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6234274506568909},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5857897400856018},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.546891987323761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5312599539756775},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5202940106391907},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5157971382141113},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43823808431625366},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4370206594467163},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4244697690010071},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4190674126148224},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.41323086619377136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2722737193107605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26926949620246887},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.16154533624649048},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.09762904047966003}],"concepts":[{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6947599649429321},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6234274506568909},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5857897400856018},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.546891987323761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5312599539756775},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5202940106391907},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5157971382141113},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43823808431625366},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4370206594467163},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4244697690010071},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4190674126148224},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.41323086619377136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2722737193107605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26926949620246887},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.16154533624649048},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.09762904047966003},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3212734.3212773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212773","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212773","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3212734.3212773","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212773","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212773","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2128170445","display_name":null,"funder_award_id":"CCF-1320675","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3259719953","display_name":"AF: Small: Theoretical Frameworks for Modern Parallel Computing Environments","funder_award_id":"1320675","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"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963245981.pdf","grobid_xml":"https://content.openalex.org/works/W2963245981.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W147275194","https://openalex.org/W816673839","https://openalex.org/W1534484868","https://openalex.org/W1554407673","https://openalex.org/W1568961751","https://openalex.org/W1582638066","https://openalex.org/W1945440063","https://openalex.org/W2026798971","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2048098617","https://openalex.org/W2075862701","https://openalex.org/W2077371116","https://openalex.org/W2107282727","https://openalex.org/W2163097371","https://openalex.org/W2227557434","https://openalex.org/W2592613193","https://openalex.org/W2884021615","https://openalex.org/W2952490263","https://openalex.org/W2963528540","https://openalex.org/W2963618817","https://openalex.org/W4205300528"],"related_works":["https://openalex.org/W4312179669","https://openalex.org/W2081843224","https://openalex.org/W1595159684","https://openalex.org/W4282828042","https://openalex.org/W2361081252","https://openalex.org/W4230539132","https://openalex.org/W3114387617","https://openalex.org/W4212781261","https://openalex.org/W2151715608","https://openalex.org/W2963245981"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,62,70],"deterministic":[3,47,63],"distributed":[4,48,64],"algorithm":[5,20,49,56,65],"to":[6],"compute":[7],"all-pairs":[8],"shortest":[9],"paths":[10],"(APSP)":[11],"in":[12,22,27,38,79],"an":[13],"edge-weighted":[14],"directed":[15],"or":[16],"undirected":[17],"graph.":[18,40],"Our":[19,55],"runs":[21],"\u00d5":[23],"(n^3/2":[24],")":[25],"rounds":[26,46],"the":[28,34,39,43,51],"Congest":[29],"model,":[30],"where":[31],"n":[32],"is":[33,42,57],"number":[35],"of":[36,83],"nodes":[37],"This":[41],"first":[44],"o(n^2)":[45],"for":[50,68],"weighted":[52],"APSP":[53],"problem.":[54],"fairly":[58],"simple":[59],"and":[60],"incorporates":[61],"we":[66],"develop":[67],"computing":[69],"'blocker":[71],"set'":[72],"[King99],":[73],"which":[74],"has":[75],"been":[76],"used":[77],"earlier":[78],"sequential":[80],"dynamic":[81],"computation":[82],"APSP.":[84]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}