{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:47:43Z","timestamp":1725468463150},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055808","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"580-588","source":"Crossref","is-referenced-by-count":2,"title":["Improved time and space hierarchies of one-tape off-line TMs"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Chuzo","family":"Iwamoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"55_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(89)90160-9","volume":"33","author":"M. Dietzfelbinger","year":"1989","unstructured":"M. Dietzfelbinger, The speed of copying on one-tape off-line Turing machines, IPL\n                33 (1989) 83\u201389.","journal-title":"IPL"},{"key":"55_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(91)90175-2","volume":"82","author":"M. Dietzfelbinger","year":"1991","unstructured":"M. Dietzfelbinger, W. Maass and G. Schnitger, The complexity of matrix transposition on one-tape off-line Turing machines, TCS\n                82 (1991) 113\u2013129.","journal-title":"TCS"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"P.W. Dymond and M. Tompa, Speedups of deterministic machines by synchronous parallel machines, Proc. IEEE FOCS, 336\u2013343, 1983.","DOI":"10.1145\/800061.808763"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"M. F\u00fcrer, The tight deterministic time hierarchy, Proc. ACM STOC, 8\u201316, 1982.","DOI":"10.1145\/800070.802172"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90362-W","volume":"118","author":"V. Geffert","year":"1993","unstructured":"V. Geffert, A speed-up theorem without tape compression, TCS\n                118 (1993) 49\u201365.","journal-title":"TCS"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"S. Gupta, Alternating time versus deterministic time: a separation, Proc. IEEE FOCS, 266\u2013277, 1993.","DOI":"10.1109\/SCT.1993.336520"},{"key":"55_CR7","unstructured":"J. Hartmanis, P.M. Lewis and R.E. Stearns, Classification of computations by time and memory requirements, Proc. IFIP Congress, 266\u2013277, 1965."},{"key":"55_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/1994208","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"J. Hartmanis and R.E. Stearns, On the computational complexity of algorithms, Trans. Amer. Math. Soc.\n                117 (1965) 285\u2013306.","journal-title":"Trans. Amer. Math. Soc."},{"issue":"3","key":"55_CR9","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/0203014","volume":"3","author":"O.H. Ibarra","year":"1974","unstructured":"O.H. Ibarra, A hierarchy theorem for polynomial-space recognition, SIAM J. Comput.\n                3 3 (1974) 184\u2013187.","journal-title":"SIAM J. Comput."},{"key":"55_CR10","first-page":"56","volume":"11","author":"O.H. Ibarra","year":"1975","unstructured":"O.H. Ibarra and S.K. Sahni, Hierarchies of Turing machines with restricted tape alphabet size, JCSS\n                11 (1975) 56\u201367.","journal-title":"JCSS"},{"issue":"2","key":"55_CR11","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1137\/0212025","volume":"12","author":"O.H. Ibarra","year":"1983","unstructured":"O.H. Ibarra and S. Moran, Some time-space tradeoff results concerning single-tape and offline TM's, SIAM J. Comput.\n                12 2 (1983) 388\u2013394.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"55_CR12","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/0221042","volume":"21","author":"M. Li","year":"1992","unstructured":"M. Li, L. Longpr\u00e9 and P.M.B. Vit\u00e1nyi, The power of the queue, SIAM J. Comput.\n                21 4 (1992) 697\u2013712.","journal-title":"SIAM J. Comput."},{"key":"55_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0890-5401(88)90003-X","volume":"78","author":"M. Li","year":"1988","unstructured":"M. Li and P.M.B. Vit\u00e1nyi, Tape versus queue and stacks: the lower bounds, Inform. and Comput.\n                78 (1988) 56\u201385.","journal-title":"Inform. and Comput."},{"issue":"3","key":"55_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/0219034","volume":"19","author":"M. Li\u015akiewicz","year":"1990","unstructured":"M. Li\u015akiewicz and K. Lory\u015a, Fast simulations of time-bounded one-tape Turing machines by space-bounded ones, SIAM J. Comput.\n                19 3 (1990) 511\u2013521.","journal-title":"SIAM J. Comput."},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"W. Maass, Quadratic lower bounds for deterministic and nondeterministic one-tape Turing machines, Proc. IEEE FOCS, 401\u2013408, 1984.","DOI":"10.1145\/800057.808706"},{"issue":"1","key":"55_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/0216016","volume":"16","author":"W. Maass","year":"1987","unstructured":"W. Maass and A. Schorr, Speed-up of Turing machines with one work tape and a two-way input tape, SIAM J. Comput.\n                16 1 (1987) 195\u2013202.","journal-title":"SIAM J. Comput."},{"key":"55_CR17","doi-asserted-by":"crossref","unstructured":"W.J. Paul, N. Pippenger, E. Szemer\u00e9di, and W.T. Trotter, On determinism versus non-determinism and related problems, Proc. IEEE FOCS, 429\u2013438, 1983.","DOI":"10.1109\/SFCS.1983.39"},{"key":"55_CR18","first-page":"197","volume":"19","author":"W.J. Paul","year":"1979","unstructured":"W.J. Paul, On time hierarchies, JCSS\n                19 (1979) 197\u2013202.","journal-title":"JCSS"},{"key":"55_CR19","first-page":"73","volume":"14","author":"J.I. Seiferas","year":"1977","unstructured":"J.I. Seiferas, Techniques for separating space complexity classes, JCSS\n                14 (1977) 73\u201399.","journal-title":"JCSS"},{"key":"55_CR20","first-page":"100","volume":"14","author":"J.I. Seiferas","year":"1977","unstructured":"J.I. Seiferas, Relating refined space complexity classes, JCSS\n                14 (1977) 100\u2013129.","journal-title":"JCSS"},{"key":"55_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M. Sipser","year":"1980","unstructured":"M. Sipser, Halting space-bounded computations, TCS\n                10 (1980) 335\u2013338.","journal-title":"TCS"},{"issue":"2","key":"55_CR22","first-page":"100","volume":"26","author":"S. \u017d\u00e1k","year":"1979","unstructured":"S. \u017d\u00e1k, A Turing machine space hierarchy, Kybernetika, 26 2 (1979) 100\u2013121.","journal-title":"Kybernetika"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T23:13:55Z","timestamp":1549926835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0055808","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}