{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:16Z","timestamp":1773376876547,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2148104"],"award-info":[{"award-number":["CNS-2148104"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619412","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1155-1160","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and Timely Memory Access"],"prefix":"10.1109","author":[{"given":"Vishakha","family":"Ramani","sequence":"first","affiliation":[{"name":"Rutgers University,WINLAB"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Seskar","sequence":"additional","affiliation":[{"name":"Rutgers University,WINLAB"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy D.","family":"Yates","sequence":"additional","affiliation":[{"name":"Rutgers University,WINLAB"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10229077"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS57453.2023.10226174"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.23919\/WiOpt58741.2023.10349900"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437712"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2936199"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2873606"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3032237"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2960346"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2918736"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919842"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174024"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845145"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITC30.2018.00031"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref15","first-page":"509","article-title":"Read-copy update: Using execution history to solve concurrency problems","volume-title":"Parallel and Distributed Computing and Systems","volume":"509518","author":"McKenney","year":"1998"},{"key":"ref16","first-page":"338","article-title":"Read-copy update","volume-title":"In Ottawa Linux Symposium","author":"Mckenney","year":"2001"},{"key":"ref17","volume-title":"Introduction to Stochastic Dynamic Programming, ser. Probability and Mathematical Statistics: A Series of Monographs and Textbooks","author":"Ross","year":"1983"},{"key":"ref18","volume-title":"Applied Probability Models with Optimization Applications, ser. Holden-Day series in industrial engineering and management science","author":"Ross","year":"1970"},{"issue":"4","key":"ref19","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.37.4.626","article-title":"Average cost optimal stationary policies in infinite state markov decision processes with unbounded costs","volume":"37","author":"Sennott","year":"1989","journal-title":"Operations Research"},{"key":"ref20","author":"Ramani","year":"2024","journal-title":"Efficient and timely memory access"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619412.pdf?arnumber=10619412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:55Z","timestamp":1773347335000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619412\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619412","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}