{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:27:47Z","timestamp":1729636067292,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214413","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T14:34:28Z","timestamp":1079966068000},"page":"93-104","source":"Crossref","is-referenced-by-count":0,"title":["Optimal separation of EROW and CROW PRAMs"],"prefix":"10.1109","author":[{"given":"N.","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Saks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"11","article-title":"A tight ?(log log n) bound on the time for parallel RAMs to compute nonboolean functions","volume":"158","author":"simon","year":"1983","journal-title":"LNCS"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/0214051"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/0215006"},{"journal-title":"Lower Bounds in Parallel Machine Computation","year":"1987","author":"beame","key":"2"},{"journal-title":"The Probabilistic Method","year":"1992","author":"alon","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258648"},{"key":"7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(89)90169-2","article-title":"On separating the EREW and CROW models","volume":"68","author":"gafni","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0219050","article-title":"Towards understanding concurrent read","volume":"19","author":"fich","year":"1990","journal-title":"SIAM Journal of Computing"},{"key":"5","article-title":"The complexity of computation on the parallel random access machine","author":"fich","year":"1993","journal-title":"Synthesis of Parallel Algorithms"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331607"},{"key":"9","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0220062","article-title":"CREW PRAMs and decision trees","volume":"20","author":"nisan","year":"1991","journal-title":"SIAM Journal of Computing"},{"key":"8","article-title":"A survey of parallel algorithms for shared-memory machines","volume":"a","author":"karp","year":"1988","journal-title":"Handbook of Theoretical Computer Science"}],"event":{"name":"18th IEEE Annual Conference on Computational Complexity","acronym":"CCC-03","location":"Aarhus, Denmark"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214413.pdf?arnumber=1214413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:26:13Z","timestamp":1497587173000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214413\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214413","relation":{},"subject":[]}}