{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:37Z","timestamp":1725663757560},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_245","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:03Z","timestamp":1330257903000},"page":"163-174","source":"Crossref","is-referenced-by-count":0,"title":["Separating the power of EREW and CREW PRAMs with small communication width"],"prefix":"10.1007","author":[{"given":"Paul","family":"Beame","sequence":"first","affiliation":[]},{"given":"Faith E.","family":"Fich","sequence":"additional","affiliation":[]},{"given":"Rakesh K.","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"17_CR1","unstructured":"P. Beame. Lower Bounds in Parallel Machine Computation. PhD thesis, Department of Computer Science, University of Toronto, 1986. Also appears as Technical Report TR 198\/87."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. A. Cook","year":"1986","unstructured":"Steven A. Cook, Cynthia Dwork, and Rudiger Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM Journal on Computing, 15(1):87\u201397, February 1986.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR3","first-page":"125","volume-title":"Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes","author":"M. Dietzfelbinger","year":"1990","unstructured":"M. Dietzfelbinger, M. Kutylowski, and R. Reischuk. Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 125\u2013135, Crete, Greece, June 1990."},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1137\/0219050","volume":"19","author":"F. E. Fich","year":"1990","unstructured":"Faith E. Fich and Avi Wigderson. Towards understanding exclusive read. SIAM Journal on Computing, 19(4):717\u2013727, 1990.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(89)90169-2","volume":"68","author":"E Gafni","year":"1989","unstructured":"E Gafni, J Naor, and P Ragde. On separating the EREW and CREW PRAM models. Theoretical Computer Science, 68(3):343\u2013346, 1989.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/0220051","volume":"20","author":"M. Kutyloswski","year":"1991","unstructured":"M. Kutyloswski. The 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":"17_CR7","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1137\/0220062","volume":"20","author":"N. Nisan","year":"1991","unstructured":"Noam Nisan. CREW PRAMs and decision trees. SIAM Journal on Computing, 20(6):999\u20131007, December 1991.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","volume":"14","author":"M. Snir","year":"1985","unstructured":"M. Snir. On parallel searching. SIAM Journal on Computing, 14:688\u2013708, 1985.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"17_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0214024","volume":"14","author":"U. Vishkin","year":"1985","unstructured":"U. Vishkin and A. Wigderson. Trade-offs between depth and width in parallel computation. SIAM Journal on Computing, 14(2):303\u2013314, May 1985.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_245.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:58:38Z","timestamp":1619571518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_245","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}