{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:08:49Z","timestamp":1775779729270,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf01704903","type":"journal-article","created":{"date-parts":[[2005,6,10]],"date-time":"2005-06-10T17:03:11Z","timestamp":1118422991000},"page":"13-28","source":"Crossref","is-referenced-by-count":12,"title":["On time versus space III"],"prefix":"10.1007","volume":"19","author":[{"given":"Joseph Y.","family":"Halpern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael C.","family":"Loui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert R.","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Weise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01704903_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01752397","volume":"14","author":"L. M. Adleman","year":"1981","unstructured":"Adleman, L. M., and Loui, M. C. (1981), Space-bounded simulation of multitape Turing machines,Math. Systems Theory 14, 215\u2013222.","journal-title":"Math. Systems Theory"},{"key":"BF01704903_CR2","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0022-0000(82)90005-8","volume":"25","author":"J. L. Bentley","year":"1982","unstructured":"Bentley, J. L., and Brown, D. J. (1982), A general class of resource trade-offs,J. Comput. System Sci. 25, 214\u2013238.","journal-title":"J. Comput. System Sci."},{"key":"BF01704903_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0211022","volume":"11","author":"A. Borodin","year":"1982","unstructured":"Borodin, A., and Cook, S. (1982), A time-space tradeoff for sorting on a general sequential model of computation,SIAM J. Comput. 11, 287\u2013297.","journal-title":"SIAM J. Comput."},{"key":"BF01704903_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0022-0000(85)90011-X","volume":"30","author":"P. W. Dymond","year":"1985","unstructured":"Dymond, P. W., and Tompa, M. (1985), Speedups of deterministic machines by synchronous parallel machines,J. Comput. System Sci. 30, 149\u2013161.","journal-title":"J. Comput. System Sci."},{"key":"BF01704903_CR5","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/322003.322015","volume":"24","author":"J. Hopcroft","year":"1977","unstructured":"Hopcroft, J., Paul, W., and Valiant, L. (1977). On time versus space,J. Assoc. Comput. Mach. 24 332\u2013337.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704903_CR6","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1145\/321466.321474","volume":"15","author":"J. E. Hopcroft","year":"1968","unstructured":"Hopcroft, J. E., and Ullman, J. D. (1968), Relations between time and tape complexities,J. Assoc. Comput. Mach. 15, 414\u2013427.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704903_CR7","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"Hopcroft, J. E., and Ullman, J. D. (1979),Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass."},{"key":"BF01704903_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(81)90084-0","volume":"15","author":"M. C. Loui","year":"1981","unstructured":"Loui, M. C. (1981), A space bound for one-tape multidimensional Turing machines,Theoret. Comput. Sci. 15, 311\u2013320.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01704903_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/B978-0-12-389450-2.50014-1","volume-title":"Perspectives on Computer Science","author":"A. R. Meyer","year":"1977","unstructured":"Meyer, A. R., and Shamos, M. I. (1977), Time and space, inPerspectives on Computer Science, ed. A. K. Jones, Academic Press, New York, pp. 125\u2013146."},{"key":"BF01704903_CR10","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/S0022-0000(72)80017-5","volume":"6","author":"M. S. Paterson","year":"1972","unstructured":"Paterson, M. S. (1972), Tape bounds for time-bounded Turing machines,J. Comput. System Sci. 6, 116\u2013124.","journal-title":"J. Comput. System Sci."},{"key":"BF01704903_CR11","first-page":"97","volume-title":"SIAM-AMS Proceedings, 7","author":"M. S. Paterson","year":"1974","unstructured":"Paterson, M. S., Fischer, M. J., and Meyer, A. R. (1974), An improved overlap argument for on-line multiplication,SIAM-AMS Proceedings, 7, Amer. Math. Soc., Providence, R.I., pp. 97\u2013111."},{"key":"BF01704903_CR12","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(81)90035-0","volume":"22","author":"W. Paul","year":"1981","unstructured":"Paul, W., and Reischuk, R. (1981), On time versus space II,J. Comput. System Sci. 22, 312\u2013327.","journal-title":"J. Comput. System Sci."},{"key":"BF01704903_CR13","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A. Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A. (1980), Storage modification machines,SIAM J. Comput. 9, 490\u2013508.","journal-title":"SIAM J. Comput."},{"key":"BF01704903_CR14","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"18","author":"R. E. Tarjan","year":"1979","unstructured":"Tarjan, R. E. (1979), A class of algorithms which require nonlinear time to maintain disjoint sets,J. Comput. System Sci. 18, 110\u2013127.","journal-title":"J. Comput. System Sci."},{"key":"BF01704903_CR15","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0022-0000(80)90056-2","volume":"20","author":"M. Tompa","year":"1980","unstructured":"Tompa, M. (1980), Time-space tradeoffs for computing functions, using connectivity properties of their circuits.J. Comput. System Sci. 20, 118\u2013132.","journal-title":"J. Comput. System Sci."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01704903.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01704903\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01704903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T12:31:32Z","timestamp":1557318692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01704903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01704903"],"URL":"https:\/\/doi.org\/10.1007\/bf01704903","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}