{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T21:24:56Z","timestamp":1652736296974},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7837,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0022-0000(92)90006-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"103-113","source":"Crossref","is-referenced-by-count":7,"title":["Processor-time tradeoffs in PRAM simulations"],"prefix":"10.1016","volume":"44","author":[{"given":"Prabhakar","family":"Ragde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90006-5_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0022-0000(92)90006-5_BIB2","series-title":"Proceedings, 30th Annual ACM Symposium on Theory of Computing","first-page":"320","article-title":"Optimal separations between concurrent-write parallel machines","author":"Boppana","year":"1989"},{"key":"10.1016\/0022-0000(92)90006-5_BIB3","series-title":"Proceedings, 13th Symposium on the Mathematical Foundations of Computer Science","first-page":"230","article-title":"Efficient simulations between CRCW PRAMS","author":"Chlebus","year":"1988"},{"key":"10.1016\/0022-0000(92)90006-5_BIB4","first-page":"85","article-title":"Intersection theorems for systems of sets","volume":"35","author":"Erd\u00f6s","year":"1960"},{"key":"10.1016\/0022-0000(92)90006-5_BIB5","series-title":"Proceedings, 3rd ACM Symposium on Principles of Distributed Computation","first-page":"179","article-title":"Relations between concurrent-write models of parallel computation (preliminary version)","author":"Fich","year":"1984"},{"key":"10.1016\/0022-0000(92)90006-5_BIB6","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","article-title":"Relations between concurrent-write models of parallel computation","volume":"17","author":"Fich","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90006-5_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01762109","article-title":"Simulations among concurrent-write models of parallel computation","volume":"3","author":"Fich","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(92)90006-5_BIB8","series-title":"Proceedings, ACM Symposium on Theory of Computing","first-page":"240","article-title":"Optimal parallel algorithms for string matching","author":"Galil","year":"1984"},{"key":"10.1016\/0022-0000(92)90006-5_BIB9","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","article-title":"A unified approach to models of synchronous parallel machines","volume":"29","author":"Goldschlager","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90006-5_BIB10","series-title":"Large Parallel Machines Can Be Extremely Slow for Small Problems","author":"Grolmusz","year":"1988"},{"key":"10.1016\/0022-0000(92)90006-5_BIB11","series-title":"Proceedings, 27th Annual IEEE Symposium on Foundations of Computer Science","first-page":"89","article-title":"Incomparability in parallel computation","author":"Grolmusz","year":"1987"},{"key":"10.1016\/0022-0000(92)90006-5_BIB12","unstructured":"T. HAGERUP, Personal communication."},{"key":"10.1016\/0022-0000(92)90006-5_BIB13","doi-asserted-by":"crossref","unstructured":"T. HAGERUP AND M. NOWAK, \u201cParallel Retrieval of Scattered Information,\u201d Technical Report 14\/1988, Universit\u00e4t des Saarlandes.","DOI":"10.1007\/BFb0035775"},{"key":"10.1016\/0022-0000(92)90006-5_BIB14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","article-title":"Parallel computation and conflicts in memory access","volume":"14","author":"Kucera","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(92)90006-5_BIB15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/0401040","article-title":"The parallel complexity of element distinctness is \u03a3(log n)","volume":"1","author":"Ragde","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0022-0000(92)90006-5_BIB16","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging, and sorting on parallel models of computation","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(92)90006-5_BIB17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(92)90006-5_BIB18","series-title":"Proceedings, 25th Annual ACM Symposium on Foundations of Computer Science","first-page":"12","article-title":"Finding biconnected components and computing tree functions in logarithmic parallel time","author":"Tartan","year":"1984"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900065?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900065?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T16:26:00Z","timestamp":1585326360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000092900065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["0022000092900065"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90006-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}