{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:04:57Z","timestamp":1648832697778},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/0164-1212(90)90086-2","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T00:49:55Z","timestamp":1060303795000},"page":"205-214","source":"Crossref","is-referenced-by-count":0,"title":["Local correction of mod(k) lists"],"prefix":"10.1016","volume":"11","author":[{"given":"I.J.","family":"Davis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.J.","family":"Taylor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0164-1212(90)90086-2_BIB1","series-title":"Digest of Papers: 10th Annual Int. Symp. on Fault-Tolerant Computing","first-page":"110","article-title":"An Introduction to Robust Data Structures","author":"Black","year":"1980"},{"key":"10.1016\/0164-1212(90)90086-2_BIB2","series-title":"Digest of Papers: 11th Annual Int. Symp. on Fault-Tolerant Computing","first-page":"129","article-title":"A Compendium of Robust Data Structures","author":"Black","year":"1981"},{"key":"10.1016\/0164-1212(90)90086-2_BIB3","series-title":"Local Correctability in Robust Storage Structures","author":"Black","year":"1984"},{"key":"10.1016\/0164-1212(90)90086-2_BIB4","series-title":"Theory and Practice of Error Control Codes","author":"Blahut","year":"1983"},{"issue":"5","key":"10.1016\/0164-1212(90)90086-2_BIB5","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/12.24273","article-title":"Local Correction of Helix(k) Lists","volume":"38","author":"Davis","year":"1989","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0164-1212(90)90086-2_BIB6","series-title":"Digest of Papers: 17th Int. Symp. of Fault-Tolerant Computing","first-page":"85","article-title":"A Locally Correctable AVL Tree","author":"Davis","year":"1987"},{"issue":"11","key":"10.1016\/0164-1212(90)90086-2_BIB7","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1109\/12.42119","article-title":"Local Concurrent Error Detection and Correction in Data Structures Using Virtual Backpointers","volume":"38","author":"Li","year":"1989","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0164-1212(90)90086-2_BIB8","series-title":"Digest of Papers: 15th Annual Int. Symp on Fault-Tolerant Computing","first-page":"14","article-title":"Analysis and Design of Robust Data Structures","author":"Seth","year":"1985"},{"issue":"6","key":"10.1016\/0164-1212(90)90086-2_BIB9","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TSE.1980.234507","article-title":"Redundancy in Data Structures: Improving Software Fault Tolerance","volume":"SE-6","author":"Taylor","year":"1980","journal-title":"IEEE Trans. Software Eng."},{"issue":"6","key":"10.1016\/0164-1212(90)90086-2_BIB10","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/TSE.1980.230803","article-title":"Redundancy in Data Structures: Some Theoretical Results","volume":"SE-6","author":"Taylor","year":"1980","journal-title":"IEEE Trans. Software Eng."},{"issue":"7","key":"10.1016\/0164-1212(90)90086-2_BIB11","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/TC.1982.1676057","article-title":"Principles of Data Structure Error Correction","volume":"C-31","author":"Taylor","year":"1982","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0164-1212(90)90086-2_BIB12","series-title":"Digest of Papers: 15th Annual Int. Symp. on Fault-Tolerant Computing","first-page":"20","article-title":"Guidelines for Storage Structure Error Correction","author":"Taylor","year":"1985"},{"issue":"3","key":"10.1016\/0164-1212(90)90086-2_BIB13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1093\/comjnl\/29.3.269","article-title":"A Locally Correctable B-Tree Implementation","volume":"29","author":"Taylor","year":"1986","journal-title":"Computer J."},{"issue":"4","key":"10.1016\/0164-1212(90)90086-2_BIB14","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TC.1986.1676761","article-title":"Robust Storage Structures for Crash Recovery","volume":"C-35","author":"Taylor","year":"1986","journal-title":"IEEE Trans. Computers"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121290900862?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121290900862?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T22:57:39Z","timestamp":1552604259000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0164121290900862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0164121290900862"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(90)90086-2","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}