{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:58:55Z","timestamp":1725728335055},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006802","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"1613-1617","source":"Crossref","is-referenced-by-count":43,"title":["The exact rate-memory tradeoff for caching with uncoded prefetching"],"prefix":"10.1109","author":[{"given":"Qian","family":"Yu","sequence":"first","affiliation":[]},{"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","article-title":"Characterizing the rate-memory tradeoff in cache networks within a factor of 2","author":"yu","year":"2017","journal-title":"IEEE Trans Inf Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"},{"key":"ref11","article-title":"Coded caching with nonuniform demands","author":"niesen","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308972"},{"journal-title":"Order-optimal rate of caching and coded multicasting with random demands","year":"2015","author":"ji","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541354"},{"journal-title":"Noisy broadcast networks with receiver caching","year":"2016","author":"bidokhti","key":"ref16"},{"journal-title":"Fundamental limits of cache-aided wireless bc Interplay of coded-caching and csit feedback","year":"2015","author":"zhang","key":"ref17"},{"journal-title":"A fundamental tradeoff between computation and communication in distributed computing","year":"2016","author":"li","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841765"},{"journal-title":"Information-theoretic caching sequential coding for computing","year":"2015","author":"wang","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541276"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606816"},{"journal-title":"Fundamental limits of caching Improved bounds for small buffer users","year":"2014","author":"chen","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541415"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541414"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2016.7460574"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606818"},{"journal-title":"Fundamental limits of caching improved delivery rate-cache capacity trade-off","year":"2016","author":"amiri","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"journal-title":"A scalable framework for wireless distributed computing","year":"2016","author":"li","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282744"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282745"},{"journal-title":"Symmetry outer bounds and code constructions A computer-aided investigation on the fundamental limits of caching","year":"2016","author":"tian","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888186"},{"key":"ref26","article-title":"The exact rate-memory tradeoff for caching with uncoded prefetching","author":"yu","year":"2016","journal-title":"IEEE Trans Inf Theory"},{"journal-title":"Critical database size for effective caching","year":"2015","author":"prem","key":"ref25"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006802.pdf?arnumber=8006802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T22:56:34Z","timestamp":1506984994000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006802","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}