{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:26Z","timestamp":1725664526802},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:32:29Z","timestamp":1330277549000},"page":"310-321","source":"Crossref","is-referenced-by-count":0,"title":["Limitations of the QRQW and EREW PRAM models"],"prefix":"10.1007","author":[{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Lory\u015a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin, L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci.\n18 (1979) 155\u2013193.","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"27_CR2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","volume":"36","author":"P. Beame","year":"1989","unstructured":"P. Beame, J. H\u00e5stad, Optimal bounds for decision problems on the CRCW PRAM, JACM, 36(3) (1989) 643\u2013670.","journal-title":"JACM"},{"key":"27_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1976","unstructured":"C. Berge: Graphs and Hypergraphs. North-Holland, Amsterdam, 1976."},{"issue":"1","key":"27_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. Cook","year":"1986","unstructured":"S. Cook, C. Dwork, R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput.\n15(1) (1986) 87\u201397.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"27_CR5","first-page":"231","volume":"48","author":"M. Dietzfelbinger","year":"1994","unstructured":"M. Dietzfelbinger, M. Kuty\u0142owski, R. Reischuk, Exact lower time bounds for computing Boolean functions on CREW PRAMs, JCSS\n48(2) (1994) 231\u2013253.","journal-title":"JCSS"},{"key":"27_CR6","first-page":"843","volume-title":"Synthesis of Parallel Algorithms","author":"F.E. Fich","year":"1993","unstructured":"F.E. Fich, The complexity of computation on the Parallel Random Access Machine, in Synthesis of Parallel Algorithms, J.H. Reif (ed.) (Morgan Kaufmann, San Mateo, 1993) 843\u2013899."},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01268141","volume":"5","author":"F. Fich","year":"1995","unstructured":"F. Fich, M. Kowaluk, M.Kuty\u0142owski, K. Lory\u015a, P. Ragde, Retrieval of scattered information by EREW, CREW and CRCW PRAMs, Comput. Complexity\n5 (1995) 113\u2013131.","journal-title":"Comput. Complexity"},{"key":"27_CR8","first-page":"236","volume-title":"Efficient low-contention parallel algorithms","author":"P. Gibbons","year":"1994","unstructured":"P. Gibbons, Y. Matias, V. Ramachandran, Efficient low-contention parallel algorithms, in Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, (ACM Press, New York, 1994) 236\u2013247."},{"key":"27_CR9","first-page":"638","volume-title":"The QRQW PRAM: accounting for contention in parallel algorithms","author":"P. Gibbons","year":"1994","unstructured":"P. Gibbons, Y. Matias, V. Ramachandran, The QRQW PRAM: accounting for contention in parallel algorithms, in Proc. 5th ACM Symp. on Discrete Algorithms, (ACM Press, New York, 1994) 638\u2013648."},{"key":"27_CR10","first-page":"254","volume-title":"Lower bounds for randomized exclusive write PRAMs","author":"P. D. MacKenzie","year":"1995","unstructured":"P. D. MacKenzie, Lower bounds for randomized exclusive write PRAMs, in Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, (ACM Press, New York, 1995) 254\u2013263."},{"key":"27_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"R. Motwani, P. Raghavan: Randomized Algorithms, Cambridge University Press, Cambridge 1995."},{"key":"27_CR12","first-page":"26","volume":"62","author":"H. Robbins","year":"1955","unstructured":"H. Robbins, A remark on Stirling formula, American Mathematical Monthly\n62 (1955) 26\u201329.","journal-title":"American Mathematical Monthly"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:37:37Z","timestamp":1619559457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}