{"id":"https://openalex.org/W2005007104","doi":"https://doi.org/10.1109/tit.2012.2188883","title":"Optimal Function Computation in Directed and Undirected Graphs","display_name":"Optimal Function Computation in Directed and Undirected Graphs","publication_year":2012,"publication_date":"2012-02-24","ids":{"openalex":"https://openalex.org/W2005007104","doi":"https://doi.org/10.1109/tit.2012.2188883","mag":"2005007104"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2188883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2188883","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]},{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["IN","US"],"is_corresponding":true,"raw_author_name":"Hemant Kowshik","raw_affiliation_strings":["Next Generation Systems Group, IBM India Research Laboratory, Bangalore, India","Next Generation Systems group, IBM India Research Lab, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Next Generation Systems Group, IBM India Research Laboratory, Bangalore, India","institution_ids":["https://openalex.org/I4210103279"]},{"raw_affiliation_string":"Next Generation Systems group, IBM India Research Lab, Bangalore, India","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046041861","display_name":"P. R. Kumar","orcid":"https://orcid.org/0000-0001-6152-7330"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. R. Kumar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A and M University, College Station, TX, USA","Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051079250"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210103279"],"apc_list":null,"apc_paid":null,"fwci":4.9643,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.95403214,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"58","issue":"6","first_page":"3407","last_page":"3418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9955000281333923,"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/directed-graph","display_name":"Directed graph","score":0.669041633605957},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.6189894080162048},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.58760666847229},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5700405836105347},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5468021631240845},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5220125317573547},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5091833472251892},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4790585935115814},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.454412579536438},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4382815361022949},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42619845271110535},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40835094451904297},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40550485253334045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3626905381679535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32920849323272705}],"concepts":[{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.669041633605957},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.6189894080162048},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.58760666847229},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5700405836105347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5468021631240845},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5220125317573547},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5091833472251892},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4790585935115814},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.454412579536438},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4382815361022949},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42619845271110535},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40835094451904297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40550485253334045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3626905381679535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32920849323272705},{"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/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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2012.2188883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2188883","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1517585663","https://openalex.org/W1992185863","https://openalex.org/W2026129786","https://openalex.org/W2038837798","https://openalex.org/W2047276487","https://openalex.org/W2053269541","https://openalex.org/W2071801393","https://openalex.org/W2095647873","https://openalex.org/W2101080823","https://openalex.org/W2105831729","https://openalex.org/W2119336214","https://openalex.org/W2119374264","https://openalex.org/W2123976939","https://openalex.org/W2129119419","https://openalex.org/W2137813581","https://openalex.org/W2150412388","https://openalex.org/W2158565632","https://openalex.org/W2159549640","https://openalex.org/W2164651000","https://openalex.org/W2170513023","https://openalex.org/W4232236937","https://openalex.org/W6662227430","https://openalex.org/W6674292702"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403","https://openalex.org/W3164774158"],"abstract_inverted_index":{"We":[0,22,38,77,149,244],"consider":[1],"the":[2,19,41,44,47,51,59,75,89,93,98,109,117,127,151,157,176,181,199,222,234,239,251,279,305,317],"problem":[3],"of":[4,18,43,53,129,221,236,257,275,281,307,316],"information":[5,55],"aggregation":[6,240,271,296],"in":[7,14,32,120,205],"sensor":[8,20,90,223],"networks,":[9],"where":[10,92,190,201],"one":[11],"is":[12,95,114,194,273,310],"interested":[13],"computing":[15],"a":[16,64,81,216,286],"function":[17,30,45,106,220],"measurements.":[21],"allow":[23],"for":[24,131,144,153,162,184],"block":[25,147],"processing":[26],"and":[27,35,50,160,187,210,230,241,249,290],"study":[28,39,233],"in-network":[29,270],"computation":[31,107,143],"directed":[33,82,154,167],"graphs":[34],"undirected":[36,207],"graphs.":[37],"how":[40],"structure":[42],"affects":[46],"encoding":[48],"strategies":[49],"effect":[52,235],"interactive":[54,228],"exchange.":[56],"Depending":[57],"on":[58,88,101,175,238,246,262,295],"application,":[60],"there":[61,133],"could":[62],"be":[63,260],"designated":[65],"collector":[66,110],"node,":[67],"or":[68],"every":[69,211],"node":[70,212],"might":[71],"want":[72],"to":[73,96,115,214,259],"compute":[74,215],"function.":[76],"begin":[78],"by":[79,179],"considering":[80],"graph":[83],"C":[84],"=":[85],"(\u03b3.":[86],"\u03b5)":[87],"nodes,":[91],"goal":[94,113],"determine":[97,150,250],"optimal":[99,158,266,318],"encoders":[100,136],"each":[102,163,185,263],"edge":[103],"which":[104,132,140,272],"achieve":[105,141],"at":[108],"node.":[111],"Our":[112],"characterize":[116],"rate":[118,177],"region":[119,178],"R":[121],"<sup":[122],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[123],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">|\u03b5|</sup>":[124],",":[125],"i.e.,":[126],"set":[128],"points":[130],"exist":[134],"feasible":[135],"with":[137],"given":[138,217],"rates":[139],"zero-error":[142],"asymptotically":[145],"large":[146],"length.":[148],"solution":[152],"trees,":[155],"specifying":[156],"encoder":[159],"decoder":[161],"edge.":[164,264],"For":[165,299],"general":[166,282],"acyclic":[168],"graphs,":[169,283,301],"we":[170,197,231,284,302],"provide":[171],"an":[172,206,291],"outer":[173,192],"bound":[174,193,289],"finding":[180],"disambiguation":[182],"requirements":[183],"cut,":[186],"describe":[188],"examples":[189],"this":[191,308],"tight.":[195],"Next,":[196],"address":[198],"scenario":[200],"nodes":[202],"are":[203],"connected":[204],"tree":[208],"network,":[209],"wishes":[213],"symmetric":[218],"Boolean":[219],"data.":[224],"Undirected":[225],"edges":[226],"permit":[227],"computation,":[229],"therefore":[232],"interaction":[237],"communication":[242],"strategies.":[243],"focus":[245],"sum-threshold":[247],"functions":[248],"minimum":[252],"worst":[253],"case":[254,280],"total":[255],"number":[256],"bits":[258],"exchanged":[261],"The":[265],"strategy":[267],"involves":[268],"recursive":[269],"reminiscent":[274],"message":[276],"passing.":[277],"In":[278],"present":[285],"cut-set":[287],"lower":[288],"achievable":[292],"scheme":[293,309],"based":[294],"along":[297],"trees.":[298],"complete":[300],"prove":[303],"that":[304,315],"complexity":[306],"no":[311],"more":[312],"than":[313],"twice":[314],"scheme.":[319]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}