{"id":"https://openalex.org/W2100436211","doi":"https://doi.org/10.1109/isit.2010.5513436","title":"Optimal computation of symmetric Boolean functions in tree networks","display_name":"Optimal computation of symmetric Boolean functions in tree networks","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2100436211","doi":"https://doi.org/10.1109/isit.2010.5513436","mag":"2100436211"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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/A5051079250","display_name":"Hemant Kowshik","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hemant Kowshik","raw_affiliation_strings":["CSL and Department of ECE, University of Illinois, Urbana-Champaign, USA","CSL and Department of ECE, University of Illinois Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"CSL and Department of ECE, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"CSL and Department of ECE, University of Illinois Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101587706","display_name":"P. R. Kumar","orcid":"https://orcid.org/0000-0001-8168-6136"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. R. Kumar","raw_affiliation_strings":["CSL and Department of ECE, University of Illinois, Urbana-Champaign, USA","CSL and Department of ECE, University of Illinois Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"CSL and Department of ECE, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"CSL and Department of ECE, University of Illinois Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051079250"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.0843,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.76368634,"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":"1873","last_page":"1877"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9944000244140625,"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"}},"topics":[{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9944000244140625,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9936000108718872,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.991599977016449,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6048095226287842},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5713716745376587},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5648648738861084},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5478886365890503},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5314397215843201},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4807950556278229},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.458998441696167},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44987809658050537},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.449735552072525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44918522238731384},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.44726625084877014},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42976123094558716},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36934351921081543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.364322692155838},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3072549104690552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28068047761917114}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6048095226287842},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5713716745376587},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5648648738861084},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5478886365890503},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5314397215843201},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4807950556278229},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.458998441696167},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44987809658050537},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.449735552072525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44918522238731384},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.44726625084877014},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42976123094558716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36934351921081543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.364322692155838},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3072549104690552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28068047761917114},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.369.6622","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.6622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://maascom.ece.ohio-state.edu/publications/Kumar/10-06-16-kowshik-kumar-isit10-tree.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":17,"referenced_works":["https://openalex.org/W1517585663","https://openalex.org/W1618438246","https://openalex.org/W1992185863","https://openalex.org/W2056671060","https://openalex.org/W2105831729","https://openalex.org/W2119336214","https://openalex.org/W2119374264","https://openalex.org/W2123976939","https://openalex.org/W2150412388","https://openalex.org/W2152546104","https://openalex.org/W2158565632","https://openalex.org/W2159549640","https://openalex.org/W2164651000","https://openalex.org/W2340787257","https://openalex.org/W2912956481","https://openalex.org/W4206794571","https://openalex.org/W6636567656"],"related_works":["https://openalex.org/W1523834128","https://openalex.org/W3212703233","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/W1481287275","https://openalex.org/W1909384579"],"abstract_inverted_index":{"In":[0,186],"this":[1,104,149,213],"paper,":[2],"we":[3,159,192],"address":[4],"the":[5,30,36,60,72,89,123,142,153,175,181,187,210,222],"scenario":[6],"where":[7],"nodes":[8,44],"with":[9,45],"sensor":[10,31],"data":[11,55],"are":[12],"connected":[13],"in":[14,152],"a":[15,24,40,84,97,119,135,162,194],"tree":[16,115],"network,":[17],"and":[18,58,82,117,164,198],"every":[19],"node":[20,137],"wants":[21],"to":[22,53,67,70,108,114,180],"compute":[23],"given":[25],"symmetric":[26],"Boolean":[27],"function":[28,41],"of":[29,38,42,65,99,125,144,155,183,189,212,221],"data.":[32],"We":[33,48,75,111,139],"first":[34],"consider":[35],"problem":[37],"computing":[39],"two":[43,136],"integer":[46],"measurements.":[47],"allow":[49],"for":[50,122,171],"block":[51],"computation":[52,166],"enhance":[54],"fusion":[56],"efficiency,":[57],"determine":[59],"minimum":[61],"worst-case":[62],"total":[63],"number":[64,124],"bits":[66,126],"be":[68,109,178],"exchanged":[69,127],"perform":[71],"desired":[73],"computation.":[74],"establish":[76],"lower":[77,90,120,150,196],"bounds":[78],"using":[79,92],"fooling":[80],"sets,":[81],"provide":[83],"novel":[85],"scheme":[86,105,201,214],"which":[87],"attains":[88],"bounds,":[91],"information":[93],"theoretic":[94],"tools.":[95],"For":[96,207],"class":[98],"functions":[100],"called":[101],"sum-threshold":[102,156],"functions,":[103],"is":[106,169,215],"shown":[107],"optimal.":[110],"then":[112],"turn":[113],"networks":[116],"derive":[118],"bound":[121,151],"on":[128,203],"each":[129,172],"link":[130],"by":[131],"viewing":[132],"it":[133],"as":[134],"problem.":[138],"show":[140],"that":[141,168,220],"protocol":[143],"recursive":[145],"in-network":[146,165],"aggregation":[147,204],"achieves":[148],"case":[154,182,188],"functions.":[157],"Thus":[158],"have":[160],"provided":[161],"communication":[163],"strategy":[167],"optimal":[170,223],"link.":[173],"All":[174],"results":[176],"can":[177],"extended":[179],"non-binary":[184],"alphabets.":[185],"general":[190],"graphs,":[191,209],"present":[193],"cut-set":[195],"bound,":[197],"an":[199],"achievable":[200],"based":[202],"along":[205],"trees.":[206],"complete":[208],"complexity":[211],"no":[216],"more":[217],"than":[218],"twice":[219],"scheme.":[224]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}