{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:00Z","timestamp":1725664500029},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:31:52Z","timestamp":1330277512000},"page":"286-297","source":"Crossref","is-referenced-by-count":9,"title":["Advocating ownership"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus-J\u00f6rn","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Reinhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"J. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity Theory I. Springer, 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"J. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity Theory II. Springer, 1990.","DOI":"10.1007\/978-3-642-75357-2"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"S. Cook","year":"1971","unstructured":"S. Cook. Characterizations of pushdown machines in terms of time-bounded computers. J. Assoc. Comp. Mach., 18:4\u201318, 1971.","journal-title":"J. Assoc. Comp. Mach."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"S. Cook. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space. In Proc. of the 11th Annual ACM Symp. on Theory of Computing, pages 338\u2013345, 1979.","DOI":"10.1145\/800135.804426"},{"key":"25_CR5","first-page":"201","volume":"80","author":"P. Dymond","year":"1989","unstructured":"P. Dymond and S. Cook. Complexity theory of parallel time and hardware. Inform. and Control, 80:201\u2013226, 1989.","journal-title":"Inform. and Control"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"P. Dymond and W. Ruzzo. Parallel RAMs with owned global memory and deterministic context-free language recoginition. In Proc. of the 13th ICALP, number 226 in LNCS, pages 95\u2013104. Springer, 1986.","DOI":"10.1007\/3-540-16761-7_59"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie. Parallelism in random access machines. In Proc. of the 10th Annual ACM Symposium on Theory of Computing, pages 114\u2013118, 1978.","DOI":"10.1145\/800133.804339"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"L. M. Goldschlager. A unified approach to models of synchronous parallel computation. In Proc. of the 10th Annual ACM Symposium on Theory of Computing, pages 89\u201394, 1978.","DOI":"10.1145\/800133.804336"},{"key":"25_CR9","volume-title":"Introduction to Automata Theory, Language, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading Mass., 1979."},{"key":"25_CR10","first-page":"67","volume-title":"Handbook of Theoretical Computer Science, Vol. A","author":"D. S. Johnson","year":"1990","unstructured":"D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 67\u2013161. Elsevier, Amsterdam, 1990."},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(93)90255-R","volume":"107","author":"K.-J. Lange","year":"1993","unstructured":"K.-J. Lange. Unambiguity of circuits. Theoret. Comput. Sci., 107:77\u201394, 1993.","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"K.-J. Lange and P. Rossmanith. Characterizing unambiguous augmented pushdown automata by circuits. In Proc. of the 15th MFCS, number 452 in LNCS, pages 399\u2013406. Springer, 1990.","DOI":"10.1007\/BFb0029635"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"K.-J. Lange and P. Rossmanith. Unambiguous polynomial hierarchies and exponential size. In Proc. of the 9th IEEE Structure in Complexity Conference, pages 106\u2013115, 1994.","DOI":"10.1109\/SCT.1994.315812"},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/0304-3975(93)90333-O","volume":"116","author":"B. Monien","year":"1993","unstructured":"B. Monien, W. Rytter, and H. Sch\u00c4pers. Fast recognition of deterministic cfl's with a smaller number of processors. Theoret. Comput. Sci., 116:421\u2013429, 1993. Corrigendum, 123:427,1993.","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"25_CR15","first-page":"227","volume":"118","author":"R. Niedermeier","year":"1995","unstructured":"R. Niedermeier and P. Rossmanith. Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Inform. and Control, 118(2):227\u2013245, 1995.","journal-title":"Inform. and Control"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"I. Niepel and P. Rossmanith. Uniform circuits and exclusive read PRAMs. In Proc. of the 11th FST&TCS, number 560 in LNCS, pages 307\u2013318. Springer, 1990.","DOI":"10.1007\/3-540-54967-6_77"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"K. Reinhardt. Strict sequential P-completeness. Manuscript, 1996.","DOI":"10.1007\/BFb0023470"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"P. Rossmanith. The owner concept for PRAMs. In Proc. of the 8th STACS, number 480 in LNCS, pages 172\u2013183. Springer, 1991.","DOI":"10.1007\/BFb0020797"},{"key":"25_CR19","unstructured":"P. Rossmanith. Characterizations of memory access for PRAM's and bounds on the time complexity of boolean functions. Ph.D. thesis, Technische Universit\u00c4t M\u00fcnchen, 1993."},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. Ruzzo","year":"1981","unstructured":"W. Ruzzo. On uniform circuit complexity. J. Comp. System Sci., 22:365\u2013338, 1981.","journal-title":"J. Comp. System Sci."},{"key":"25_CR21","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L. Stockmeyer","year":"1984","unstructured":"L. Stockmeyer and C. Vishkin. Simulation of random access machines by circuits. SIAM J. Comp., 13:409\u2013422, 1984.","journal-title":"SIAM J. Comp."},{"key":"25_CR22","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I. Sudborough","year":"1978","unstructured":"I. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comp. Mach., 25:405\u2013414, 1978.","journal-title":"J. Assoc. Comp. Mach."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"H. Venkateswaran. Properties that characterize LOGCFL. In Proc. of the 19th Annual ACM Symp. on Theory of Computing, pages 141\u2013150, 1987.","DOI":"10.1145\/28395.28411"},{"key":"25_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(85)90142-2","volume":"39","author":"J. Vogel","year":"1985","unstructured":"J. Vogel and K. Wagner. Two-way automata with more than one storage medium. Theoret. Comput. Sci., 39:267\u2013280, 1985.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:11:40Z","timestamp":1605629500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}