{"id":"https://openalex.org/W3165922329","doi":"https://doi.org/10.1145/3406325.3451110","title":"Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma","display_name":"Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3165922329","doi":"https://doi.org/10.1145/3406325.3451110","mag":"3165922329"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451110","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5024474987","display_name":"N Vishvajeet","orcid":null},"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":"Vishvajeet N","raw_affiliation_strings":["Rutgers University, USA"],"raw_orcid":"https://orcid.org/0000-0002-1502-9231","affiliations":[{"raw_affiliation_string":"Rutgers University, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":4.453,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.95928956,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"612","last_page":"625"},"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.9998000264167786,"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.9998000264167786,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9973000288009644,"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.9965999722480774,"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/sublinear-function","display_name":"Sublinear function","score":0.6816346645355225},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6587865352630615},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.631765604019165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6191375851631165},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6140738129615784},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6039366126060486},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4940643608570099},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.49076685309410095},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4661696255207062},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4127945899963379},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4117470979690552}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6816346645355225},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6587865352630615},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.631765604019165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6191375851631165},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6140738129615784},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6039366126060486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4940643608570099},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.49076685309410095},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4661696255207062},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4127945899963379},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4117470979690552},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451110","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.699999988079071,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1495913768","https://openalex.org/W1608198436","https://openalex.org/W1978676170","https://openalex.org/W1981620197","https://openalex.org/W1985061810","https://openalex.org/W2002576896","https://openalex.org/W2021016639","https://openalex.org/W2021736779","https://openalex.org/W2031495811","https://openalex.org/W2033261280","https://openalex.org/W2042518617","https://openalex.org/W2074456199","https://openalex.org/W2082227928","https://openalex.org/W2083432171","https://openalex.org/W2086076777","https://openalex.org/W2138852390","https://openalex.org/W2148137544","https://openalex.org/W2148488235","https://openalex.org/W2165753192","https://openalex.org/W2294870549","https://openalex.org/W2295466155","https://openalex.org/W2424986266","https://openalex.org/W2569746101","https://openalex.org/W2569757174","https://openalex.org/W2578342868","https://openalex.org/W2948826707","https://openalex.org/W2952096125","https://openalex.org/W2952343177","https://openalex.org/W2953264324","https://openalex.org/W2963034343","https://openalex.org/W2963692174","https://openalex.org/W2964259122","https://openalex.org/W3001104546","https://openalex.org/W3001783123","https://openalex.org/W3157388067","https://openalex.org/W4237171398","https://openalex.org/W4239886656","https://openalex.org/W4242137535","https://openalex.org/W4246633356","https://openalex.org/W4247564011","https://openalex.org/W6681616540"],"related_works":["https://openalex.org/W2404979123","https://openalex.org/W3197032895","https://openalex.org/W4385317418","https://openalex.org/W2948826707","https://openalex.org/W4378760001","https://openalex.org/W1528180898","https://openalex.org/W2951231217","https://openalex.org/W4300287281","https://openalex.org/W4390092937","https://openalex.org/W3081826309"],"abstract_inverted_index":{"We":[0,46],"study":[1],"space-pass":[2],"tradeoffs":[3],"in":[4,148],"graph":[5,35],"streaming":[6,176,193,238],"algorithms":[7,98,135,158],"for":[8,56,112,133,136,164,236],"parameter":[9],"estimation":[10],"and":[11,23,99,234],"property":[12],"testing":[13,32],"problems":[14,58],"such":[15,82],"as":[16,83,241],"estimating":[17],"the":[18,63,117,140,219],"size":[19],"of":[20,27,59,80,89,96,120,130,170,214,218,231],"maximum":[21,24],"matchings":[22],"cuts,":[25],"weight":[26],"minimum":[28],"spanning":[29],"trees,":[30],"or":[31,38,72],"if":[33,189],"a":[34,48,66,128,174,179,190,198],"is":[36,100,173],"connected":[37],"cycle-free":[39],"versus":[40],"being":[41],"far":[42],"from":[43,116],"these":[44,90,137,165],"properties.":[45],"develop":[47],"new":[49],"lower":[50,109,131,143,239],"bound":[51,93],"technique":[52],"that":[53,55,184],"proves":[54],"many":[57],"interest,":[60],"including":[61],"all":[62],"above,":[64],"obtaining":[65],"(1+\u0454)-approximation":[67],"requires":[68],"either":[69],"n\u03a9(1)":[70],"space":[71],"\u03a9(1/\u0454)":[73],"passes,":[74],"even":[75,111],"on":[76],"highly":[77],"restricted":[78],"families":[79],"graphs":[81],"bounded-degree":[84],"planar":[85],"graphs.":[86],"For":[87],"multiple":[88],"problems,":[91],"this":[92],"matches":[94],"those":[95],"existing":[97],"thus":[101],"(asymptotically)":[102],"optimal.":[103],"Our":[104],"results":[105],"considerably":[106],"strengthen":[107],"prior":[108],"bounds":[110,132,144,240],"arbitrary":[113],"graphs:":[114],"starting":[115],"influential":[118],"work":[119],"[Verbin,":[121],"Yu;":[122,152],"SODA":[123],"2011],":[124],"there":[125],"has":[126],"been":[127],"plethora":[129],"single-pass":[134],"problems;":[138],"however,":[139],"only":[141,196],"multi-pass":[142],"proven":[145],"very":[146],"recently":[147],"[Assadi,":[149],"Kol,":[150],"Saxena,":[151],"FOCS":[153],"2020]":[154],"rules":[155],"out":[156],"sublinear-space":[157],"with":[159,201,221],"exponentially":[160],"smaller":[161],"o(log(1/\u0454))":[162],"passes":[163],"problems.":[166],"One":[167],"key":[168],"ingredient":[169],"our":[171],"proofs":[172],"simple":[175],"XOR":[177,213],"Lemma,":[178],"generic":[180],"hardness":[181],"amplification":[182],"result,":[183],"we":[185],"prove:":[186],"informally":[187],"speaking,":[188],"p-pass":[191],"s-space":[192],"algorithm":[194],"can":[195,229],"solve":[197,212],"decision":[199],"problem":[200,220],"advantage":[202,222],"\u03b4":[203],">":[204],"0":[205],"over":[206],"random":[207],"guessing,":[208],"then":[209],"it":[210],"cannot":[211],"\u2113":[215],"independent":[216,232],"copies":[217],"much":[223],"better":[224],"than":[225],"\u03b4\u2113.":[226],"This":[227],"result":[228],"be":[230],"interest":[233],"useful":[235],"other":[237],"well.":[242]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}