{"id":"https://openalex.org/W3183981481","doi":"https://doi.org/10.1145/3465084.3467951","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3183981481","doi":"https://doi.org/10.1145/3465084.3467951","mag":"3183981481"},"language":"en","primary_location":{"id":"doi:10.1145/3465084.3467951","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM 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/A5071016611","display_name":"Moses Charikar","orcid":"https://orcid.org/0000-0003-0807-3389"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Moses Charikar","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114148703","display_name":"Weiyun Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weiyun Ma","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029451171","display_name":"Li-Yang Tan","orcid":"https://orcid.org/0000-0002-1279-4384"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li-Yang Tan","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071016611"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.1515,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51668813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"431","last_page":"433"},"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"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/binary-logarithm","display_name":"Binary logarithm","score":0.8102193474769592},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.7442739009857178},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7078478336334229},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6800665855407715},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6556002497673035},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6020435094833374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4933861792087555},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4505029320716858},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4164830446243286},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.406823992729187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36565178632736206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.330543577671051},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07580459117889404}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.8102193474769592},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7442739009857178},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7078478336334229},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6800665855407715},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6556002497673035},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6020435094833374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4933861792087555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4505029320716858},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4164830446243286},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.406823992729187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36565178632736206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.330543577671051},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07580459117889404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3465084.3467951","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3465084.3467951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1992470151","https://openalex.org/W1998918799","https://openalex.org/W1999779303","https://openalex.org/W2017290750","https://openalex.org/W2023915883","https://openalex.org/W2029782085","https://openalex.org/W2051586153","https://openalex.org/W2076688599","https://openalex.org/W2765269579","https://openalex.org/W2802632688","https://openalex.org/W2960354271","https://openalex.org/W2963662927","https://openalex.org/W2964294252","https://openalex.org/W2971736579","https://openalex.org/W2972260066","https://openalex.org/W2998466234","https://openalex.org/W3008717952","https://openalex.org/W3022033828","https://openalex.org/W3022417154","https://openalex.org/W3034790637","https://openalex.org/W3041032015","https://openalex.org/W3046763033","https://openalex.org/W3104611438"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W1968512104","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,50,96],"randomness-efficient":[3],"Massively":[4],"Parallel":[5],"Computation":[6],"(MPC)":[7],"algorithm":[8,37,94,107,125],"for":[9],"deciding":[10],"whether":[11],"an":[12],"undirected":[13],"graph":[14],"is":[15,82],"connected.":[16],"For":[17],"Connectivity":[18],"on":[19],"n-vertex,":[20],"m-edge":[21],"graphs":[22],"whose":[23],"components":[24],"have":[25],"diameter":[26],"at":[27,73],"most":[28],"D":[29,43],"=":[30,41],"2o(log":[31],"n/":[32],"log":[33,34,45,79],"n),":[35],"our":[36],"runs":[38],"in":[39,86,99],"R":[40],"O(log":[42],"+":[44],"logm/n,.n)":[46],"rounds":[47],"and":[48,59,89,114],"uses":[49,138],"total":[51,140],"of":[52,108,133],"(log":[53],"n)O(R)":[54],"random":[55],"bits,":[56],"O(m)":[57],"machines,":[58],"n1-\u03a9(1)":[60],"space":[61],"per":[62],"machine":[63],"with":[64,71],"good":[65,68],"probability.1":[66],"With":[67],"probability":[69,72],"means":[70],"least":[74],"1":[75],"-":[76],"1/poly":[77],"((m":[78],"n)/n),":[80],"which":[81],"the":[83,105,115,127],"same":[84,128],"as":[85,102,131],"Liu,":[87],"Tarjan,":[88],"Zhong":[90],"(SPAA":[91],"'20).":[92],"Our":[93,124],"achieves":[95],"super-polynomial":[97],"saving":[98],"randomness":[100],"complexity":[101,130],"compared":[103],"to":[104],"breakthrough":[106],"Andoni":[109],"et":[110,120,135],"al.":[111,121],"(FOCS":[112,122],"'18)":[113],"subsequent":[116],"improvement":[117],"by":[118],"Behnezhad":[119,134],"'19).":[123],"has":[126],"round":[129],"that":[132],"al.,":[136],"but":[137],"more":[139],"space.":[141]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2021-08-02T00:00:00"}