{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:10Z","timestamp":1760202490426,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,7,30]],"date-time":"2004-07-30T00:00:00Z","timestamp":1091145600000},"content-version":"vor","delay-in-days":4959,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/0304-3975(91)90391-e","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T13:17:57Z","timestamp":1032268677000},"page":"289-302","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"title":["Space bounded computations: review and new separation results"],"prefix":"10.1016","volume":"80","author":[{"given":"Desh","family":"Ranjan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juris","family":"Hartmanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(91)90391-E_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = ?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90391-E_BIB2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0022-0000(75)80052-3","article-title":"Space bounds for processing counterless inputs","volume":"11","author":"Freedman","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90391-E_BIB3","first-page":"158","article-title":"On the worktime of deterministic and non-deterministic turing machines","volume":"23","author":"Freivalds","year":"1979","journal-title":"Latvijskij Matematiceskij Eshegodnik"},{"key":"10.1016\/0304-3975(91)90391-E_BIB4","unstructured":"V. Geffert, Nondeterministic computations in sublogarithmic space and space constructibility ICALP '90, to appear."},{"key":"10.1016\/0304-3975(91)90391-E_BIB5","first-page":"82","article-title":"Some observations about space bounded computations","volume":"35","author":"Hartmanis","year":"1988","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(91)90391-E_BIB6","first-page":"1","article-title":"On the LBA problem and its importance in the theory of computation","volume":"7","author":"Hartmanis","year":"1974","journal-title":"SIAM-AMS"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","key":"10.1016\/0304-3975(91)90391-E_BIB7"},{"key":"10.1016\/0304-3975(91)90391-E_BIB8","series-title":"Proc. Structure in Complexity Theory Third Annu. Conf.","first-page":"112","article-title":"Nondeterministic space is closed under complement","author":"Immerman","year":"1988"},{"key":"10.1016\/0304-3975(91)90391-E_BIB9","first-page":"344","article-title":"Alternation and the power of nondeterminism","author":"Kannan","year":"1983","journal-title":"ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90391-E_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linearly-bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90391-E_BIB11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/FOCS.1965.14","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965","journal-title":"IEEE Conf. Record on Switching Circuit Theory and Logic Design"},{"key":"10.1016\/0304-3975(91)90391-E_BIB12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90391-E_BIB13","series-title":"Technical Report CSD-TR 187","article-title":"A note on notions of tape constructibility","author":"Seiferas","year":"1976"},{"key":"10.1016\/0304-3975(91)90391-E_BIB14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","article-title":"Halting space-bounded computations","volume":"10","author":"Sipser","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90391-E_BIB15","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965","journal-title":"1965 IEEE Conf. Record on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0304-3975(91)90391-E_BIB16","first-page":"96","article-title":"The method of forcing for nondeterministic automata","volume":"33","author":"Szelepcs\u00e9nyi","year":"1987","journal-title":"Bull. EATCS"},{"year":"1988","series-title":"Some notes on strong and weak log log n space complexity","author":"Szepietowski","key":"10.1016\/0304-3975(91)90391-E_BIB17"},{"key":"10.1016\/0304-3975(91)90391-E_BIB18","series-title":"STACS '89","first-page":"251","article-title":"If deterministic and nondeterministic space complexity are equal for log log n then they are equal for log n","volume":"349","author":"Szepietowski","year":"1989"},{"key":"10.1016\/0304-3975(91)90391-E_BIB19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0022-0000(85)90040-6","article-title":"Relativized circuit complexity","volume":"31","author":"Wilson","year":"1985","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/0304-3975(91)90391-E_BIB20","series-title":"Structure in Complexity Theory","first-page":"362","article-title":"Parallel computation and the NC hierarchy relativized","volume":"223","author":"Wilson","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190391E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190391E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:59Z","timestamp":1757477939000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190391E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991]]}},"alternative-id":["030439759190391E"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90391-e","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Space bounded computations: review and new separation results","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(91)90391-E","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}