{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:46Z","timestamp":1725663706989},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557067"},{"type":"electronic","value":"9783540472759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55706-7_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:33:18Z","timestamp":1330234398000},"page":"30-41","source":"Crossref","is-referenced-by-count":1,"title":["Retrieval of scattered information by EREW, CREW and CRCW PRAMs"],"prefix":"10.1007","author":[{"given":"Faith","family":"Fich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Kowaluk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Lory\u015b","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Kutylowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Ragde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"H. Bast and T. Hagerup: Fast and Reliable Parallel Hashing. In: Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 50\u201361.","DOI":"10.1145\/113379.113384"},{"key":"3_CR2","unstructured":"P. Beame, M. Kik and M. Kuty\u0142owski: Information broadcasting by Exclusive Read PRAMs. Manuscript."},{"key":"3_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1976","unstructured":"C. Berge: Graphs and Hypergraphs. North-Holland, Amsterdam, 1976."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole: Parallel Merge Sort. SIAM J. Comput. 17, 1988, pp. 770\u2013785.","journal-title":"SIAM J. Comput."},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. Cook","year":"1986","unstructured":"S. Cook, C. Dwork and R. Reischuk: Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes. SIAM J. Comput. 15, 1986, pp. 87\u201397.","journal-title":"SIAM J. Comput."},{"key":"3_CR6","unstructured":"M. Dietzfelbinger, M. Kutylowski and R. Reischuk: Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. To appear in J. Computer and System Sciences."},{"key":"3_CR7","unstructured":"F. E. Fich, R. Impagliazzo, B. Kapron, V. King and M. Kutylowski: Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution. Manuscript."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","volume":"17","author":"F. E. Fich","year":"1988","unstructured":"F. E. Fich, P. Ragde, A. Wigderson: Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17, 1988, pp. 606\u2013627.","journal-title":"SIAM J. Comput."},{"key":"3_CR9","unstructured":"J. Gil and Y. Matias: Fast Hashing on a PRAM \u2014 Designing by Expectation. In: Proc. 2nd Annual ACM Symposium on Discrete Algorithms, 1991, pp. 271\u2013280."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"J. Gil, Y. Matias, and U. Vishkin: Towards a Theory of Nearly Constant Parallel Time Algorithms. In: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 698\u2013710.","DOI":"10.1109\/SFCS.1991.185438"},{"key":"3_CR11","unstructured":"J. Gil and L. Rudolph: Counting and Packing in Parallel. In: Proc. 1986 International Conference on Parallel Processing, pp. 1000\u20131002."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"M. Goodrich: Using Approximation Algorithms to Design Parallel Algorithms that may Ignore Processor Allocation. In: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 711\u2013722.","DOI":"10.1109\/SFCS.1991.185439"},{"key":"3_CR13","unstructured":"T. Hagerup. Personal communication"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"T. Hagerup: Fast and Optimal Simulations between CRCW PRAMs. In: Proc. 9th Symposium on Theoretical Aspects of Computer Science, 1992, pp. 45\u201356.","DOI":"10.1007\/3-540-55210-3_172"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"T. Hagerup: The Log-Star Revolution. In: Proc. 9th Symposium on Theoretical Aspects of Computer Science, 1992, pp. 259\u2013280.","DOI":"10.1007\/3-540-55210-3_189"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"T. Hagerup and M. Nowak: Parallel retrieval of scattered information. In: Proc. 16th International Colloquium on Automata, Languages, and Programming, 1989, pp. 439\u2013450.","DOI":"10.1007\/BFb0035775"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"T. Hagerup and T. Radzik: Every ROBUST CRCW PRAM can Efficiently Simulate a PRIORITY PRAM. In: Proc. 2nd ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 125\u2013135.","DOI":"10.1145\/97444.97677"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Y. Matias and U. Vishkin: On Parallel Hashing and Integer Sorting. In: Proc. 18th International Colloquium on Automata, Languages, and Programming, 1991, pp. 729\u2013743.","DOI":"10.1016\/0196-6774(91)90034-V"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J. B. Rosser","year":"1962","unstructured":"J. B. Rosser and L. Schoenfeld: Approximate Formulas for Some Functions of Prime Numbers. Illinois J. Math. 6, 1962, pp. 64\u201394.","journal-title":"Illinois J. Math."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"P. Ragde: The Parallel Simplicity of Compaction and Chaining. In: Proc. 17th International Colloquium on Automata, Languages, and Programming, 1990, pp. 744\u2013751.","DOI":"10.1007\/BFb0032071"},{"key":"3_CR21","unstructured":"L. Rudolph and W. Steiger: Subset Selection in Parallel. In: Proc. 1985 International Conference on Parallel Processing, pp. 11\u201314."},{"key":"3_CR22","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 J. Comput. 14, 1985, pp. 688\u2013708.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55706-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:01:26Z","timestamp":1605628886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55706-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557067","9783540472759"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-55706-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}