{"id":"https://openalex.org/W2132822431","doi":"https://doi.org/10.1109/sfcs.2003.1238202","title":"Tight lower bounds for the distinct elements problem","display_name":"Tight lower bounds for the distinct elements problem","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2132822431","doi":"https://doi.org/10.1109/sfcs.2003.1238202","mag":"2132822431"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","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/A5076056716","display_name":"Piotr Indyk","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. Indyk","raw_affiliation_strings":["Massachusetts Institute of Technology, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102861589","display_name":"David P. Woodruff","orcid":"https://orcid.org/0000-0002-2158-1380"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Woodruff","raw_affiliation_strings":["Massachusetts Institute of Technology, USA","MIT, Cambridge MA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"MIT, Cambridge MA, USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076056716"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":7.9447,"has_fulltext":false,"cited_by_count":152,"citation_normalized_percentile":{"value":0.97947751,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"283","last_page":"288"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6491022109985352},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6472437977790833},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6133681535720825},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6057997345924377},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5394042730331421},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47174322605133057},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.45344242453575134},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4359179437160492},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4355713725090027},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4309201240539551},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42992573976516724},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.41190996766090393},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4005851745605469},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3943772614002228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2477504312992096},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.24430140852928162},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22747686505317688},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07792142033576965}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6491022109985352},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6472437977790833},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6133681535720825},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6057997345924377},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5394042730331421},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47174322605133057},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.45344242453575134},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4359179437160492},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4355713725090027},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4309201240539551},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42992573976516724},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41190996766090393},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4005851745605469},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3943772614002228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2477504312992096},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.24430140852928162},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22747686505317688},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07792142033576965},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"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/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":2,"locations":[{"id":"doi:10.1109/sfcs.2003.1238202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.3650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.almaden.ibm.com/cs/people/dpwoodru/distinct.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W69989483","https://openalex.org/W1530239281","https://openalex.org/W1785933978","https://openalex.org/W2006787007","https://openalex.org/W2025051251","https://openalex.org/W2028293361","https://openalex.org/W2029538739","https://openalex.org/W2064379477","https://openalex.org/W2080745194","https://openalex.org/W2089797683","https://openalex.org/W2137416782","https://openalex.org/W2160681854","https://openalex.org/W4238284510","https://openalex.org/W6683689560"],"related_works":["https://openalex.org/W4402427056","https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W2144579822"],"abstract_inverted_index":{"We":[0,40],"prove":[1],"strong":[2],"lower":[3,79,92,117],"bounds":[4],"for":[5,47,70,85,104,112],"the":[6,14,28,31,35,77,125],"space":[7,60],"complexity":[8,128],"of":[9,16,30,81,88,100,129,141],"(/spl":[10,48],"epsi/,":[11,49],"/spl":[12,50,56,62,65,82,89,106,114],"delta/)-approximating":[13,51],"number":[15],"distinct":[17],"elements":[18,37],"F/sub":[19,52],"0/":[20,53],"in":[21,134],"a":[22,98,122,131,142],"data":[23],"stream.":[24],"Let":[25],"m":[26,103],"be":[27],"size":[29],"universe":[32],"from":[33,121,124,145],"which":[34],"stream":[36],"are":[38],"drawn.":[39],"show":[41],"that":[42],"any":[43,71],"one-pass":[44],"streaming":[45],"algorithm":[46],"must":[54],"use":[55,140],"Omega/(1//spl":[57,83],"epsi//sup":[58],"2/)":[59],"when":[61],"epsi/":[63,107,111],"=":[64],"Omega/(m/sup":[66],"-1/(9":[67],"+":[68],"k)/),":[69],"k":[72],">":[73],"0,":[74],"improving":[75],"upon":[76],"known":[78],"bound":[80,93,118],"epsi/)":[84],"this":[86],"range":[87],"epsi/.":[90,115],"This":[91],"is":[94,119],"tight":[95],"up":[96],"to":[97,149],"factor":[99],"log":[101,102,109],"small":[105],"and":[108],"1//spl":[110],"large":[113],"Our":[116],"derived":[120],"reduction":[123,138],"one-way":[126],"communication":[127],"approximating":[130],"Boolean":[132],"function":[133],"Euclidean":[135],"space.":[136],"The":[137],"makes":[139],"low-distortion":[143],"embedding":[144],"an":[146],"l/sub":[147,150],"2/":[148],"1/":[151],"norm.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":31},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}