{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:14:09Z","timestamp":1725599649830},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205983","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"259-262","source":"Crossref","is-referenced-by-count":8,"title":["Network computing capacity for the reverse butterfly network"],"prefix":"10.1109","author":[{"given":"Rathinakumar","family":"Appuswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Franceschetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"Zeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595267"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"3","article-title":"lower bounds on information rates for distributed computation via noisy channels","author":"ayaso","year":"2007","journal-title":"Proceedings of the forty-fifth Allerton Conference on Computation"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797527"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924648"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1632656"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1127777.1127791"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864474"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"9","first-page":"142","article-title":"complexity classification of network information flow problems","author":"rasala lehman","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"8"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205983.pdf?arnumber=5205983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T19:05:34Z","timestamp":1497812734000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205983","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}