{"id":"https://openalex.org/W4399521882","doi":"https://doi.org/10.1145/3618260.3649763","title":"O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set","display_name":"O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399521882","doi":"https://doi.org/10.1145/3618260.3649763"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649763","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649763","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649763","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649763","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060978295","display_name":"Sepehr Assadi","orcid":"https://orcid.org/0009-0006-8914-5995"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["University of Waterloo, Waterloo, Canada / Rutgers University, New Brunswick, USA"],"raw_orcid":"https://orcid.org/0009-0006-8914-5995","affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, Canada / Rutgers University, New Brunswick, USA","institution_ids":["https://openalex.org/I151746483","https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054336577","display_name":"Christian Konrad","orcid":"https://orcid.org/0000-0003-1802-4011"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Christian Konrad","raw_affiliation_strings":["University of Bristol, Bristol, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-1802-4011","affiliations":[{"raw_affiliation_string":"University of Bristol, Bristol, United Kingdom","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040838706","display_name":"Kheeran K. Naidu","orcid":"https://orcid.org/0000-0002-5946-4702"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kheeran K. Naidu","raw_affiliation_strings":["University of Bristol, Bristol, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-5946-4702","affiliations":[{"raw_affiliation_string":"University of Bristol, Bristol, United Kingdom","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014630563","display_name":"Janani Sundaresan","orcid":"https://orcid.org/0009-0003-0511-2124"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Janani Sundaresan","raw_affiliation_strings":["University of Waterloo, Waterloo, Canada"],"raw_orcid":"https://orcid.org/0009-0003-0511-2124","affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9614,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77077928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"847","last_page":"858"},"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.9994000196456909,"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.9988999962806702,"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/streaming-algorithm","display_name":"Streaming algorithm","score":0.7774932384490967},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6032721400260925},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5667876601219177},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5263710618019104},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.525526225566864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5177480578422546},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.48746156692504883},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45763519406318665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44509491324424744},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4398563802242279},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43951475620269775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42629408836364746},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.411588191986084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4012521803379059},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3967214822769165},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3966347277164459},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3872290849685669},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16321006417274475},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11081889271736145}],"concepts":[{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.7774932384490967},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6032721400260925},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5667876601219177},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5263710618019104},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.525526225566864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5177480578422546},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.48746156692504883},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45763519406318665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44509491324424744},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4398563802242279},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43951475620269775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42629408836364746},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.411588191986084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4012521803379059},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3967214822769165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3966347277164459},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3872290849685669},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16321006417274475},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11081889271736145},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3618260.3649763","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649763","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649763","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/4d43c0f8-7efe-4945-af03-b315310d97df","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/4d43c0f8-7efe-4945-af03-b315310d97df","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Assadi, S, Konrad, C, Naidu, K K & Sundaresan, J 2024, O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. in B Mohar, I Shinkar & R O'Donnell (eds), STOC 2024 : Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, ACM SIGGRAPH, pp. 847-858. https://doi.org/10.1145/3618260.3649763","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649763","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649763","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649763","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399521882.pdf"},"referenced_works_count":62,"referenced_works":["https://openalex.org/W230726820","https://openalex.org/W1539682630","https://openalex.org/W1592346261","https://openalex.org/W1957963525","https://openalex.org/W1979790324","https://openalex.org/W2031536548","https://openalex.org/W2032825346","https://openalex.org/W2035836267","https://openalex.org/W2043356449","https://openalex.org/W2064379477","https://openalex.org/W2071114738","https://openalex.org/W2101246692","https://openalex.org/W2107805020","https://openalex.org/W2112009244","https://openalex.org/W2151690061","https://openalex.org/W2153977620","https://openalex.org/W2165753192","https://openalex.org/W2167372977","https://openalex.org/W2186715137","https://openalex.org/W2217939021","https://openalex.org/W2227069303","https://openalex.org/W2258899852","https://openalex.org/W2310290370","https://openalex.org/W2560674852","https://openalex.org/W2560686414","https://openalex.org/W2776603735","https://openalex.org/W2781827254","https://openalex.org/W2788015272","https://openalex.org/W2884132620","https://openalex.org/W2952275559","https://openalex.org/W2952341094","https://openalex.org/W2953264324","https://openalex.org/W2953390354","https://openalex.org/W2963645943","https://openalex.org/W2963813153","https://openalex.org/W3034790637","https://openalex.org/W3091587255","https://openalex.org/W3114238887","https://openalex.org/W3171167615","https://openalex.org/W3181145973","https://openalex.org/W3198988513","https://openalex.org/W3208905081","https://openalex.org/W4206353945","https://openalex.org/W4210631930","https://openalex.org/W4211154544","https://openalex.org/W4235082106","https://openalex.org/W4247950230","https://openalex.org/W4252114072","https://openalex.org/W4252630569","https://openalex.org/W4253069973","https://openalex.org/W4254539327","https://openalex.org/W4313227193","https://openalex.org/W4313227252","https://openalex.org/W4313227581","https://openalex.org/W4316652477","https://openalex.org/W4376651355","https://openalex.org/W4378895326","https://openalex.org/W4386595046","https://openalex.org/W4390098264","https://openalex.org/W4390575680","https://openalex.org/W4390575882","https://openalex.org/W6784125293"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2951231217","https://openalex.org/W4390092937","https://openalex.org/W4300287281","https://openalex.org/W2086366030","https://openalex.org/W4390098099"],"abstract_inverted_index":{"In":[0],"the":[1,14,26,56,74,96,103,110,132,167],"semi-streaming":[2,80,104],"model":[3],"for":[4,38,51,82,131,151],"processing":[5],"massive":[6],"graphs,":[7],"an":[8,84,125],"algorithm":[9,81],"makes":[10],"multiple":[11],"passes":[12,47],"over":[13],"edges":[15],"of":[16,89,98,109,136,141,166,198],"a":[17,29,53,145,170,175,195,214],"given":[18],"n-vertex":[19],"graph":[20,202,217],"and":[21,106,219,228],"is":[22,144],"tasked":[23],"with":[24,86,207,213],"computing":[25],"solution":[27],"to":[28,158,182],"problem":[30,101,168],"using":[31],"O(n":[32],"\u00b7":[33],"log(n))":[34],"space.":[35],"Semi-streaming":[36],"algorithms":[37,76],"Maximal":[39],"Independent":[40],"Set":[41],"(MIS)":[42],"that":[43,73,177],"run":[44],"in":[45,102,116,174],"O(loglogn)":[46],"have":[48],"been":[49],"known":[50],"almost":[52],"decade,":[54],"however,":[55],"best":[57],"lower":[58,114],"bounds":[59,115],"can":[60],"only":[61],"rule":[62],"out":[63],"single-pass":[64],"algorithms.":[65],"We":[66,119],"close":[67],"this":[68,99,117,142],"large":[69],"gap":[70],"by":[71,123],"proving":[72,124],"current":[75],"are":[77,192,220],"optimal:":[78],"Any":[79],"finding":[83],"MIS":[85],"constant":[87],"probability":[88],"success":[90],"requires":[91],"\u03a9(loglogn)":[92],"passes.":[93],"This":[94],"settles":[95],"complexity":[97,135],"fundamental":[100],"model,":[105],"constitutes":[107],"one":[108],"first":[111],"optimal":[112,126],"multi-pass":[113],"model.":[118],"establish":[120],"our":[121],"result":[122,143],"round":[127,153],"vs":[128],"communication":[129,134],"tradeoff":[130],"(multi-party)":[133],"MIS.":[137],"The":[138],"key":[139],"ingredient":[140],"new":[146],"technique,":[147],"called":[148],"hierarchical":[149],"embedding,":[150],"performing":[152],"elimination:":[154],"we":[155],"show":[156],"how":[157],"pack":[159],"many":[160,208],"but":[161],"small":[162],"hard":[163],"(r\u22121)-round":[164,187],"instances":[165,188],"into":[169],"single":[171],"r-round":[172,180],"instance,":[173],"way":[176],"enforces":[178],"any":[179],"protocol":[181],"effectively":[183],"solve":[184],"all":[185],"these":[186],"also.":[189],"These":[190],"embeddings":[191],"obtained":[193],"via":[194,222],"novel":[196],"application":[197],"results":[199],"from":[200],"extremal":[201],"theory\u2014in":[203],"particular":[204],"dense":[205],"graphs":[206],"disjoint":[209],"unique":[210],"shortest":[211],"paths\u2014together":[212],"newly":[215],"designed":[216],"product,":[218],"analyzed":[221],"information-theoretic":[223],"tools":[224],"such":[225],"as":[226],"direct-sum":[227],"message":[229],"compression":[230],"arguments.":[231]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}