{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T09:10:42Z","timestamp":1672305042805},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90175-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"113-129","source":"Crossref","is-referenced-by-count":11,"title":["The complexity of matrix transposition on one-tape off-line Turing machines"],"prefix":"10.1016","volume":"82","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Maass","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90175-2_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0020-0190(89)90160-9","article-title":"The speed of copying on one-tape off-line Turing machines","volume":"33","author":"Dietzfelbinger","year":"1989","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0304-3975(91)90175-2_BIB2","series-title":"Proc. 15th ICALP","first-page":"188","article-title":"The complexity of matrix transposition on one-tape off-line Turing machines with output tape","volume":"317","author":"Dietzfelbinger","year":"1988"},{"key":"10.1016\/0304-3975(91)90175-2_BIB3","first-page":"127","article-title":"Two nonlinear lower bounds","author":"Duris","year":"1983","journal-title":"Proc. 15th ACM STOC"},{"key":"10.1016\/0304-3975(91)90175-2_BIB4","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u00f6s","year":"1935","journal-title":"Compositio Math."},{"key":"10.1016\/0304-3975(91)90175-2_BIB5","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90175-2_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(91)90175-2_BIB7","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","article-title":"On time versus space","volume":"24","author":"Hopcroft","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90175-2_BIB8","series-title":"Structure in Complexity Theory, Proceedings","first-page":"219","article-title":"On the power of the queue","volume":"223","author":"Li","year":"1986"},{"key":"10.1016\/0304-3975(91)90175-2_BIB9","series-title":"Proc. 7th Internat. Conf. Logic, Methodology, and Philosophy of Science","article-title":"Are recursion theoretic arguments useful in complexity theory?","author":"Maass","year":"1985"},{"key":"10.1016\/0304-3975(91)90175-2_BIB10","first-page":"401","article-title":"Quadratic lower bounds for deterministic and nondeterministic one-tape Turing machines","author":"Maass","year":"1984","journal-title":"Proc. 16th ACM STOC"},{"key":"10.1016\/0304-3975(91)90175-2_BIB11","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1090\/S0002-9947-1985-0808746-4","article-title":"Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines","volume":"292","author":"Maass","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(91)90175-2_BIB12","series-title":"Structure in Complexity Theory, Proceedings","first-page":"249","article-title":"An optimal lower bound for Turing machines with one work tape and a two-way input tape","volume":"223","author":"Maass","year":"1986"},{"key":"10.1016\/0304-3975(91)90175-2_BIB13","first-page":"94","article-title":"Two tapes are better than one for off-line Turing machines","author":"Maass","year":"1987","journal-title":"Proc. 19th ACM STOC"},{"key":"10.1016\/0304-3975(91)90175-2_BIB14","series-title":"Gesellschaft f\u00fcr Informatik, 3. Jahrestagung","first-page":"72","article-title":"Optimales Transponieren quadratischer Matrizen","volume":"1","author":"Paul","year":"1973"},{"key":"10.1016\/0304-3975(91)90175-2_BIB15","series-title":"Proc. 2nd Internat. Conf. Fund. Computation Theory","first-page":"325","article-title":"Kolmogorov complexity and lower bounds","author":"Paul","year":"1979"},{"key":"10.1016\/0304-3975(91)90175-2_BIB16","first-page":"53","article-title":"On-line simulation of k + 1 tapes by k tapes requires nonlinear time","author":"Paul","year":"1982","journal-title":"Proc. 23rd IEEE FOCS"},{"key":"10.1016\/0304-3975(91)90175-2_BIB17","first-page":"429","article-title":"On determinism versus nondeterminism and related problems","author":"Paul","year":"1983","journal-title":"Proc. 24th IEEE FOCS"},{"key":"10.1016\/0304-3975(91)90175-2_BIB18","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF00571465","article-title":"Rangierkomplexit\u00e4t von Permutationen","volume":"2","author":"Stoss","year":"1973","journal-title":"Acta Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901752?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901752?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:44Z","timestamp":1555077404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591901752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0304397591901752"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90175-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}