{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:12:34Z","timestamp":1648656754226},"reference-count":25,"publisher":"Elsevier BV","issue":"1","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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90116-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"19-36","source":"Crossref","is-referenced-by-count":5,"title":["Efficient simulations of simple models of parallel computation by time-bounded ATMs and space-bounded TMs"],"prefix":"10.1016","volume":"68","author":[{"given":"Jik H.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Palis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(89)90116-3_BIB1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TC.1985.1676551","article-title":"A generalized dictionary machine for VLSI","volume":"34","author":"Atallah","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0304-3975(89)90116-3_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(89)90116-3_BIB3","series-title":"Tech. Rep. TR 85-47","article-title":"Efficient simulations of simple models of parallel computation by space-bounded TMs and time-bounded alternating TMs","author":"Chang","year":"1985"},{"key":"10.1016\/0304-3975(89)90116-3_BIB4","first-page":"455","article-title":"On the power of one-way communication","author":"Chang","year":"1986","journal-title":"Proc. IEEE 27th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90116-3_BIB5","first-page":"669","article-title":"Systolic tree implementation of data structures","author":"Chang","year":"1986","journal-title":"Proc. International Conference on Parallel Processing"},{"issue":"3","key":"10.1016\/0304-3975(89)90116-3_BIB6","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TPAMI.1984.4767522","article-title":"Parallel parsing and VLSI implementations for syntactic pattern recognition","volume":"6","author":"Chiang","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"10.1016\/0304-3975(89)90116-3_BIB7","first-page":"346","article-title":"Real-time computation by n-dimensional iterative arrays of finite-state machines","volume":"18","author":"Cole","year":"1969","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(89)90116-3_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90043-4","article-title":"Iterative tree automata","volume":"32","author":"Culik","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90116-3_BIB9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/00207168608803543","article-title":"Iterative tree arrays with logarithmic depth","volume":"20","author":"Culik","year":"1986","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0304-3975(89)90116-3_BIB10","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0019-9958(81)90598-2","article-title":"Triangle cellular automata","volume":"48","author":"Dyer","year":"1981","journal-title":"Inform. and Control"},{"issue":"4","key":"10.1016\/0304-3975(89)90116-3_BIB11","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","article-title":"A universal interconnection pattern for parallel computers","volume":"29","author":"Goldschlager","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(89)90116-3_BIB12","first-page":"509","article-title":"Direct VLSI implementation of combinatorial algorithms","author":"Guibas","year":"1979","journal-title":"Proc. Caltech Conference on VLSI"},{"key":"10.1016\/0304-3975(89)90116-3_BIB13","series-title":"Iterative Arrays of Logic Circuits","author":"Hennie","year":"1987"},{"key":"10.1016\/0304-3975(89)90116-3_BIB14","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(89)90116-3_BIB15","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/0214033","article-title":"Sequential machine characterizations of trellis and cellular automata and applications","volume":"14","author":"Ibarra","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/0304-3975(89)90116-3_BIB16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TC.1986.5009430","article-title":"Designing systolic algorithms using sequential machines","volume":"35","author":"Ibarra","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0304-3975(89)90116-3_BIB17","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/0022-0000(89)90011-1","article-title":"On iterative and cellular tree arrays","volume":"38","author":"Ibarra","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90116-3_BIB18","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/T-C.1974.223995","article-title":"On some open problems in the theory of cellular automata","volume":"23","author":"Kosaraju","year":"1974","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0304-3975(89)90116-3_BIB19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0204028","article-title":"Speed of recognition of context-free languages by array automata","volume":"4","author":"Kosaraju","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90116-3_BIB20","first-page":"218","article-title":"Tree-size bounded alternation","volume":"21","author":"Ruzzo","year":"1980","journal-title":"J. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90116-3_BIB21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90116-3_BIB22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00289248","article-title":"Iterative arrays with direct central control","volume":"8","author":"Seiferas","year":"1977","journal-title":"Acta Inform."},{"issue":"9","key":"10.1016\/0304-3975(89)90116-3_BIB23","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/TC.1985.1676640","article-title":"An efficient unsorted VLSI dictionary machine","volume":"34","author":"Somani","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0304-3975(89)90116-3_BIB24","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random-access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90116-3_BIB25","series-title":"Technical Report UILU-ENG-86-2202 ACT-66","article-title":"Simulations among multidimensional iterative arrays, iterative tree automata, and alternating Turing machines","author":"Trahan","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901163?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:18Z","timestamp":1555077378000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901163"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90116-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}