Shared Memory Randomized Algorithms and Distributed Models and Algorithms
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 401)
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.
KeywordsShared Memory Message Complexity Byzantine Agreement Crash Failure Logical Clock
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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).Google Scholar
© Springer Science+Business Media New York 1997