{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:54Z","timestamp":1725664134978},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_254","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:52Z","timestamp":1330261792000},"page":"240-249","source":"Crossref","is-referenced-by-count":0,"title":["On the Power of reading and writing simultaneously in parallel computations"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Niedermeier","sequence":"first","affiliation":[]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"1","key":"26_CR1","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 Journal on Computing, 15(1):87\u201397, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, M. Kuty\u0142owski, and R. Reischuk. Exact time bounds for computing boolean functions on PRAMs without simultaneous writes. In Proc. of 2d SPAA, pages 125\u2013135, 1990.","DOI":"10.1145\/97444.97678"},{"key":"26_CR3","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-Verlag, 1986.","DOI":"10.1007\/3-540-16761-7_59"},{"key":"26_CR4","unstructured":"F. E. Fich. The complexity of computation on the parallel random access machine. In J. H. Reif, editor, Synthesis of Parallel Algorithms, chapter 20, pages 843\u2013900. Morgan Kaufmann Publishers, 1993."},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0219050","volume":"19","author":"F. E. Fich","year":"1990","unstructured":"F. E. Fich and A. Wigderson. Toward understanding exclusive read. SIAM Journal on Computing, 19(4):718\u2013727, 1990.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR6","unstructured":"J. J\u00e1J\u00e1. An Introduction to Parallel Algorithms. Addison-Wesley, 1992."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"R. M. Karp and V. Ramachandran. A survey of parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, chapter 17, pages 869\u2013932. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"issue":"5","key":"26_CR8","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/0220051","volume":"20","author":"M. Kuty\u0142owski","year":"1991","unstructured":"M. Kuty\u0142owski. Time complexity of boolean functions on CREW PRAMs. SIAM Journal on Computing, 20(5):824\u2013833, 1991.","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"26_CR9","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1137\/0220062","volume":"20","author":"N. Nisan","year":"1991","unstructured":"N. Nisan. CREW PRAMs and decision trees. SIAM Journal on Computing, 20(6):999\u20131007, 1991.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0220005","volume":"20","author":"I. Parberry","year":"1991","unstructured":"I. Parberry and P. Yuan Yan. Improved upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM Journal on Computing, 20(1):88\u201399, 1991.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R. L. Rivest","year":"1976","unstructured":"R. L. Rivest and J. Vuillemin. On recognizing graph properties from adjacency matrices. TCS, 3:371\u2013384, 1976.","journal-title":"TCS"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"R. Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proc. of 19th STOC, pages 77\u201382, 1987.","DOI":"10.1145\/28395.28404"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"I. Wegener. The Complexity of Boolean Functions. Wiley-Teubner, 1987.","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_254.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:12Z","timestamp":1605647592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_254","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}