{"id":"https://openalex.org/W7138394921","doi":"https://doi.org/10.1007/s00446-025-00503-w","title":"Constant-round spanners and shortest paths in congested clique and MPC","display_name":"Constant-round spanners and shortest paths in congested clique and MPC","publication_year":2026,"publication_date":"2026-03-18","ids":{"openalex":"https://openalex.org/W7138394921","doi":"https://doi.org/10.1007/s00446-025-00503-w"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-025-00503-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-025-00503-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00446-025-00503-w.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00446-025-00503-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052412504","display_name":"Michal Dory","orcid":"https://orcid.org/0000-0002-8565-9642"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michal Dory","raw_affiliation_strings":["University of Haifa, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023036907","display_name":"Orr Fischer","orcid":"https://orcid.org/0009-0007-4197-015X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Orr Fischer","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, Israel"],"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129654850","display_name":"Seri Khoury","orcid":null},"institutions":[{"id":"https://openalex.org/I58918642","display_name":"Sofia University \"St. Kliment Ohridski\"","ror":"https://ror.org/02jv3k292","country_code":"BG","type":"education","lineage":["https://openalex.org/I58918642"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Seri Khoury","raw_affiliation_strings":["INSAIT, Sofia University \u201cSt. Kliment Ohridski\u201d, Sofia, Bulgaria"],"affiliations":[{"raw_affiliation_string":"INSAIT, Sofia University \u201cSt. Kliment Ohridski\u201d, Sofia, Bulgaria","institution_ids":["https://openalex.org/I58918642"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009353788","display_name":"Dean Leitersdorf","orcid":"https://orcid.org/0000-0002-2775-9207"},"institutions":[{"id":"https://openalex.org/I4210121891","display_name":"Iscar (Israel)","ror":"https://ror.org/02bgv4w08","country_code":"IL","type":"company","lineage":["https://openalex.org/I4210121891"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dean Leitersdorf","raw_affiliation_strings":["Decart, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Decart, Tel Aviv, Israel","institution_ids":["https://openalex.org/I4210121891"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5052412504"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2490,"currency":"EUR","value_usd":3090},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71698914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"2","first_page":null,"last_page":null},"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.8388000130653381,"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.8388000130653381,"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.039900001138448715,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.02290000021457672,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5946999788284302},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5421000123023987},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.49070000648498535},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4894999861717224},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4641999900341034},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4374000132083893},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42160001397132874},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.40470001101493835},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.3871000111103058},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.37700000405311584}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6195999979972839},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5946999788284302},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5421000123023987},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.49070000648498535},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4894999861717224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4814000129699707},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4641999900341034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4571000039577484},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4374000132083893},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42160001397132874},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.40470001101493835},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.3871000111103058},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.37700000405311584},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36570000648498535},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.3400000035762787},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3287999927997589},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.32690000534057617},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.32280001044273376},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3215999901294708},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.31679999828338623},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.29089999198913574},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.28760001063346863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28459998965263367},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.2524999976158142},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.25220000743865967},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00446-025-00503-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-025-00503-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00446-025-00503-w.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00446-025-00503-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-025-00503-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00446-025-00503-w.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323387","display_name":"University of Haifa","ror":"https://ror.org/02f009v59"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7138394921.pdf","grobid_xml":"https://content.openalex.org/works/W7138394921.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1564010364","https://openalex.org/W1863846876","https://openalex.org/W1966206200","https://openalex.org/W1987669032","https://openalex.org/W2002041206","https://openalex.org/W2005580106","https://openalex.org/W2006786627","https://openalex.org/W2018963243","https://openalex.org/W2033607935","https://openalex.org/W2037793233","https://openalex.org/W2044246186","https://openalex.org/W2054910423","https://openalex.org/W2057994027","https://openalex.org/W2063860324","https://openalex.org/W2066811549","https://openalex.org/W2077059864","https://openalex.org/W2091569826","https://openalex.org/W2100830825","https://openalex.org/W2122632420","https://openalex.org/W2139065307","https://openalex.org/W2147599477","https://openalex.org/W2152383935","https://openalex.org/W2157760787","https://openalex.org/W2511108295","https://openalex.org/W2900806478","https://openalex.org/W2936941051","https://openalex.org/W2948609630","https://openalex.org/W2950813619","https://openalex.org/W2963015907","https://openalex.org/W2963232515","https://openalex.org/W2963738383","https://openalex.org/W2964107726","https://openalex.org/W2972236337","https://openalex.org/W2988246677","https://openalex.org/W3046133410","https://openalex.org/W3046260980","https://openalex.org/W3170394705","https://openalex.org/W3173744973","https://openalex.org/W4205300528","https://openalex.org/W4213146104","https://openalex.org/W4231761369","https://openalex.org/W4245082111","https://openalex.org/W4286503967","https://openalex.org/W4286504510","https://openalex.org/W4399338214","https://openalex.org/W4399377376"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,121,186],"work":[3],"we":[4,26],"present":[5],"the":[6,20,28,111,139,159,174],"first":[7,175],"constant-round":[8],"algorithms":[9,45,99,113,141,178],"for":[10,31,46,75,79,88,92,114,142,179],"computing":[11,115],"spanners":[12,180],"and":[13,58,102,138,181],"approximate":[14,143,182],"All-Pairs":[15],"Shortest":[16],"Paths":[17],"(APSP)":[18],"in":[19,55,68,81,94,120,185],"distributed":[21],"Congested":[22],"Clique":[23],"model.":[24],"Specifically,":[25],"show":[27],"following":[29],"results":[30,156],"undirected":[32],"n":[33],"-node":[34],"graphs.":[35,70,83,96],"For":[36],"every":[37],"integer":[38],"$$k":[39],"\\ge":[40],"1$$":[41],",":[42],"O":[43,48,59,72,85,116,176],"(1)-round":[44,73,86,177],"constructing":[47],"(":[49,60,117],"k":[50,61,118],")-spanners":[51,62,119],"with":[52,63,104,167],"$$O(n^{1+1/k})$$":[53],"edges":[54,67],"unweighted":[56,82],"graphs,":[57],"$$O(n^{1+1/k}":[64],"\\log":[65],"{n})$$":[66,77],"weighted":[69,95],"An":[71,84],"algorithm":[74,87],"$$O(\\log":[76,89],"-approximation":[78,91],"APSP":[80,93],"^2{n})$$":[90],"All":[97],"our":[98,109],"are":[100],"randomized":[101],"succeed":[103],"high":[105],"probability.":[106],"Prior":[107],"to":[108,158,173],"work,":[110],"fastest":[112,140],"model":[122,166,187],"require":[123,146],"$${{\\,\\textrm{poly}\\,}}(\\log":[124,147],"{k})$$":[125],"rounds":[126,150],"[Parter,":[127],"Yogev,":[128],"DISC":[129],"\u201918]":[130],"[Biswas,":[131],"Dory,":[132],"Ghaffari,":[133],"Mitrovic,":[134],"Nazari,":[135],"SPAA":[136],"\u201921],":[137],"shortest":[144,183],"paths":[145,184],"{\\log":[148],"{n}})$$":[149],"[Dory,":[151],"Parter,":[152],"PODC":[153],"\u201920].":[154],"Our":[155],"extend":[157],"closely":[160],"related":[161],"massively":[162],"parallel":[163],"computation":[164],"(MPC)":[165],"near-linear":[168],"memory":[169],"per":[170],"machine,":[171],"leading":[172],"as":[188],"well.":[189]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-03-18T00:00:00"}