{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:38:11Z","timestamp":1648903091641},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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,10]]},"DOI":"10.1016\/0020-0190(93)90078-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"313-318","source":"Crossref","is-referenced-by-count":2,"title":["Linear speed-up does not hold on Turing machines with tree storages"],"prefix":"10.1016","volume":"47","author":[{"given":"Martin","family":"H\u00fchne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90078-N_BIB1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1090\/S0002-9947-1969-0249212-8","article-title":"On the minimum computation time of functions","volume":"142","author":"Cook","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(93)90078-N_BIB2","first-page":"285","article-title":"Speed-up without tape compression","author":"Geffert","year":"1990"},{"key":"10.1016\/0020-0190(93)90078-N_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(93)90078-N_BIB4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/PGEC.1966.264374","article-title":"On-line Turing machine computations","volume":"15","author":"Hennie","year":"1966","journal-title":"IEEE Trans. Electronic Computers"},{"key":"10.1016\/0020-0190(93)90078-N_BIB5","series-title":"Proc. 16th Ann. Symp. on Foundations of Computer Science","first-page":"57","article-title":"On time versus space and related problems","author":"Hopcroft","year":"1975"},{"key":"10.1016\/0020-0190(93)90078-N_BIB6","first-page":"187","article-title":"Handbook of Theoretical Computer Science","volume":"Vol. A","author":"Li","year":"1990"},{"key":"10.1016\/0020-0190(93)90078-N_BIB7","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\/0020-0190(93)90078-N_BIB8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-0000(84)90019-9","article-title":"Minimizing access pointers into trees and arrays","volume":"28","author":"Loui","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90078-N_BIB9","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/0221056","article-title":"Optimal on-line simulations of tree machines by random access machines","volume":"21","author":"Loui","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90078-N_BIB10","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(81)90035-0","article-title":"On time versus space II","volume":"22","author":"Paul","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90078-N_BIB11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","article-title":"Relations among complexity measures","volume":"26","author":"Pippenger","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90078-N_BIB12","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\/0020-0190(93)90078-N_BIB13","series-title":"Leitf\u00e4den und Monographien der Informatik","article-title":"Einf\u00fchrung in die Komplexit\u00e4tstheorie","author":"Reischuk","year":"1990"},{"key":"10.1016\/0020-0190(93)90078-N_BIB14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0890-5401(92)90026-C","article-title":"Deterministic simulation of a single tape Turing Machine by a Random Access Machine in sublinear time","volume":"99","author":"Robson","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(93)90078-N_BIB15","series-title":"Computational Complexity","author":"Wagner","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390078N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390078N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:28:13Z","timestamp":1555144093000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390078N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002001909390078N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90078-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}