{"id":"https://openalex.org/W1983225054","doi":"https://doi.org/10.1145/2746539.2746542","title":"Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms","display_name":"Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W1983225054","doi":"https://doi.org/10.1145/2746539.2746542","mag":"1983225054"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746542","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:34305996","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013551063","display_name":"Kasper Green Larsen","orcid":"https://orcid.org/0000-0001-8841-5929"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Kasper Green Larsen","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark","Aarhus University, Aarhus , Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Aarhus , Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109135732","display_name":"Jelani Nelson","orcid":null},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jelani Nelson","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102936404","display_name":"Huy L. Nguy\u00ean","orcid":"https://orcid.org/0000-0001-5128-6545"},"institutions":[{"id":"https://openalex.org/I4210107338","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210107338"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huy L. Nguy\u00ean","raw_affiliation_strings":["Simons Institute, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Simons Institute, Berkeley, CA, USA","institution_ids":["https://openalex.org/I4210107338"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013551063"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.8902,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.82573262,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"803","last_page":"812"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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"}}],"keywords":[{"id":"https://openalex.org/keywords/turnstile","display_name":"Turnstile","score":0.9639031887054443},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.7908161878585815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6797313690185547},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6695752143859863},{"id":"https://openalex.org/keywords/streaming-data","display_name":"Streaming data","score":0.6386755108833313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5671351552009583},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.473296582698822},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4463299810886383},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4133566617965698},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36940351128578186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2816312909126282},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09843337535858154}],"concepts":[{"id":"https://openalex.org/C31370731","wikidata":"https://www.wikidata.org/wiki/Q7856108","display_name":"Turnstile","level":2,"score":0.9639031887054443},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.7908161878585815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6797313690185547},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6695752143859863},{"id":"https://openalex.org/C2777611316","wikidata":"https://www.wikidata.org/wiki/Q39045282","display_name":"Streaming data","level":2,"score":0.6386755108833313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5671351552009583},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.473296582698822},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4463299810886383},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4133566617965698},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36940351128578186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2816312909126282},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09843337535858154},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2746539.2746542","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dash.harvard.edu:1/34305996","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:34305996","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"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":"","raw_type":"Conference Paper"},{"id":"pmh:oai:pure.atira.dk:publications/fbaa08d2-5fb7-427f-a0e6-de4a2a27f253","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/fbaa08d2-5fb7-427f-a0e6-de4a2a27f253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Larsen, K G, Nelson, J & Nguyen, H L 2015, Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. in R Servedio & R Rubinfeld (eds), Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15. Association for Computing Machinery, pp. 803-812, Annual ACM Symposium on Theory of Computing, Portland, United States, 14/06/2015. https://doi.org/10.1145/2746539.2746542","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:dash.harvard.edu:1/34305996","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:34305996","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"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":"","raw_type":"Conference Paper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4045262781","display_name":null,"funder_award_id":"DNRF84","funder_id":"https://openalex.org/F4320320943","funder_display_name":"Danmarks Grundforskningsfond"},{"id":"https://openalex.org/G5550638051","display_name":null,"funder_award_id":"N00014-14-1-0632","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8764008391","display_name":null,"funder_award_id":"CCF-1350670","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/F4320320943","display_name":"Danmarks Grundforskningsfond","ror":"https://ror.org/00znyv691"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1488505440","https://openalex.org/W1493892051","https://openalex.org/W1501674528","https://openalex.org/W1512493349","https://openalex.org/W1593263981","https://openalex.org/W1634590519","https://openalex.org/W1765394157","https://openalex.org/W1900852564","https://openalex.org/W1963524245","https://openalex.org/W1965972569","https://openalex.org/W1989664320","https://openalex.org/W1993022201","https://openalex.org/W1995484833","https://openalex.org/W1998272044","https://openalex.org/W2023930099","https://openalex.org/W2025051251","https://openalex.org/W2038142281","https://openalex.org/W2050026004","https://openalex.org/W2074286662","https://openalex.org/W2080234606","https://openalex.org/W2080745194","https://openalex.org/W2080995342","https://openalex.org/W2097796125","https://openalex.org/W2102481563","https://openalex.org/W2103126020","https://openalex.org/W2104635635","https://openalex.org/W2107917944","https://openalex.org/W2111678491","https://openalex.org/W2113623631","https://openalex.org/W2119714163","https://openalex.org/W2129978406","https://openalex.org/W2132032691","https://openalex.org/W2144004133","https://openalex.org/W2144146806","https://openalex.org/W2152489475","https://openalex.org/W2160681854","https://openalex.org/W2164485560","https://openalex.org/W2170168647","https://openalex.org/W2724568095","https://openalex.org/W2752885492","https://openalex.org/W3121437753","https://openalex.org/W3140526873","https://openalex.org/W4238118210","https://openalex.org/W4285719527","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W3191101401","https://openalex.org/W2241126753","https://openalex.org/W1824789409","https://openalex.org/W2991654599","https://openalex.org/W2225286048","https://openalex.org/W201138236","https://openalex.org/W3122033752","https://openalex.org/W1983225054","https://openalex.org/W2949338226","https://openalex.org/W4301512898"],"abstract_inverted_index":{"We":[0,85],"say":[1],"a":[2,63,68],"turnstile":[3,56,99,125],"streaming":[4,57,100],"algorithm":[5],"is":[6],"{\\em":[7],"non-adaptive}":[8],"if,":[9],"during":[10,47],"updates,":[11],"the":[12,21,30,33,38,42,60,87,105],"memory":[13,39],"cells":[14,45],"written":[15],"and":[16,25,97,146],"read":[17,46],"depend":[18],"only":[19],"on":[20,37],"index":[22],"being":[23],"updated":[24],"random":[26],"coins":[27],"tossed":[28],"at":[29],"beginning":[31],"of":[32,41,152],"stream":[34],"(and":[35],"not":[36],"contents":[40],"algorithm).":[43],"Memory":[44],"queries":[48],"may":[49],"be":[50],"decided":[51],"upon":[52],"adaptively.":[53],"All":[54],"known":[55,160],"algorithms":[58,106],"in":[59,115],"literature,":[61],"except":[62],"single":[64],"recent":[65],"example":[66],"for":[67,94],"particular":[69],"promise":[70],"problem":[71],"[7],":[72],"are":[73,81,107],"non-adaptive.":[74,108],"In":[75,149],"fact,":[76],"even":[77],"more":[78],"specifically,":[79],"they":[80],"all":[82],"linear":[83],"sketches.":[84],"prove":[86],"first":[88],"non-trivial":[89,124],"update":[90,126],"time":[91,127],"lower":[92,118,128,131,156],"bounds":[93,132,157],"both":[95],"randomized":[96],"deterministic":[98,153],"algorithms,":[101,154],"which":[102],"hold":[103,133],"when":[104],"While":[109],"there":[110,120],"has":[111],"been":[112,122],"abundant":[113],"success":[114],"proving":[116],"space":[117],"bounds,":[119],"have":[121],"no":[123],"bounds.":[129,162],"Our":[130],"against":[134],"classically":[135],"studied":[136],"problems":[137],"such":[138],"as":[139],"heavy":[140],"hitters,":[141],"point":[142],"query,":[143],"entropy":[144],"estimation,":[145],"moment":[147],"estimation.":[148],"some":[150],"cases":[151],"our":[155],"nearly":[158],"match":[159],"upper":[161]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}