{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T11:32:44Z","timestamp":1673695964938},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf01762109","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:22:38Z","timestamp":1118917358000},"page":"43-51","source":"Crossref","is-referenced-by-count":38,"title":["Simulations among concurrent-write PRAMs"],"prefix":"10.1007","volume":"3","author":[{"given":"Faith E.","family":"Fich","sequence":"first","affiliation":[]},{"given":"Prabhakar","family":"Ragde","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01762109_CR1","doi-asserted-by":"crossref","unstructured":"Beame, P., Limits on the Power of Concurrent-Write Parallel Machines,Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 169\u2013176.","DOI":"10.1145\/12130.12147"},{"key":"BF01762109_CR2","doi-asserted-by":"crossref","unstructured":"Fich, F. E., Meyer auf der Heide, F., Ragde, P. L., and Wigderson, A., One, Two, Three... Infinity: Lower Bounds for Parallel Computation.,Proc. 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 48\u201358.","DOI":"10.1145\/22145.22151"},{"key":"BF01762109_CR3","unstructured":"Fich, F. E., Meyer auf der Heide, F., and Wigderson, A., Lower Bounds for Parallel Random Access Machines with Unbounded Shared Memory, inAdvances in Computing Research 4, pp. 1\u201315 (F. Preparata, ed.), JAI Press, Greenwich, CT."},{"key":"BF01762109_CR4","doi-asserted-by":"crossref","unstructured":"Fich, F. E., Ragde, P. L., and Wigderson, A., Relations Between Concurrent-Write Models of Parallel Computation,Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing, 1984, pp. 179\u2013189.","DOI":"10.1145\/800222.806745"},{"key":"BF01762109_CR5","unstructured":"Fich, F. E., Ragde, P. L., and Wigderson, A., Relations Between Concurrent-Write Models of Parallel Computation,SIAM J. Comput. (to appear)."},{"key":"BF01762109_CR6","doi-asserted-by":"crossref","unstructured":"Galil, Z., Optimal Parallel Algorithms for String Matching,Proc. 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 240\u2013248.","DOI":"10.1145\/800057.808687"},{"key":"BF01762109_CR7","doi-asserted-by":"crossref","unstructured":"Goldschlager, L., A Unified Approach to Models of Synchronous Parallel Machines,J. Assoc. Comput. Mach.,29(4), 1073\u20131086.","DOI":"10.1145\/322344.322353"},{"issue":"2","key":"BF01762109_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Ku\u010dera","year":"1982","unstructured":"Ku\u010dera, L., Parallel Computation and Conflicts in Memory Access,Inform. Process. Lett. 14(2), 1982, 93\u201396.","journal-title":"Inform. Process. Lett."},{"key":"BF01762109_CR9","doi-asserted-by":"crossref","unstructured":"Li, M., and Yesha, Y., New Lower Bounds for Parallel Computation,Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 177\u2013187.","DOI":"10.1145\/12130.12148"},{"key":"BF01762109_CR10","doi-asserted-by":"crossref","unstructured":"Meyer auf der Heide, F., and Wigderson, A., The Complexity of Parallel Sorting.Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 532\u2013540.","DOI":"10.1109\/SFCS.1985.58"},{"key":"BF01762109_CR11","unstructured":"Ragde, P. L., Lower Bounds for Parallel Computation, Ph.D. Thesis, University of California at Berkeley, 1986."},{"key":"BF01762109_CR12","unstructured":"Ragde, P. L., Steiger, W., Szemer\u00e9di, E., and Wigderson, A., The Parallel Complexity of Element Distinctness is \u03a9(\u221alogn),SIAM J. Disc. Math, (to appear)."},{"key":"BF01762109_CR13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., and Vishkin, U., Finding the Maximum, Merging and Sorting On Parallel Models of Computation,J. Algorithms,2, 1981, 88\u2013102.","journal-title":"J. Algorithms"},{"key":"BF01762109_CR14","doi-asserted-by":"crossref","unstructured":"Tarjan, R. A., and Vishkin, Y., Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time,Proc. 25th Annual Symposium on Foundations of Computer Science, 1984, pp. 12\u201320.","DOI":"10.1109\/SFCS.1984.715896"},{"issue":"2","key":"BF01762109_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0214024","volume":"14","author":"U. Vishkin","year":"1985","unstructured":"Vishkin, U., and Wigderson, A., Trade-offs Between Depth and Width in Parallel Computation,SIAM J. Comput. 14(2), 1985, 303\u2013314.","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762109.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762109\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:26:48Z","timestamp":1586287608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01762109"],"URL":"https:\/\/doi.org\/10.1007\/bf01762109","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}