{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:32:02Z","timestamp":1649111522539},"reference-count":5,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90024-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"179-183","source":"Crossref","is-referenced-by-count":1,"title":["Two tagless variations on the Deutsch-Schorr-waite algorithm"],"prefix":"10.1016","volume":"22","author":[{"given":"Mark C.","family":"Hamburg","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(86)90024-4_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/356850.356854","article-title":"Garbage collection of linked data structures","volume":"13","author":"Cohen","year":"1981","journal-title":"Computing Surveys"},{"key":"10.1016\/0020-0190(86)90024-4_BIB2","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/0020-0190(86)90024-4_BIB3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(73)90012-4","article-title":"Scanning list structures without stacks or tag bits","volume":"2","author":"Lindstrom","year":"1973","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/0020-0190(86)90024-4_BIB4","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1145\/360924.360936","article-title":"Copying list structures using bounded workspace","volume":"17","author":"Lindstrom","year":"1974","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/0020-0190(86)90024-4_BIB5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(79)90068-1","article-title":"Traversing binary trees simply and cheaply","volume":"9","author":"Morris","year":"1979","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:29:21Z","timestamp":1553592561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086900244"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90024-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}