{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T11:45:58Z","timestamp":1725450358714},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/glocom.2011.6133878","type":"proceedings-article","created":{"date-parts":[[2012,1,30]],"date-time":"2012-01-30T21:45:17Z","timestamp":1327959917000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Flow Allocation Algorithms for In-Network Function Computation"],"prefix":"10.1109","author":[{"given":"V.","family":"Shah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. K.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Manjunath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743463"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63499"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057272"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033983"},{"journal-title":"Network Coding for Computing Cut-set Bounds","year":"2010","author":"appuswamy","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993809"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"4"},{"journal-title":"Sum-networks System of Polynomial Equations Reversibility Insufficiency of Linear Network Coding Unachievability of Coding Capacity","year":"0","author":"rai","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595066"}],"event":{"name":"2011 IEEE Global Communications Conference (GLOBECOM 2011)","start":{"date-parts":[[2011,12,5]]},"location":"Houston, TX, USA","end":{"date-parts":[[2011,12,9]]}},"container-title":["2011 IEEE Global Telecommunications Conference - GLOBECOM 2011"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6132211\/6133457\/06133878.pdf?arnumber=6133878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T14:25:09Z","timestamp":1490106309000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6133878\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/glocom.2011.6133878","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}