{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:32:01Z","timestamp":1648661521199},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"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":10577,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1016\/0022-0000(84)90017-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"118-132","source":"Crossref","is-referenced-by-count":2,"title":["Consistency in nondeterministic storage"],"prefix":"10.1016","volume":"29","author":[{"given":"Walter J.","family":"Savitch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick W.","family":"Dymond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90017-5_BIB1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01744301","article-title":"On relativizing auxiliary pushdown machines","volume":"13","author":"Angluin","year":"1980","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(84)90017-5_BIB2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(81)90061-X","article-title":"Bounded query machines: On NP and PSPACE","volume":"15","author":"Book","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90017-5_BIB3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0304-3975(81)90062-1","article-title":"Bounded query machines: On NP() and NPQUERY()","volume":"15","author":"Book","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90017-5_BIB4","series-title":"Proceedings, Third Annual Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(84)90017-5_BIB5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90017-5_BIB6","series-title":"Proceedings, 21st IEEE Symposium on Foundations of Computer Science","first-page":"348","article-title":"Similarity and duality of computation","author":"Wei","year":"1980"},{"key":"10.1016\/0022-0000(84)90017-5_BIB7","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/322033.322037","article-title":"Log space recognition and translation of parenthesis languages","volume":"24","author":"Lynch","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90017-5_BIB8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","article-title":"Relativization of questions about log space computability","volume":"10","author":"Ladner","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(84)90017-5_BIB9","series-title":"Proceedings, 14th ACM Symposium on Theory of Computing","article-title":"Space-bounded hierarchies and probabilistic computations","author":"Ruzzo","year":"1982"},{"key":"10.1016\/0022-0000(84)90017-5_BIB10","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\/0022-0000(84)90017-5_BIB11","article-title":"On Some Subrecursive Reducibilities","author":"Simon","year":"1977"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:30Z","timestamp":1550307090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0022000084900175"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90017-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}