{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:51Z","timestamp":1725663051178},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:51:09Z","timestamp":1330195869000},"page":"95-104","source":"Crossref","is-referenced-by-count":32,"title":["Parallel RAMs with owned global memory and deterministic context-free language recognition"],"prefix":"10.1007","author":[{"given":"P. W.","family":"Dymond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. L.","family":"Ruzzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0019-9958(83)80049-7","volume":"56","author":"Braunm\u00fchl","year":"1983","unstructured":"von Braunm\u00fchl, Cook, Mehlhorn, and Verbeek, The recognition of deterministic CFL's in small time and space, Information and Control 56, (1983) 34\u201351.","journal-title":"Information and Control"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"S.A. Cook, Deterministic CFL's are accepted simultaneously in polynomial time and log squared space, 11th ACM STOC(1979) 338\u2013345.","DOI":"10.1145\/800135.804426"},{"key":"11_CR3","unstructured":"S.A.Cook, C.Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, preprint, 1983."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"P.W. Dymond and S.A. Cook, Hardware complexity and parallel computation, Proc. 21st IEEE Symposium on Foundations of Computer Science, (1980) 360\u2013372.","DOI":"10.1109\/SFCS.1980.22"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"P.W. Dymond and W.L. Ruzzo, Parallel RAM's with owned global memory and deterministic context-free language recognition, Technical Report, 1986.","DOI":"10.1007\/3-540-16761-7_59"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"S. Fortune and P. Wyllie, Parallelism in random access machines, 10th ACM STOC(1978), 114\u2013118.","DOI":"10.1145\/800133.804339"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","volume":"29","author":"L.M. Goldschlager","year":"1982","unstructured":"L.M. Goldschlager, A unified approach to models of synchronous parallel machines, J. ACM 29, (1982) 1073\u20131086.","journal-title":"J. ACM"},{"key":"11_CR8","unstructured":"M. Harrison, Introduction to Formal Language Theory, Addison Wesley, 1979."},{"key":"11_CR9","first-page":"119","volume":"19","author":"T. Harju","year":"1979","unstructured":"T. Harju, A simulation result for the auxiliary pushdown automata, JCSS 19 (1979), 119\u2013132.","journal-title":"JCSS"},{"key":"11_CR10","unstructured":"P.N. Klein and J. Reif, Parallel Time O(log n) acceptance of deterministic CFL's, Harvard University Aiken Computation Laboratory, Technical Report TR-05-84."},{"key":"11_CR11","first-page":"218","volume":"21","author":"W.L. Ruzzo","year":"1980","unstructured":"W.L. Ruzzo, Tree-size bounded alternation, JCSS 21 (1980) 218\u2013235.","journal-title":"JCSS"},{"key":"11_CR12","unstructured":"W.L. Ruzzo, The equivalence of hardware modification machines and restricted parallel random access machines, preprint, 1984."},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I. Sudborough","year":"1978","unstructured":"I. Sudborough, On tape complexity of deterministic context-free languages, JACM 25 (1978)405\u2013414","journal-title":"JACM"},{"key":"11_CR14","unstructured":"M. Snir, personal communication."},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L.J. Stockmeyer","year":"1984","unstructured":"L.J. Stockmeyer and U. Vishkin, Simulation of random access machines by circuits, SIAM J. on Computing 13, (1984) 409\u2013422.","journal-title":"SIAM J. on Computing"},{"key":"11_CR16","unstructured":"U. Vishkin, Synchronous parallel computation \u2014 a survey, TR-71, Dept. of Computer Science, Courant Institute NYU, (1983)."},{"key":"11_CR17","unstructured":"J.C. Wyllie, The complexity of parallel computations, TR 79-387, Dept. of Computer Science, Cornell University, (1979)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:51Z","timestamp":1605643851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}