{"id":"https://openalex.org/W4376639586","doi":"https://doi.org/10.1145/3564246.3585192","title":"(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond","display_name":"(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639586","doi":"https://doi.org/10.1145/3564246.3585192"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585192","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of 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/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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["Rutgers University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"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/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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Janani Sundaresan","raw_affiliation_strings":["Rutgers University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5588,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69486445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"183","last_page":"195"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6057195663452148},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5849138498306274},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.531098484992981},{"id":"https://openalex.org/keywords/alice-and-bob","display_name":"Alice and Bob","score":0.5217493772506714},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5030938982963562},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4707154631614685},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4474961459636688},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4165152609348297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3698623776435852},{"id":"https://openalex.org/keywords/alice","display_name":"Alice (programming language)","score":0.2667976915836334}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6057195663452148},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5849138498306274},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.531098484992981},{"id":"https://openalex.org/C127964579","wikidata":"https://www.wikidata.org/wiki/Q649676","display_name":"Alice and Bob","level":3,"score":0.5217493772506714},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5030938982963562},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4707154631614685},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4474961459636688},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4165152609348297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3698623776435852},{"id":"https://openalex.org/C2778222013","wikidata":"https://www.wikidata.org/wiki/Q1136926","display_name":"Alice (programming language)","level":2,"score":0.2667976915836334},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585192","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585192","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4344669250","display_name":"CAREER: Graph Streaming, Communication Games, and the Quest for Optimal Algorithms","funder_award_id":"2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/G5516049770","display_name":null,"funder_award_id":"NSF CAREER Grant CCF-2047061","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","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/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1965972569","https://openalex.org/W1978676170","https://openalex.org/W1984126159","https://openalex.org/W1985061810","https://openalex.org/W2003425214","https://openalex.org/W2016289973","https://openalex.org/W2021016639","https://openalex.org/W2023146810","https://openalex.org/W2062881383","https://openalex.org/W2064379477","https://openalex.org/W2148137544","https://openalex.org/W2148488235","https://openalex.org/W2165753192","https://openalex.org/W2885803187","https://openalex.org/W2952096125","https://openalex.org/W2964259122","https://openalex.org/W3001104546","https://openalex.org/W3127944880","https://openalex.org/W3165922329","https://openalex.org/W4205249725","https://openalex.org/W4210631930","https://openalex.org/W4230547894","https://openalex.org/W4231916799","https://openalex.org/W4234540089","https://openalex.org/W4239886656","https://openalex.org/W4316652369","https://openalex.org/W4316652429"],"related_works":["https://openalex.org/W1972245899","https://openalex.org/W3164898278","https://openalex.org/W4319988133","https://openalex.org/W2184626999","https://openalex.org/W2783631410","https://openalex.org/W2951456395","https://openalex.org/W2365230865","https://openalex.org/W1997341083","https://openalex.org/W4282568420","https://openalex.org/W2900136945"],"abstract_inverted_index":{"We":[0],"continue":[1],"the":[2,5,35,92],"study":[3],"of":[4,8,55,58,67,76],"communication":[6,98],"complexity":[7],"gap":[9,37],"cycle":[10,38],"counting":[11,39],"problems.":[12],"These":[13],"problems":[14],"have":[15,25],"been":[16],"introduced":[17],"by":[18],"Verbin":[19],"and":[20,24,50,83],"Yu":[21],"[SODA":[22],"2011]":[23],"found":[26],"numerous":[27],"applications":[28],"in":[29,70],"proving":[30],"streaming":[31],"lower":[32],"bounds.":[33],"In":[34],"noisy":[36],"problem":[40],"(NGC),":[41],"there":[42],"is":[43,87],"a":[44],"small":[45],"integer":[46],"k":[47],"\u2265":[48],"1":[49],"an":[51],"n-vertex":[52],"graph":[53,78,93],"consisted":[54],"vertex-disjoint":[56],"union":[57],"either":[59],"k-cycles":[60],"or":[61],"2k-cycles,":[62],"plus":[63],"O(n/k)":[64],"disjoint":[65],"paths":[66],"length":[68],"k\u22121":[69],"both":[71],"cases":[72],"(\u201cnoise\u201d).":[73],"The":[74],"edges":[75],"this":[77],"are":[79],"partitioned":[80],"between":[81],"Alice":[82,100],"Bob":[84],"whose":[85],"goal":[86],"to":[88,95,101],"decide":[89],"which":[90],"case":[91],"belongs":[94],"with":[96],"minimal":[97],"from":[99],"Bob.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}