{"id":"https://openalex.org/W4393142241","doi":"https://doi.org/10.1137/22m1536972","title":"Rounds vs. Communication Tradeoffs for Maximal Independent Sets","display_name":"Rounds vs. Communication Tradeoffs for Maximal Independent Sets","publication_year":2024,"publication_date":"2024-03-25","ids":{"openalex":"https://openalex.org/W4393142241","doi":"https://doi.org/10.1137/22m1536972"},"language":"en","primary_location":{"id":"doi:10.1137/22m1536972","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1536972","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/A5060978295","display_name":"Sepehr Assadi","orcid":"https://orcid.org/0009-0006-8914-5995"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1 Canada, and Department of Computer Science, Rutgers University, Piscataway, NJ 08854 USA"],"affiliations":[{"raw_affiliation_string":"Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1 Canada, and Department of Computer Science, Rutgers University, Piscataway, NJ 08854 USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050781652","display_name":"Gillat Kol","orcid":"https://orcid.org/0009-0007-4725-6694"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gillat Kol","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ 08540 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ 08540 USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100388926","display_name":"Zhijun Zhang","orcid":"https://orcid.org/0000-0002-9674-1246"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhijun Zhang","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ 08540 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ 08540 USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060978295"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04763088,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"54","issue":"5","first_page":"FOCS22","last_page":"20"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994000196456909,"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/combinatorics","display_name":"Combinatorics","score":0.487004816532135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42671117186546326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41886937618255615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34737342596054077},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33224883675575256}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.487004816532135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42671117186546326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41886937618255615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34737342596054077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33224883675575256}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/22m1536972","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1536972","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G463163403","display_name":null,"funder_award_id":"CCF-2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4674974867","display_name":null,"funder_award_id":"2018325","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational Science Foundation"},{"id":"https://openalex.org/G8721280526","display_name":null,"funder_award_id":"CCF-1750443","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"},{"id":"https://openalex.org/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320322676","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1836916015","https://openalex.org/W1957963525","https://openalex.org/W2068115726","https://openalex.org/W2100061495","https://openalex.org/W2310290370","https://openalex.org/W2406213739","https://openalex.org/W2478708596","https://openalex.org/W2568091325","https://openalex.org/W2591972614","https://openalex.org/W2790833064","https://openalex.org/W2908664940","https://openalex.org/W3031228796"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{".We":[0],"consider":[1],"the":[2,12,35,77,84,87,103,124,175,183,197,219,232,267,271,310,333],"problem":[3,89,111,222,336],"of":[4,27,79,83,141,177,182,189,223,229,273,312,320],"finding":[5,160],"a":[6,69,120,205,237,250,286],"maximal":[7,224],"independent":[8,345],"set":[9],"(MIS)":[10],"in":[11,61,93,131,199,234,256,266,301,309,337],"shared":[13,54,70,99,313],"blackboard":[14,71,100],"communication":[15,276,343],"model":[16,236,258],"with":[17,76,157,174,204],"vertex-partitioned":[18],"inputs.":[19,314],"There":[20],"are":[21,143,247],"\\(n\\)":[22],"players":[23,59],"corresponding":[24],"to":[25,73,150,218,280,323],"vertices":[26],"an":[28,81,129,161,209],"undirected":[29],"graph,":[30],"and":[31,51,97,240,332],"each":[32,43],"player":[33,148],"sees":[34],"edges":[36],"incident":[37],"on":[38,68,123,187],"its":[39,49],"vertex;":[40],"this":[41,132,245,257,264],"way,":[42],"edge":[44],"is":[45,52,90,259],"known":[46,114],"by":[47,55,64],"both":[48],"endpoints":[50],"thus":[53],"two":[56],"players.":[57],"The":[58,227],"communicate":[60,151],"simultaneous":[62],"rounds":[63,140,202],"posting":[65],"their":[66],"messages":[67],"visible":[72],"all":[74],"players,":[75],"goal":[78],"computing":[80,128],"MIS":[82,88,130,162,198],"graph.":[85],"While":[86],"well":[91],"studied":[92],"other":[94],"distributed":[95,326],"models":[96],"while":[98],"is,":[101],"perhaps,":[102],"simplest":[104],"broadcast":[105,329],"model,":[106],"lower":[107,121,169,214,254,307],"bounds":[108,255,308],"for":[109,127,208,304],"our":[110,213,235,282,321],"were":[112],"only":[113],"against":[115],"one-round":[116],"protocols.":[117],"We":[118],"present":[119],"bound":[122,170,215],"round-communication":[125],"tradeoff":[126],"model.":[133],"Specifically,":[134],"we":[135,284,292,316],"show":[136],"that,":[137],"when":[138],"\\(r\\)":[139],"interaction":[142],"allowed,":[144],"at":[145],"least":[146],"one":[147],"needs":[149],"\\(\\Omega":[152,164],"(n^{1/{20}^{r+1}})\\)":[153],"bits.":[154],"In":[155],"particular,":[156],"logarithmic":[158,206],"bandwidth,":[159],"requires":[163],"(\\log":[165],"\\log{n})\\)":[166,201],"rounds.":[167],"This":[168],"can":[171],"be":[172,299],"compared":[173],"algorithm":[176],"Ghaffari":[178],"et":[179],"al.":[180],"[Proceedings":[181],"2018":[184],"ACM":[185],"Symposium":[186],"Principles":[188],"Distributed":[190],"Computing,":[191],"2018,":[192],"pp.":[193],"129\u2013138]":[194],"that":[195,296],"solves":[196],"\\(O(\\log":[200],"but":[203],"bandwidth":[207],"average":[210],"player.":[211],"Additionally,":[212],"further":[216],"extends":[217],"closely":[220],"related":[221],"bipartite":[225],"matching.":[226],"presence":[228,311],"edge-sharing":[230],"gives":[231],"algorithms":[233],"surprising":[238],"power,":[239],"numerous":[241],"algorithmic":[242],"results":[243,322],"exploiting":[244],"power":[246],"known.":[248],"For":[249],"similar":[251],"reason,":[252],"proving":[253,305],"much":[260],"more":[261],"challenging":[262],"because":[263],"sharing":[265],"players'":[268],"inputs":[269],"prohibits":[270],"use":[272],"standard":[274],"number-in-hand":[275],"complexity":[277],"arguments.":[278],"Thus,":[279],"prove":[281],"results,":[283],"devise":[285],"new":[287],"round":[288],"elimination":[289],"framework,":[290],"which":[291],"call":[293],"partial-input":[294],"embedding,":[295],"may":[297],"also":[298],"useful":[300],"future":[302],"work":[303],"round-sensitive":[306],"Finally,":[315],"discuss":[317],"several":[318],"implications":[319],"multiround":[324],"(adaptive)":[325],"sketching":[327],"algorithms,":[328],"congested":[330],"clique,":[331],"welfare":[334],"maximization":[335],"two-sided":[338],"matching":[339],"markets.Keywordscommunication":[340],"complexityround":[341],"vs.":[342],"tradeoffmaximal":[344],"setmaximal":[346],"matchingdistributed":[347],"sketchinground":[348],"eliminationMSC":[349],"codes68Q1168Q1768R10":[350]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}