{"id":"https://openalex.org/W3046260980","doi":"https://doi.org/10.1145/3382734.3405711","title":"Exponentially Faster Shortest Paths in the Congested Clique","display_name":"Exponentially Faster Shortest Paths in the Congested Clique","publication_year":2020,"publication_date":"2020-07-31","ids":{"openalex":"https://openalex.org/W3046260980","doi":"https://doi.org/10.1145/3382734.3405711","mag":"3046260980"},"language":"en","primary_location":{"id":"doi:10.1145/3382734.3405711","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382734.3405711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5052412504","display_name":"Michal Dory","orcid":"https://orcid.org/0000-0002-8565-9642"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michal Dory","raw_affiliation_strings":["Technion"],"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022875077","display_name":"Merav Parter","orcid":"https://orcid.org/0000-0002-2357-2445"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Merav Parter","raw_affiliation_strings":["Weizmann Institute"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052412504"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.443,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86202633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983000159263611,"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/clique","display_name":"Clique","score":0.6462727189064026},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6108500361442566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5896353721618652},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5807642340660095},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.5530816912651062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5286802649497986},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45375606417655945},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.42964786291122437},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4268341064453125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4048130214214325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39008256793022156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35740235447883606},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3208520710468292},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29859045147895813},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.16735202074050903}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6462727189064026},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6108500361442566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5896353721618652},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5807642340660095},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.5530816912651062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5286802649497986},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45375606417655945},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.42964786291122437},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4268341064453125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4048130214214325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39008256793022156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35740235447883606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3208520710468292},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29859045147895813},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.16735202074050903},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3382734.3405711","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3382734.3405711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G104975410","display_name":null,"funder_award_id":"755839","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G2733115167","display_name":null,"funder_award_id":"713238","funder_id":"https://openalex.org/F4320320878","funder_display_name":"Minerva Foundation"},{"id":"https://openalex.org/G5147838186","display_name":null,"funder_award_id":"1696/14 and 2084/18","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320878","display_name":"Minerva Foundation","ror":"https://ror.org/02rxjts25"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1863846876","https://openalex.org/W1987099434","https://openalex.org/W1998918799","https://openalex.org/W2002887716","https://openalex.org/W2033698604","https://openalex.org/W2106759055","https://openalex.org/W2156047991","https://openalex.org/W2503099161","https://openalex.org/W2511108295","https://openalex.org/W2948609630","https://openalex.org/W2950813619","https://openalex.org/W2951926403","https://openalex.org/W2962811409","https://openalex.org/W2963015907","https://openalex.org/W2963232515","https://openalex.org/W2963275645","https://openalex.org/W2970898478","https://openalex.org/W2972236337","https://openalex.org/W3002336073","https://openalex.org/W3190236558"],"related_works":["https://openalex.org/W2393848756","https://openalex.org/W2392124159","https://openalex.org/W2094937329","https://openalex.org/W2534159409","https://openalex.org/W2376144198","https://openalex.org/W4390715902","https://openalex.org/W1995738188","https://openalex.org/W2137594557","https://openalex.org/W2899261484","https://openalex.org/W2902010279"],"abstract_inverted_index":{"We":[0,17],"present":[1],"improved":[2],"deterministic":[3],"algorithms":[4,22],"for":[5,23],"approximating":[6],"shortest":[7],"paths":[8],"in":[9,27],"the":[10,24],"Congested":[11],"Cliqe":[12],"model":[13],"of":[14],"distributed":[15],"computing.":[16],"obtain":[18],"poly(log":[19],"log":[20],"n)-round":[21],"following":[25],"problems":[26],"unweighted":[28],"undirected":[29],"n-vertex":[30],"graphs:":[31]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}