{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:02:06Z","timestamp":1725494526181},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665311"},{"type":"electronic","value":"9783540481690"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48169-9_20","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T00:36:33Z","timestamp":1194222993000},"page":"284-296","source":"Crossref","is-referenced-by-count":1,"title":["Randomization Helps to Perform Tasks on Processors Prone to Failures"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"R.J. Anderson, and H. Woll, Wait-Free Parallel Algorithms for the Union-Find Problem, in Proc. 23rd Symp. on Theory of Computing, 1991, pp. 370\u2013380.","DOI":"10.1145\/103418.103458"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/jagm.1996.0003","volume":"20","author":"J. Buss","year":"1996","unstructured":"J. Buss, P.C. Kanellakis, P. Ragde, and A.A. Shvartsman, Parallel Algorithms with Processor Failures and Delays, J. Algorithms, 20(1996) 45\u201386.","journal-title":"J. Algorithms"},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/BFb0030678","volume-title":"Proc. 11th International Workshop on Distributed Algorithms","author":"B.S. Chlebus","year":"1997","unstructured":"B.S. Chlebus, R. De Prisco, and A.A. Shvartsman, Performing Tasks on Restartable Message-Passing Processors, in Proc. 11th International Workshop on Distributed Algorithms, 1997, LNCS 1320, pp. 96\u2013110."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"R. De Prisco, A. Mayer, and M. Yung, Time-Optimal Message-Efficient Work Performance in the Presence of Faults, in Proc. 13th Symp. on Principles of Distributed Computing, 1994, pp. 161\u2013172.","DOI":"10.1145\/197917.198082"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/S0097539793255527","volume":"27","author":"C. Dwork","year":"1998","unstructured":"C. Dwork, J. Halpern, O. Waarts, Performing Work Efficiently in the Presence of Faults, SIAM J. on Computing, 27 (1998) 1457\u20131491.","journal-title":"SIAM J. on Computing"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Z. Galil, A. Mayer, and M. Yung, Resolving Message Complexity of Byzantine Agreement and Beyond, in Proc. 36th Symp. on Foundations of Computer Science, 1995, pp. 724\u2013733.","DOI":"10.1109\/SFCS.1995.492674"},{"key":"20_CR7","unstructured":"G. Grimmett, and D. Stirzaker, \u201cProbability and Random Processes,\u201d Oxford University Press, 1992."},{"key":"20_CR8","unstructured":"V. Hadzilacos and S. Toueg, Fault-Tolerant Broadcasts and Related Problems, in \u201cDistributed Systems,\u201d 2nd Ed., S. Mullender, ed., Addison-Wesley and ACM Press, 1993."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P.C. Kanellakis","year":"1992","unstructured":"P.C. Kanellakis and A.A. Shvartsman, Efficient Parallel Algorithms Can Be Made Robust, Distributed Computing, 5 (1992) 201\u2013217.","journal-title":"Distributed Computing"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis and A.A. Shvartsman, \u201cFault-Tolerant Parallel Computation,\u201d Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4757-5210-6"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem, K.V. Palem, M.O. Rabin, A. Raghunathan, Efficient Program Transformations for Resilient Parallel Computation via Randomization, in Proc. 24th Symp. on Theory of Comp., 1992, pp. 306\u2013318.","DOI":"10.1145\/129712.129742"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem, K.V. Palem, A. Raghunathan, and P. Spirakis, Combining Tentative and Definite Executions for Dependable Parallel Computing, in Proc. 23rd Symp. on Theory of Computing, 1991, pp. 381\u2013390.","DOI":"10.1145\/103418.103459"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem, K.V. Palem, and P. Spirakis, Efficient Robust Parallel Computations, in Proc. 22nd Symp. on Theory of Computing, 1990, pp. 138\u2013148.","DOI":"10.1145\/100216.100231"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1006\/jagm.1994.1017","volume":"16","author":"C. Martel","year":"1994","unstructured":"C. Martel, and R. Subramonian, On the Complexity of Certified Write-All Algorithms, J. Algorithms, 16 (1994) 361\u2013387.","journal-title":"J. Algorithms"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1137\/0221063","volume":"21","author":"C. Martel","year":"1992","unstructured":"C. Martel, A. Park, and R. Subramonian, Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers, SIAM J. Comput., 21 (1992) 1070\u20131099.","journal-title":"SIAM J. Comput."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"C. McDiarmid, On the Method of Bounded Differences, in J. Siemon, ed., \u201cSurveys in Combinatorics,\u201d Cambridge University Press, 1989, pp. 148\u2013188, London Math. Soc. Lecture Note Series 141.","DOI":"10.1017\/CBO9781107359949.008"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48169-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T01:05:49Z","timestamp":1556931949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48169-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665311","9783540481690"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48169-9_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}