{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:10:20Z","timestamp":1764936620799},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/tit.2012.2188883","type":"journal-article","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T22:32:40Z","timestamp":1330122760000},"page":"3407-3418","source":"Crossref","is-referenced-by-count":51,"title":["Optimal Function Computation in Directed and Undirected Graphs"],"prefix":"10.1109","volume":"58","author":[{"given":"Hemant","family":"Kowshik","sequence":"first","affiliation":[]},{"given":"P. R.","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.340481"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055607"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.532875"},{"key":"ref17","first-page":"51","article-title":"Two-terminal distributed source coding with alternating messages for function computation","author":"ma","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205926"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557216"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref6","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2168902"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.50368"},{"key":"ref7","author":"wegener","year":"1987","journal-title":"The Complexity of Boolean Functions"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095070"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160273"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909156"},{"key":"ref22","author":"west","year":"2008","journal-title":"Combinatorial Mathematics"},{"key":"ref21","first-page":"1056","article-title":"A tight lower bound for parity in noisy communication networks","author":"dutta","year":"2008","journal-title":"Proc 20th ACM-SIAM Symp Discrete Algorithms"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6200408\/06157622.pdf?arnumber=6157622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:54:08Z","timestamp":1633910048000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6157622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":22,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2188883","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}