{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:59:49Z","timestamp":1649105989629},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":6163,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0304-3975(95)00186-7","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"107-122","source":"Crossref","is-referenced-by-count":4,"title":["Reliable computations on faulty EREW PRAM"],"prefix":"10.1016","volume":"164","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00186-7_BIB1","series-title":"VLSI Algorithms and Architectures, Proc. 3rd Aegean Workshop on Computing","first-page":"81","article-title":"Deterministic parallel list ranking","volume":"Vol. 319","author":"Anderson","year":"1988"},{"key":"10.1016\/0304-3975(95)00186-7_BIB2","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0404042","article-title":"Fault-tolerant sorting networks","volume":"4","author":"Assaf","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0304-3975(95)00186-7_BIB3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","article-title":"Parallel techniques for combinatorial computations","volume":"3","author":"Eppstein","year":"1988","journal-title":"Ann. Comput. Sci. Rev."},{"key":"10.1016\/0304-3975(95)00186-7_BIB4","series-title":"Proc. 10th ACM Symp. on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"key":"10.1016\/0304-3975(95)00186-7_BIB5","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/0304-3975(95)00186-7_BIB6","first-page":"305","article-title":"A guided tour of Chernoff bounds","volume":"33","author":"Hagerup","year":"1989"},{"key":"10.1016\/0304-3975(95)00186-7_BIB7","series-title":"An Introduction to Parallel Algorithms","author":"JaJa","year":"1992"},{"key":"10.1016\/0304-3975(95)00186-7_BIB8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02277667","article-title":"Efficient parallel algorithms can be made robust","volume":"5","author":"Kanellakis","year":"1992","journal-title":"Distributed Comput."},{"key":"10.1016\/0304-3975(95)00186-7_BIB9","series-title":"Handbook of Theoretical Computer Science","first-page":"869","article-title":"Parallel algorithms for shared memory machines","volume":"Vol A","author":"Karp","year":"1990"},{"key":"10.1016\/0304-3975(95)00186-7_BIB10","series-title":"Proc. 23rd ACM Symp. on Theory of Computing","first-page":"381","article-title":"Combining tentative and definite executions for very fast dependable parallel computing","author":"Kedem","year":"1991"},{"key":"10.1016\/0304-3975(95)00186-7_BIB11","series-title":"Proc. 22nd ACM Symp. on Theory of Computing","first-page":"138","article-title":"Efficient robust parallel computations","author":"Kedem","year":"1990"},{"key":"10.1016\/0304-3975(95)00186-7_BIB12","series-title":"Proc. 18th Ann. Symp. on Theory of Computing","first-page":"240","article-title":"Explicit expanders and the Ramanujan conjectures","author":"Lubotzky","year":"1986"},{"key":"10.1016\/0304-3975(95)00186-7_BIB13","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/357369.357371","article-title":"Fail-stop processors: an approach to designing fault-tolerant computing systems","volume":"1","author":"Schlichting","year":"1983","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/0304-3975(95)00186-7_BIB14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(91)90156-C","article-title":"Achieving optimal CRCW PRAM fault-tolerance","volume":"39","author":"Shvartsman","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00186-7_BIB15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(92)90090-I","article-title":"An efficient write-all algorithm for fail-stop PRAM without initialized memory","volume":"44","author":"Shvartsman","year":"1992","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001867?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001867?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:24:37Z","timestamp":1556508277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0304397595001867"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00186-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}