{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:41Z","timestamp":1725455621756},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540537090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0020797","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:07:52Z","timestamp":1131844072000},"page":"172-183","source":"Crossref","is-referenced-by-count":9,"title":["The owner concept for PRAMs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Rossmanith","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J. ACM, 28:114\u2013133, 1981.","journal-title":"J. ACM"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inform. and Control, 64:2\u201322, 1985.","journal-title":"Inform. and Control"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. A. Cook","year":"1986","unstructured":"S. A. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 15(1):87\u201397, 1986.","journal-title":"SIAM J. Comput."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"P. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th ICALP, number 226 in LNCS, pages 95\u2013104. Springer, 1987.","DOI":"10.1007\/3-540-16761-7_59"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"F. E. Fich. New bounds for parallel prefix circuits. In Proc. of 15th STOC, pages 27\u201336, 1983.","DOI":"10.1145\/800061.808738"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Willie. Parallelism in random access machines. In Proc. of 10th STOC, pages 114\u2013118, 1978.","DOI":"10.1145\/800133.804339"},{"key":"15_CR7","series-title":"Technical Report","volume-title":"A survey of parallel algorithms for shared-memory machines","author":"R. M. Karp","year":"1987","unstructured":"R. M. Karp and V. Ramachandran. A survey of parallel algorithms for shared-memory machines. Technical Report UCB\/CSD 88\/408, Computer Science Division, University of California at Berkeley, California 94720, Mar. 1987. To appear in J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer. Parallel prefix computation. J. ACM, 27:831\u2013838, 1980.","journal-title":"J. ACM"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"K.-J. Lange. Unambiguity of circuits. In Proc. of 5th Structure in Complexity Conf., pages 130\u2013137, 1990.","DOI":"10.1109\/SCT.1990.113962"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","volume":"C-30","author":"G. Lev","year":"1981","unstructured":"G. Lev, N. Pippenger, and L. G. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Trans. on Computers, C-30:93\u2013100, 1981.","journal-title":"IEEE Trans. on Computers"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"G. L. Miller and J. Reif. Parallel tree contraction and its applications. In Proc. of 26th FOCS, pages 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"21","author":"W. L. Ruzzo","year":"1980","unstructured":"W. L. Ruzzo. Tree-size bounded alternation. J. Comput. Syst. Sci., 21:218\u2013235, 1980.","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. L. Ruzzo","year":"1981","unstructured":"W. L. Ruzzo. On uniform circuit complexity. J. Comput. Syst. Sci., 22:365\u2013383, 1981.","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"M. Snir. On parallel searching. In Proc. SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 242\u2013253, Ottawa, Canada, 1982.","DOI":"10.1145\/800220.806703"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L. Stockmeyer","year":"1984","unstructured":"L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2):409\u2013422, May 1984.","journal-title":"SIAM J. Comput."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I. H. Sudborough","year":"1978","unstructured":"I. H. Sudborough. On the tape complexity of deterministic context-free languages. J. ACM, 25:405\u2013414, 1978.","journal-title":"J. ACM"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"H. Venkateswaran. Properties that characterize LOGCFL. In Proc. of 19th STOC, pages 141\u2013150, 1987.","DOI":"10.1145\/28395.28411"},{"key":"15_CR18","volume-title":"The Complexity of Parallel Computations","author":"J. C. Wyllie","year":"1981","unstructured":"J. C. Wyllie. The Complexity of Parallel Computations. Ph.d. dissertation, Cornell University, Computer Science Department, Ithaca, NY, 1981."}],"container-title":["Lecture Notes in Computer Science","STACS 91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020797.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:45:01Z","timestamp":1607532301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540537090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0020797","relation":{},"subject":[]}}