{"id":"https://openalex.org/W4243302453","doi":"https://doi.org/10.1109/sfcs.2002.1181944","title":"An information statistics approach to data stream and communication complexity","display_name":"An information statistics approach to data stream and communication complexity","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W4243302453","doi":"https://doi.org/10.1109/sfcs.2002.1181944"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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/A5054834255","display_name":"Ziv Bar-Yossef","orcid":null},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Z. Bar-Yossef","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023204485","display_name":"T. S. Jayram","orcid":"https://orcid.org/0000-0001-5235-4853"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T.S. Jayram","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101772779","display_name":"Ravi Kumar","orcid":"https://orcid.org/0000-0002-2203-2586"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Kumar","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034629063","display_name":"D. Sivakumar","orcid":null},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Sivakumar","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"209","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"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.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9970999956130981,"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/communication-complexity","display_name":"Communication complexity","score":0.7907308340072632},{"id":"https://openalex.org/keywords/hellinger-distance","display_name":"Hellinger distance","score":0.668248176574707},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5742546319961548},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5706260204315186},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5667511224746704},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5383357405662537},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5249778628349304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5186907052993774},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.4821731448173523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42764344811439514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35293084383010864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3391360640525818},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.21840456128120422}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7907308340072632},{"id":"https://openalex.org/C153024298","wikidata":"https://www.wikidata.org/wiki/Q3030678","display_name":"Hellinger distance","level":2,"score":0.668248176574707},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5742546319961548},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5706260204315186},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5667511224746704},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5383357405662537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5249778628349304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5186907052993774},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.4821731448173523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42764344811439514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35293084383010864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3391360640525818},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.21840456128120422},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2002.1181944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W4211966","https://openalex.org/W605043455","https://openalex.org/W1970259241","https://openalex.org/W1980223785","https://openalex.org/W2002501531","https://openalex.org/W2027214648","https://openalex.org/W2047424291","https://openalex.org/W2054081892","https://openalex.org/W2070486524","https://openalex.org/W2080267935","https://openalex.org/W2080745194","https://openalex.org/W2085788081","https://openalex.org/W2089797683","https://openalex.org/W2099111195","https://openalex.org/W2100369465","https://openalex.org/W2114607430","https://openalex.org/W2122882636","https://openalex.org/W2122929038","https://openalex.org/W2141585995","https://openalex.org/W2146950091","https://openalex.org/W2160461879","https://openalex.org/W3147513489","https://openalex.org/W4206794571","https://openalex.org/W4211003473","https://openalex.org/W6600166691","https://openalex.org/W6683311326"],"related_works":["https://openalex.org/W2953183005","https://openalex.org/W1513451900","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2130100567","https://openalex.org/W4288641573","https://openalex.org/W2328371232","https://openalex.org/W2374430960","https://openalex.org/W2353365661","https://openalex.org/W4243302453"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,26,44,55,68],"new":[3],"method":[4,14],"for":[5,47,87],"proving":[6,81],"strong":[7],"lower":[8,56,85],"bounds":[9,86],"in":[10],"communication":[11,45,60],"complexity.":[12],"This":[13],"is":[15,29,54],"based":[16,104],"on":[17,58,105],"the":[18,21,30,36,48,59,92,98],"notion":[19],"of":[20,25,33,80,94],"conditional":[22,51],"information":[23,34,52,83],"complexity":[24,53,84],"function":[27],"which":[28],"minimum":[31],"amount":[32],"about":[35],"inputs":[37],"that":[38,64,79],"has":[39],"to":[40,78],"be":[41],"revealed":[42],"by":[43],"protocol":[46],"function.":[49],"While":[50],"bound":[57],"complexity,":[61],"we":[62,100],"show":[63],"it":[65],"also":[66],"admits":[67],"direct":[69],"sum":[70,73],"theorem.":[71],"Direct":[72],"decomposition":[74],"reduces":[75],"our":[76],"task":[77],"(conditional)":[82],"simple":[88],"problems":[89],"(such":[90],"as":[91],"AND":[93],"two":[95],"bits).":[96],"For":[97],"latter,":[99],"develop":[101],"novel":[102],"techniques":[103],"Hellinger":[106],"distance":[107],"and":[108],"its":[109],"generalizations.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}