{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:56:26Z","timestamp":1763808986160},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513436","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T15:57:25Z","timestamp":1282233445000},"page":"1873-1877","source":"Crossref","is-referenced-by-count":9,"title":["Optimal computation of symmetric Boolean functions in tree networks"],"prefix":"10.1109","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.532875"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref13","article-title":"Distributed source coding for interactive function computation","author":"ma","year":"2008","journal-title":"Submitted to IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205926"},{"journal-title":"Combinatorial Mathematics Preliminary version","year":"0","author":"west","key":"ref15"},{"journal-title":"The Complexity of Boolean Functions","year":"1987","author":"wegener","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400474"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.340481"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160273"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.50368"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503141"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513436.pdf?arnumber=5513436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T16:24:31Z","timestamp":1489854271000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513436","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}