{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T23:49:53Z","timestamp":1725407393412},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283991","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T16:57:57Z","timestamp":1346345877000},"page":"2611-2615","source":"Crossref","is-referenced-by-count":5,"title":["Data exchange problem with helpers"],"prefix":"10.1109","author":[{"given":"Nebojsa","family":"Milosavljevic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameer","family":"Pawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salim El","family":"Rouayheb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gastpar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"edmonds","year":"1970","journal-title":"Combinatorial Structures and Their Applications"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00019-3"},{"journal-title":"Elements of Information Theory 2nd Edition","year":"2006","author":"cover","key":"15"},{"journal-title":"Submodular Functions and Optimization","year":"2005","author":"fujishige","key":"16"},{"journal-title":"Generating Secret in A Network","year":"2010","author":"chan","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"12","first-page":"489","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"0","journal-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2005"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743607"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513313"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034157"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120324"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979066"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2010.5680380"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"journal-title":"Optimal Deterministic Polynomial-time Data Exchange for Omniscience","year":"2011","author":"milosavljevic","key":"8"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283991.pdf?arnumber=6283991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T20:54:47Z","timestamp":1490129687000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283991\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283991","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}