{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:26Z","timestamp":1725456266283},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635758"},{"type":"electronic","value":"9783540696001"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030678","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:23:32Z","timestamp":1133418212000},"page":"96-110","source":"Crossref","is-referenced-by-count":4,"title":["Performing tasks on restartable message-passing processors"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"Roberto","family":"De Prisco","sequence":"additional","affiliation":[]},{"given":"Alex A.","family":"Shvartsman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R. De Prisco, A. Mayer, and M. Yung, \u201cTime-Optimal Message-Efficient Work Performance in the Presence of Faults,\u201d in Proc. 13th ACM Symposium on Principles of Distributed Computing, 1994, pp. 161\u2013172.","DOI":"10.1145\/197917.198082"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"C. Dwork, J. Halpern, O. Waarts, \u201cPerforming Work Efficiently in the Presence of Faults\u201d, to appear in SIAM J. on Computing, prelim. vers. appeared as Accomplishing Work in the Presence of Failures in Proc. 11th ACM Symposium on Principles of Distributed Computing, pp. 91\u2013102, 1992.","DOI":"10.1145\/135419.135439"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Z. Galil, A. Mayer, and M. Yung, \u201dResolving Message Complexity of Byzantine Agreement and Beyond,\u201d in Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 724\u2013733.","DOI":"10.1109\/SFCS.1995.492674"},{"key":"9_CR4","unstructured":"V. Hadzilacos and S. Toueg, \u201cFault-Tolerant Broadcasts and Related Problems,\u201d in Distributed Systems, 2nd Ed., S. Mullender, Ed., Addison-Wesley and ACM Press, 1993."},{"key":"9_CR5","first-page":"146","volume":"2","author":"P.C. Kanellakis","year":"1995","unstructured":"P.C. Kanellakis, D. Michailidis, A.A. Shvartsman, \u201cControlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms\u201d, Nordic J. of Computing, vol. 2, pp. 146\u2013180, 1995 (prel. vers. in WDAG-7, pp. 99\u2013114, 1993).","journal-title":"Nordic J. of Computing"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P.C. Kanellakis","year":"1992","unstructured":"P.C. Kanellakis and A.A. Shvartsman, \u201cEfficient Parallel Algorithms Can Be Made Robust,\u201d Distributed Computing, vol. 5, pp. 201\u2013217, 1992; prel. version in Proc. of the 8th ACM Symp. on Principles of Distributed Computing, 1989, pp. 211\u2013222.","journal-title":"Distributed Computing"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis and A.A. Shvartsman, Fault-Tolerant Parallel Computation, ISBN 0-7923-9922-6, Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4757-5210-6"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem, K.V. Palem, and P. Spirakis, \u201cEfficient Robust Parallel Computations,\u201d Proc. 22nd ACM Symp. on Theory of Computing, pp. 138\u2013148, 1990.","DOI":"10.1145\/100216.100231"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem, K.V. Palem, M.O. Rabin, A. Raghunathan, \u201cEfficient Program Transformations for Resilient Parallel Computation via Randomization,\u201d in Proc. 24th ACM Symp. on Theory of Comp., pp. 306\u2013318, 1992.","DOI":"10.1145\/129712.129742"},{"key":"9_CR10","unstructured":"C. Martel, personal communication, March, 1991."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"C. Martel, R. Subramonian, and A. Park, \u201cAsynchronous PRAMs are (Almost) as Good as Synchronous PRAMs,\u201d in Proc. 32d IEEE Symposium on Foundations of Computer Science, pp. 590\u2013599, 1990.","DOI":"10.1109\/FSCS.1990.89580"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:21:33Z","timestamp":1586593293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635758","9783540696001"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0030678","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}