{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:38Z","timestamp":1725663278140},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:02:30Z","timestamp":1330185750000},"page":"95-104","source":"Crossref","is-referenced-by-count":12,"title":["New simulations between CRCW PRAMs"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Diks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torben","family":"Hagerup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"B. S. Chlebus, K. Diks, T. Hagerup and T. Radzik: \u201cEfficient Simulations between Concurrent-Read Concurrent-Write PRAM Models\u201d. 13th Symposium on Mathematical Foundations of Computer Science (1988), Springer Lecture Notes in Computer Science 324, 231\u2013239.","DOI":"10.1007\/BFb0017146"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/0217037","volume":"17","author":"F. E. Fich","year":"1988","unstructured":"F. E. Fich, P. Ragde and A. Wigderson: \u201cRelations Between Concurrent-Write Models of Parallel Computation\u201d. SIAM Journal on Computing\n17 (1988), 606\u2013627.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01762109","volume":"3","author":"F. E. Fich","year":"1988","unstructured":"F. E. Fich, P. Ragde and A. Wigderson: \u201cSimulations Among Concurrent-Write PRAMs\u201d. Algorithmica\n3 (1988), 43\u201351.","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1145\/322344.322353","volume":"29","author":"L. M. Goldschlager","year":"1982","unstructured":"L. M. Goldschlager: \u201cA Universal Interconnection Pattern for Parallel Computers\u201d. Journal of the ACM\n29 (1982), 1073\u20131086.","journal-title":"Journal of the ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"V. Grolmusz and P. Ragde: \u201cIncomparability In Parallel Computation\u201d. Proceedings, 28th Annual Symposium on Foundations of Computer Science (1987), 89\u201398.","DOI":"10.1109\/SFCS.1987.34"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Ku\u010dera","year":"1982","unstructured":"L. Ku\u010dera: \u201cParallel Computation and Conflicts in Memory Access\u201d. Information Processing Letters\n14 (1982), 93\u201396.","journal-title":"Information Processing Letters"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/0890-5401(87)90017-4","volume":"73","author":"M. Li","year":"1987","unstructured":"M. Li and Y. Yesha: \u201cSeparation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation\u201d. Information and Computing\n73 (1987), 102\u2013128.","journal-title":"Information and Computing"},{"key":"9_CR8","unstructured":"P. Ragde, personal communication, 1988."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/0401040","volume":"1","author":"P. Ragde","year":"1988","unstructured":"P. Ragde, W. Steiger, E. Szemer\u00e9di and A. Wigderson: \u201cThe Parallel Complexity of Element Distinctness is \u03a9(\u221alog n)\u201d. SIAM Journal on Discrete Mathematics\n1 (1988), 399\u2013410.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach and U. Vishkin: \u201cAn O(log n) Parallel Connectivity Algorithm\u201d. Journal of Algorithms\n3 (1982), 57\u201367.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:03:42Z","timestamp":1619557422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}