Abstract
IN THIS final chapter1 we give an overview of the research results in robust computation for shared memory randomized algorithms and for the message passing model of computation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliographic Notes
R. De Prisco, A. Mayer, M. Yung, “Time-Optimal Message-Efficient Work Performance in the Presence of Faults”, in Proc. of the 13-th ACM Symposium on Principles of Distributed Computing, pp. 161–171, 1994.
C. Dwork, J. Halpern, O. Waarts, “Performing Work Efficiently in the Presence of Faults”, to appear in SIAM J. on Computing, prelim. vers. appeared in Proc. 11th ACM Symposium on Principles of Distributed Computing, pp. 91–102, 1992.
Z. Galil, A. Mayer and M. Yung, “Resolving the Message Complexity of Byzantine Agreement and Beyond”, in Proceedings of the IEEE Foundations of Computer Science FOCS, 1995.
HÀaTwvoç, AnroAo-yta EoicpaTovç,quoted from L. Dyer (ed.), T.D. Seymour (rev.), Plato, Apology of Socrates and Crito,p. 114, 1905 (reprint, Demetrios amp Victor, Booksellers, Los Angeles, 1973).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kanellakis, P.C., Shvartsman, A.A. (1997). Shared Memory Randomized Algorithms and Distributed Models and Algorithms. In: Fault-Tolerant Parallel Computation. The Springer International Series in Engineering and Computer Science, vol 401. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5210-6_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5210-6_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5177-9
Online ISBN: 978-1-4757-5210-6
eBook Packages: Springer Book Archive