{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:06Z","timestamp":1725516246508},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1109\/wiopt.2011.5930069","type":"proceedings-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T16:45:37Z","timestamp":1309279537000},"page":"86-93","source":"Crossref","is-referenced-by-count":1,"title":["Distributed function computation in networks: A joint delay-energy perspective"],"prefix":"10.1109","author":[{"given":"Nikhil","family":"Karamchandani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Franceschetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909156"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557101"},{"key":"ref12","first-page":"1056","article-title":"A tight lower bound for parity in noisy communication networks","author":"dutta","year":"2008","journal-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462023"},{"article-title":"Random networks for communication","year":"2007","author":"franceschetti","key":"ref14"},{"article-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2011.5930069"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158545"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195462"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498546"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557216"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4808-8_14"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/060654864"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","article-title":"Communication Complexity","author":"kushilevitz","year":"1997"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797694"}],"event":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks (WiOpt)","start":{"date-parts":[[2011,5,9]]},"location":"Princeton, NJ, USA","end":{"date-parts":[[2011,5,13]]}},"container-title":["2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5877068\/5929998\/05930069.pdf?arnumber=5930069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T22:30:02Z","timestamp":1497911402000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5930069\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/wiopt.2011.5930069","relation":{},"subject":[],"published":{"date-parts":[[2011,5]]}}}