{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:59Z","timestamp":1725662939374},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164869"},{"type":"electronic","value":"9783540398257"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16486-3_103","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:45:50Z","timestamp":1330195550000},"page":"249-264","source":"Crossref","is-referenced-by-count":7,"title":["An optimal lower bound for turing machines with one work tape and a two-way input tape"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Maass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"P. Duris, Z. Galil, W.J. Paul, and R. Reischuk, Two nonlinear lower bounds, Proc. 15th ACM STOC (1983) 127\u2013132.","DOI":"10.1145\/800061.808741"},{"key":"19_CR2","first-page":"464","volume":"2","author":"P. Erd\u00f6s","year":"1935","unstructured":"P. Erd\u00f6s and G. Szekeres, A combinatorial problem in Geometry, Composito Math. 2(1935) 464\u2013470.","journal-title":"Composito Math."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","volume":"8","author":"F.C. Hennie","year":"1965","unstructured":"F.C. Hennie, One-tape off-line Turing machine computations, Inf. and Control 8(1965) 553\u2013578.","journal-title":"Inf. and Control"},{"key":"19_CR4","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory. Languages and Computation, Addison-Wesley (Reading, 1979)."},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","volume":"24","author":"J.E. Hopcroft","year":"1977","unstructured":"J.E. Hopcroft, W.J. Paul, and L. Valiant. On time versus space. J. of the ACM 24 (1977) 332\u2013337.","journal-title":"J. of the ACM"},{"key":"19_CR6","volume-title":"Proc. of the 7th International Conference on Logic","author":"W. Maass","year":"1983","unstructured":"W. Maass, Are recursion theoretic arguments useful in complexity theory? Proc. of the 7th International Conference on Logic, Methodology and Philosophy of Science, Salzburg 1983 (North-Holland, Amsterdam 1985)."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"W. Maass, Quadratic lower bounds for deterministic and non-deterministic one-tape Turing machines, Proc. of the 16th ACM STOC (1984) 401\u2013408.","DOI":"10.1145\/800057.808706"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1090\/S0002-9947-1985-0808746-4","volume":"292","author":"W. Maass","year":"1985","unstructured":"W. Maass, Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines, Trans. of the Amer. Math. Soc. 292(1985) 675\u2013693.","journal-title":"Trans. of the Amer. Math. Soc."},{"key":"19_CR9","first-page":"325","volume-title":"Proc. of the Second Int. Conf. on Fund. of Computation Theory","author":"W.J. Paul","year":"1979","unstructured":"W.J. Paul, Kolmogorov complexity and lower bounds, Proc. of the Second Int. Conf. on Fund. of Computation Theory, L. Budach ed., 325\u2013334 (Akademie-Verlag, Berlin 1979)."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"W.J. Paul, On-line simulation of k+1 tapes by k tapes requires nonlinear time, Proc. 23rd IEEE FOCS (1982) 53\u201356.","DOI":"10.1109\/SFCS.1982.31"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"W.J. Paul, N. Pippenger, E. Szemeredi and W. Trotter, On determinism versus nondeterminism and related problems, Proc. 24th IEEE FOCS (1983) 429\u2013438.","DOI":"10.1109\/SFCS.1983.39"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF00571465","volume":"2","author":"H.J. Stoss","year":"1973","unstructured":"H.J. Stoss, Rangierkomplexit\u00e4t von Permutationen, Acta Informatica 2 (1973) 80\u201396.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Structure in Complexity Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16486-3_103.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:28Z","timestamp":1605643828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16486-3_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164869","9783540398257"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-16486-3_103","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}