{"id":"https://openalex.org/W4387973450","doi":"https://doi.org/10.1137/22m1520177","title":"Deterministic Massively Parallel Connectivity","display_name":"Deterministic Massively Parallel Connectivity","publication_year":2023,"publication_date":"2023-10-27","ids":{"openalex":"https://openalex.org/W4387973450","doi":"https://doi.org/10.1137/22m1520177"},"language":"en","primary_location":{"id":"doi:10.1137/22m1520177","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1520177","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5011279372","display_name":"Sam Coy","orcid":"https://orcid.org/0000-0001-8500-8690"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sam Coy","raw_affiliation_strings":["Department of Computer Science and Centre for Discrete Mathematics and Its Applications, University of Warwick, Coventry CV4 7AL, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Centre for Discrete Mathematics and Its Applications, University of Warwick, Coventry CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051815913","display_name":"Artur Czumaj","orcid":"https://orcid.org/0000-0002-7743-438X"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Artur Czumaj","raw_affiliation_strings":["Department of Computer Science and Centre for Discrete Mathematics and Its Applications, University of Warwick, Coventry CV4 7AL, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Centre for Discrete Mathematics and Its Applications, University of Warwick, Coventry CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011279372"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":0.4041,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66266124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"52","issue":"5","first_page":"1269","last_page":"1318"},"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/T12288","display_name":"Optimization and Search Problems","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5780251026153564},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5610954761505127},{"id":"https://openalex.org/keywords/massively-parallel","display_name":"Massively parallel","score":0.5463767647743225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.528476357460022},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.4868675768375397},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4723445177078247},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4597248435020447},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4380660057067871},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4270828366279602},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4180889129638672},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37943610548973083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3639148473739624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36335012316703796},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2566835284233093}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5780251026153564},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5610954761505127},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.5463767647743225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.528476357460022},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4868675768375397},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4723445177078247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4597248435020447},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4380660057067871},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4270828366279602},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4180889129638672},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37943610548973083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3639148473739624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36335012316703796},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2566835284233093},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/22m1520177","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1520177","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:180842","is_oa":false,"landing_page_url":"https://wrap.warwick.ac.uk/180842/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2774561655","display_name":null,"funder_award_id":"EP/V01305X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3988182707","display_name":"Theoretical Foundations of Modern Parallel and Distributed Algorithms","funder_award_id":"EP/V01305X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7238040094","display_name":null,"funder_award_id":"663281","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"}],"funders":[{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320307762","display_name":"International Business Machines Corporation","ror":"https://ror.org/05hh8d621"},{"id":"https://openalex.org/F4320315026","display_name":"Weizmann UK","ror":null},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320336287","display_name":"Centre for Discrete Mathematics and its Applications, University of Warwick","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1809690300","https://openalex.org/W1863846876","https://openalex.org/W1964089073","https://openalex.org/W1967680338","https://openalex.org/W1982618872","https://openalex.org/W1994423049","https://openalex.org/W2008120342","https://openalex.org/W2019038806","https://openalex.org/W2019807548","https://openalex.org/W2032821770","https://openalex.org/W2052207834","https://openalex.org/W2057128446","https://openalex.org/W2063844956","https://openalex.org/W2100061495","https://openalex.org/W2118288908","https://openalex.org/W2155086352","https://openalex.org/W2163137752","https://openalex.org/W2173213060","https://openalex.org/W2765269579","https://openalex.org/W2902899861","https://openalex.org/W3011766368","https://openalex.org/W3017383812","https://openalex.org/W4231916799","https://openalex.org/W4239429564"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2113623403","https://openalex.org/W1862126075","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W2109630252","https://openalex.org/W2113270940","https://openalex.org/W78560857","https://openalex.org/W2521054645"],"abstract_inverted_index":{".We":[0],"consider":[1,47],"the":[2,10,20,37,48,78,83,148,199,205,226,233,255],"problem":[3,21],"of":[4,12,40,80,143,151,198,207,248,258],"designing":[5],"fundamental":[6],"graph":[7,25,100],"algorithms":[8,122,210],"on":[9,132,147,158,228,232],"model":[11],"massively":[13,114],"parallel":[14,115,120,270],"computation":[15],"(MPC).":[16],"The":[17],"input":[18,200],"to":[19,57],"is":[22,77],"an":[23,65,133,229],"undirected":[24],"\\(G\\)":[26],"with":[27,34,50,72,89,135],"\\(n\\)":[28],"vertices":[29],"and":[30,33,71,107,110],"\\(m\\)":[31],"edges":[32],"\\(D\\)":[35],"being":[36],"maximum":[38],"diameter":[39,104],"any":[41],"connected":[42,141,196],"component":[43],"in":[44,102,124,187],"\\(G\\).":[45],"We":[46,177,214],"MPC":[49,134,181,230,252],"low":[51,136,182],"local":[52,84,137,183],"space,":[53],"allowing":[54],"each":[55],"machine":[56],"store":[58],"only":[59],"\\(\\Theta":[60],"(n^{\\delta":[61],"})\\)":[62],"words":[63],"for":[64,174,211,225,254],"arbitrary":[66],"constant":[67],"\\(\\delta":[68],"\\gt":[69],"0\\)":[70],"linear":[73],"global":[74],"space":[75,85,138,184],"(which":[76,236],"number":[79],"machines":[81],"times":[82],"available),":[86],"that":[87,123,166,186],"is,":[88],"optimal":[90],"utilization.":[91],"In":[92,161],"a":[93,144,179,221,244,261],"recent":[94,222],"breakthrough,":[95],"Andoni":[96],"et":[97],"al.":[98],"[Parallel":[99],"connectivity":[101,227],"log":[103],"rounds,":[105],"2018]":[106],"Behnezhad,":[108],"Hajiaghayi,":[109],"Harris":[111],"[Exponentially":[112],"faster":[113],"maximal":[116],"matching,":[117],"2019]":[118],"designed":[119],"randomized":[121,209],"\\(O(\\log":[125,152,188],"D":[126,189],"+":[127,190],"\\log":[128,129,191,192],"n)\\)":[130,153,193],"rounds":[131,194,253],"determine":[139],"all":[140],"components":[142,197],"graph,":[145],"improving":[146],"classic":[149],"bound":[150,224],"derived":[154],"from":[155],"earlier":[156],"works":[157],"PRAM":[159],"algorithms.":[160],"this":[162,212],"paper,":[163],"we":[164],"show":[165],"asymptotically":[167],"identical":[168],"bounds":[169,218],"can":[170],"be":[171],"also":[172],"achieved":[173],"deterministic":[175,180],"algorithms:":[176],"present":[178],"algorithm":[185],"determines":[195],"graph.":[201],"Our":[202],"result":[203],"matches":[204],"complexity":[206],"state-of-the-art":[208],"task.":[213],"complement":[215],"our":[216],"upper":[217],"by":[219,242],"extending":[220],"lower":[223],"conditioned":[231],"1-vs-2-cycles":[234],"conjecture":[235],"requires":[237],"\\(D":[238,266],"\\ge":[239],"\\log^{1+\\Omega":[240],"(1)}n\\))":[241],"showing":[243],"related":[245],"conditional":[246],"hardness":[247],"\\(\\Omega":[249],"(\\log":[250],"D)\\)":[251],"entire":[256],"spectrum":[257],"\\(D\\),":[259],"covering":[260],"particularly":[262],"interesting":[263],"range":[264],"when":[265],"\\le":[267],"O(\\log":[268],"n)\\).KeywordsderandomizationconnectivityMapReduceMPCmassively":[269],"algorithmsMSC":[271],"codes68W1005C4068R1005C85":[272]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-02-24T19:35:01.260952","created_date":"2025-10-10T00:00:00"}