{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:39:58Z","timestamp":1648831198807},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1016\/0022-0000(84)90019-9","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"359-378","source":"Crossref","is-referenced-by-count":8,"title":["Minimizing access pointers into trees and arrays"],"prefix":"10.1016","volume":"28","author":[{"given":"Michael C.","family":"Low","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90019-9_BIB1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1137\/0211008","article-title":"Analysis of a general mass storage system","volume":"11","author":"Coppersmith","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90019-9_BIB2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing\u2014A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0022-0000(84)90019-9_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0020-0190(76)90050-8","article-title":"Two fast simulations which imply some fast string matching and palindrome recognition algorithms","volume":"4","author":"Galil","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(84)90019-9_BIB4","series-title":"Proceedings, 9th Annual ACM Symposium on Theory of Computing","first-page":"49","article-title":"A new representation for linear lists","author":"Guibas","year":"1977"},{"key":"10.1016\/0022-0000(84)90019-9_BIB5","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","article-title":"Two-tape simulation of multitape Turing machines","volume":"13","author":"Hennie","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90019-9_BIB6","author":"Knuth","year":"1968"},{"key":"10.1016\/0022-0000(84)90019-9_BIB7","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(84)90019-9_BIB8","series-title":"Proceedings 11th Annual ACM Symposium on Theory of Computing","first-page":"346","article-title":"Real-time simulation of concatenable double-ended queues by double-ended queues","author":"Kosaraju","year":"1979"},{"key":"10.1016\/0022-0000(84)90019-9_BIB9","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/322234.322246","article-title":"New real-time simulations of multihead tape units","volume":"28","author":"Leong","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90019-9_BIB10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(89)90081-9","article-title":"Simulations among multidimensional Turing machines","volume":"21","author":"Loui","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90019-9_BIB11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/0212030","article-title":"Optimal dynamic embedding of trees into arrays","volume":"12","author":"Loui","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90019-9_BIB12","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0022-0000(81)90009-X","article-title":"An information-theoretic approach to time bounds for on-line computation","volume":"23","author":"Paul","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90019-9_BIB13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(81)90035-0","article-title":"On the versus space, II","volume":"22","author":"Paul","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90019-9_BIB14","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"17","article-title":"Probabilistic simulations","author":"Pippenger","year":"1982"},{"key":"10.1016\/0022-0000(84)90019-9_BIB15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(82)90037-8","article-title":"A fast implementation of a multidimensional storage into a tree storage","volume":"19","author":"Reischuk","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90019-9_BIB16","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/BF02242349","article-title":"Zwei-Band Simulation von Turing Maschinen","volume":"7","author":"Stoss","year":"1971","journal-title":"Computing"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:28Z","timestamp":1550325088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["0022000084900199"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90019-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}