{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:04:52Z","timestamp":1648767892146},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":[[1993,9]]},"DOI":"10.1016\/0020-0190(93)90035-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"215-219","source":"Crossref","is-referenced-by-count":3,"title":["A bounded-space tree traversal algorithm"],"prefix":"10.1016","volume":"47","author":[{"given":"D.S.","family":"Hirschberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Seiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90035-8_BIB1","doi-asserted-by":"crossref","unstructured":"A. Fiat, J.I. Munro, M. Naor, A. Sch\u00e4ffer, J.P. Schmidt and A. Seigal, An implicit data structure for searching a multikey table in logarithmic time, J. Comput. System Sci., to appear","DOI":"10.1016\/0022-0000(91)90022-W"},{"key":"10.1016\/0020-0190(93)90035-8_BIB2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/322358.322364","article-title":"Implicit data structures for the dictionary problem","volume":"30","author":"Frederickson","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90035-8_BIB3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1137\/0215076","article-title":"Average case analysis of marking algorithms","volume":"15","author":"Hirschberg","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90035-8_BIB4","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(93)90035-8_BIB5","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."},{"key":"10.1016\/0020-0190(93)90035-8_BIB6","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"},{"key":"10.1016\/0020-0190(93)90035-8_BIB7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","article-title":"An implicit data structure supporting insertion, deletion, and search in O(log2n) time","volume":"33","author":"Munro","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90035-8_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/367177.367202","article-title":"Symbol manipulation and threaded lists","volume":"3","author":"Perlis","year":"1960","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90035-8_BIB9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0020-0190(73)90018-5","article-title":"An improved algorithm for traversing binary trees without auxiliary stack","volume":"2","author":"Robson","year":"1973","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90035-8_BIB10","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/363534.363554","article-title":"An efficient machine independent procedure for garbage collection in various list structures","volume":"10","author":"Schorr","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90035-8_BIB11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(72)90048-8","article-title":"Fast and read-only algorithms for traversing trees without an auxiliary stack","volume":"1","author":"Sikl\u00f2ssy","year":"1972","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90035-8_BIB12","author":"Standish","year":"1980"},{"key":"10.1016\/0020-0190(93)90035-8_BIB13","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1109\/TC.1972.5009079","article-title":"A space-efficient list structure tracing algorithm","volume":"21","author":"Wegbreit","year":"1972","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900358?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900358?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:55Z","timestamp":1555129675000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093900358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0020019093900358"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90035-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}