{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T16:10:30Z","timestamp":1736007030263,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281931"},{"type":"electronic","value":"9783540318736"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_13","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:00:06Z","timestamp":1127829606000},"page":"137-148","source":"Crossref","is-referenced-by-count":1,"title":["Translational Lemmas for Alternating TMs and PRAMs"],"prefix":"10.1007","author":[{"given":"Chuzo","family":"Iwamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Nakashiba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenichi","family":"Morita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsunobu","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. Chandra","year":"1981","unstructured":"Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. Assoc. Comput. Mach.\u00a028, 114\u2013133 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/0203014","volume":"3","author":"O.H. Ibarra","year":"1974","unstructured":"Ibarra, O.H.: A hierarchy theorem for polynomial-space recognition. SIAM J. Comput.\u00a03(3), 184\u2013187 (1974)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1137\/0214033","volume":"14","author":"O.H. Ibarra","year":"1985","unstructured":"Ibarra, O.H., Kim, S.M., Moran, S.: Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Comput.\u00a014(2), 426\u2013447 (1985)","journal-title":"SIAM J. Comput."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Iwama, K., Iwamoto, C.: Parallel complexity hierarchies based on PRAMs and DLOGTIME-uniform circuits. In: Proc. 11th Ann. IEEE Conf. on Computational Complexity, Philadelphia, pp. 24\u201332 (1996)","DOI":"10.1109\/CCC.1996.507665"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-31834-7_17","volume-title":"Machines, Computations, and Universality","author":"C. Iwamoto","year":"2005","unstructured":"Iwamoto, C., Hatayama, N., Morita, K., Imai, K., Wakamatsu, D.: Hierarchies of DLOGTIME-uniform circuits. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 211\u2013222. Springer, Heidelberg (2005)"},{"key":"13_CR8","first-page":"869","volume-title":"Handbook of Theoretical Computer Science","author":"R.M. Karp","year":"1990","unstructured":"Karp, R.M., Ramachandran, V.: Parallel algorithms for shared-memory machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 869\u2013941. MIT Press, Amsterdam (1990)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W.L. Ruzzo","year":"1981","unstructured":"Ruzzo, W.L.: On uniform circuit complexity. J. Comput. System Sci.\u00a022, 365\u2013383 (1981)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L. Stockmeyer","year":"1984","unstructured":"Stockmeyer, L., Vishkin, U.: Simulation of parallel random access machines by circuits. SIAM J. Comput.\u00a013(2), 409\u2013422 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:42:59Z","timestamp":1736005379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11537311_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}