{"id":"https://openalex.org/W3010101273","doi":"https://doi.org/10.1145/3409964.3461784","title":"Massively Parallel Algorithms for Distance Approximation and Spanners","display_name":"Massively Parallel Algorithms for Distance Approximation and Spanners","publication_year":2021,"publication_date":"2021-06-30","ids":{"openalex":"https://openalex.org/W3010101273","doi":"https://doi.org/10.1145/3409964.3461784","mag":"3010101273"},"language":"en","primary_location":{"id":"doi:10.1145/3409964.3461784","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3409964.3461784","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3409964.3461784","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3409964.3461784","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078726206","display_name":"Amartya Shankha Biswas","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amartya Shankha Biswas","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology Cambridge, MA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052412504","display_name":"Michal Dory","orcid":"https://orcid.org/0000-0002-8565-9642"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Michal Dory","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland","ETH Zurich Zurich Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH Zurich Zurich Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland","ETH Zurich Zurich Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"ETH Zurich Zurich Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021154381","display_name":"Slobodan Mitrovi\u0107","orcid":"https://orcid.org/0000-0002-8571-0970"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology Cambridge, MA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]},{"id":"https://openalex.org/I2799853436","display_name":"Johns Hopkins Medicine","ror":"https://ror.org/037zgn354","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I2799853436"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yasamin Nazari","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA","Johns Hopkins Univ., Baltimore, MD (USA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]},{"raw_affiliation_string":"Johns Hopkins Univ., Baltimore, MD (USA)","institution_ids":["https://openalex.org/I145311948","https://openalex.org/I2799853436"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4075,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.41070715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"128"},"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.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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.9988999962806702,"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/sublinear-function","display_name":"Sublinear function","score":0.7172595262527466},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7013235092163086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6373683214187622},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.6072065234184265},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5961356163024902},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49009716510772705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47748395800590515},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.47335219383239746},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.451654314994812},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44411787390708923},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.42547959089279175},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4026861786842346},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.400858610868454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2618284821510315},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.12284097075462341}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7172595262527466},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7013235092163086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6373683214187622},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.6072065234184265},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5961356163024902},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49009716510772705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47748395800590515},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.47335219383239746},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.451654314994812},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44411787390708923},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.42547959089279175},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4026861786842346},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.400858610868454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2618284821510315},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.12284097075462341},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3409964.3461784","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3409964.3461784","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3409964.3461784","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2003.01254","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2003.01254","pdf_url":"https://arxiv.org/pdf/2003.01254","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/145969","is_oa":false,"landing_page_url":"https://hdl.handle.net/1721.1/145969","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures CD-ROM","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"doi:10.48550/arxiv.2003.01254","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2003.01254","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:3010101273","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3409964.3461784","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3409964.3461784","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3409964.3461784","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5075395233","display_name":"AitF: Collaborative Research: Fast, Accurate, and Practical: Adaptive Sublinear Algorithms for Scalable Visualization","funder_award_id":"1733808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5270222991","display_name":"BIGDATA: F: Testing High Dimensional Distributions without the Curse of Dimensionality","funder_award_id":"1741137","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5649436383","display_name":null,"funder_award_id":"No. 853109","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3010101273.pdf","grobid_xml":"https://content.openalex.org/works/W3010101273.grobid-xml"},"referenced_works_count":64,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1568961751","https://openalex.org/W1592346261","https://openalex.org/W1598064945","https://openalex.org/W1863846876","https://openalex.org/W1969080501","https://openalex.org/W2008199814","https://openalex.org/W2037793233","https://openalex.org/W2044112344","https://openalex.org/W2051586153","https://openalex.org/W2057082426","https://openalex.org/W2066811549","https://openalex.org/W2071346873","https://openalex.org/W2085630237","https://openalex.org/W2100830825","https://openalex.org/W2107600509","https://openalex.org/W2137373960","https://openalex.org/W2139535340","https://openalex.org/W2153977620","https://openalex.org/W2173213060","https://openalex.org/W2189465200","https://openalex.org/W2464065967","https://openalex.org/W2626928698","https://openalex.org/W2734687249","https://openalex.org/W2755229948","https://openalex.org/W2767578875","https://openalex.org/W2788015272","https://openalex.org/W2807926398","https://openalex.org/W2884132620","https://openalex.org/W2888820341","https://openalex.org/W2898896159","https://openalex.org/W2902652525","https://openalex.org/W2943788922","https://openalex.org/W2945994473","https://openalex.org/W2949524113","https://openalex.org/W2951940772","https://openalex.org/W2952539154","https://openalex.org/W2962677563","https://openalex.org/W2962710457","https://openalex.org/W2963005538","https://openalex.org/W2963015907","https://openalex.org/W2963298291","https://openalex.org/W2963629655","https://openalex.org/W2963813153","https://openalex.org/W2964082996","https://openalex.org/W2964084763","https://openalex.org/W2964294252","https://openalex.org/W2965287070","https://openalex.org/W2971407628","https://openalex.org/W2971736579","https://openalex.org/W2972236337","https://openalex.org/W3000941460","https://openalex.org/W3013722846","https://openalex.org/W3034415339","https://openalex.org/W3034669632","https://openalex.org/W3034790637","https://openalex.org/W3034903651","https://openalex.org/W3046133410","https://openalex.org/W3046260980","https://openalex.org/W3046888255","https://openalex.org/W3117630603","https://openalex.org/W4231761369","https://openalex.org/W4245082111","https://openalex.org/W4253069973"],"related_works":["https://openalex.org/W3173744973","https://openalex.org/W2963629655","https://openalex.org/W2884132620","https://openalex.org/W2971736579","https://openalex.org/W3196118890","https://openalex.org/W2962677563","https://openalex.org/W2044112344","https://openalex.org/W3046763033","https://openalex.org/W2767578875","https://openalex.org/W3022033828","https://openalex.org/W2898896159","https://openalex.org/W2884459710","https://openalex.org/W2040011014","https://openalex.org/W2964294252","https://openalex.org/W2888511752","https://openalex.org/W2147916494","https://openalex.org/W2065159944","https://openalex.org/W2963650008","https://openalex.org/W3094575411","https://openalex.org/W2153507546"],"abstract_inverted_index":{"Over":[0],"the":[1,38,94,102,109],"past":[2],"decade,":[3],"there":[4],"has":[5],"been":[6],"increasing":[7],"interest":[8],"in":[9,37,61,93],"distributed/parallel":[10],"algorithms":[11,88,113],"for":[12,89,114],"processing":[13],"large-scale":[14,67],"graphs.":[15],"By":[16],"now,":[17],"we":[18,79],"have":[19],"quite":[20],"fast":[21],"algorithms---usually":[22],"sublogarithmic-time":[23,111],"and":[24],"often":[25],"poly(\u0142og\u0142og":[26,84],"n)-time,":[27],"or":[28],"even":[29],"faster---for":[30],"a":[31,47,56],"number":[32,57],"of":[33,51,58,73,98,104],"fundamental":[34],"graph":[35,77],"problems":[36],"massively":[39],"parallel":[40],"computation":[41],"(MPC)":[42],"model.":[43],"This":[44],"model":[45],"is":[46],"widely-adopted":[48],"theoretical":[49],"abstraction":[50],"MapReduce":[52],"style":[53],"settings,":[54],"where":[55],"machines":[59],"communicate":[60],"an":[62],"all-to-all":[63],"manner":[64],"to":[65,70],"process":[66],"data.":[68],"Contributing":[69],"this":[71],"line":[72],"work":[74],"on":[75],"MPC":[76,87,112],"algorithms,":[78],"present":[80],"poly(\u0142og":[81],"k)":[82],"\u03b5":[83],"n)":[85],"round":[86],"computing":[90],"O(k^1+o(1)":[91],")-spanners":[92],"strongly":[95],"sublinear":[96],"regime":[97],"local":[99],"memory.":[100],"To":[101],"best":[103],"our":[105],"knowledge,":[106],"these":[107],"are":[108],"first":[110],"spanner":[115],"construction.":[116]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2025-10-10T00:00:00"}