{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:26:57Z","timestamp":1757626017279,"version":"3.44.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,4,15]],"date-time":"2003-04-15T00:00:00Z","timestamp":1050364800000},"content-version":"vor","delay-in-days":4944,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0166-218x(89)90043-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"19-26","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new complete language for DSPACE(log n)"],"prefix":"10.1016","volume":"25","author":[{"given":"Jian-er","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(89)90043-7_BIB1","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(89)90043-7_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"issue":"3","key":"10.1016\/0166-218X(89)90043-7_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0166-218X(89)90043-7_BIB4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","article-title":"Relations among complexity measures","volume":"26","author":"Fischer","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(89)90043-7_BIB5","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BF00289513","article-title":"On non-determinacy in simple computing devices","volume":"1","author":"Hartmanis","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(89)90043-7_BIB6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","article-title":"On two-way multihead automata","volume":"7","author":"Ibarra","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(89)90043-7_BIB7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(89)90043-7_BIB8","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(89)90043-7_BIB9","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1147\/rd.105.0388","article-title":"On multihead finite automata","volume":"10","author":"Rosenberg","year":"1966","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0166-218X(89)90043-7_BIB10","series-title":"Proceedings First Structure in Complexity Theory Conference","first-page":"362","article-title":"Parallel computation and the NC hierarchy relativized","author":"Wilson","year":"1986"},{"key":"10.1016\/0166-218X(89)90043-7_BIB11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/322063.322076","article-title":"k + 1 heads are better than k","volume":"25","author":"Yao","year":"1978","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:52:57Z","timestamp":1757451177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X89900437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0166218X89900437"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(89)90043-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new complete language for DSPACE(log n)","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(89)90043-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}