{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:57:25Z","timestamp":1730195845338,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/allerton.2018.8636087","type":"proceedings-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T03:04:31Z","timestamp":1551409471000},"page":"1073-1080","source":"Crossref","is-referenced-by-count":1,"title":["Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience"],"prefix":"10.1109","author":[{"given":"Ni","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parastoo","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Rakotoarivelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/1994208"},{"journal-title":"Submodular Functions and Optimization","year":"2005","author":"fujishige","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555923"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176786"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006995"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00458-4"},{"key":"ref16","article-title":"A faster parametric submodular function minimization algorithm and applications","volume":"92","author":"nagano","year":"2007","journal-title":"Tech Rep"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.4.803"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523980"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290993"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761390"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848809"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90070-D"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref9","first-page":"1759","article-title":"Minimum average cost clustering","author":"nagano","year":"2010","journal-title":"Proc Advances in Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"journal-title":"Elements of Information Theory","year":"2012","author":"cover","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-44-01150-6"},{"key":"ref21","article-title":"On tightness of mutual dependence upperbound for secretkey capacity of multiple terminals","author":"chan","year":"2008","journal-title":"arXiv preprint arXiv 0805 3200"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76796-1_7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"}],"event":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2018,10,2]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2018,10,5]]}},"container-title":["2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8630872\/8635635\/08636087.pdf?arnumber=8636087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:11:01Z","timestamp":1598227861000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8636087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/allerton.2018.8636087","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}