Author:
Alon Noga,Merritt Michael,Reingold Omer,Taubenfeld Gadi,Wright Rebecca N.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference29 articles.
1. Afek, Y., Greenberg, D., Merritt, M., Taubenfeld, G.: Computing with faulty shared memory. J. ACM 42(6), 1231–1274 (1995)
2. Alon, N., Spencer, J: The Probabilistic Method, Second Edition. Wiley, New York (2000)
3. Attie, P.C.: Wait-free Byzantine Agreement. Technical Report NU-CCS-00-02, College of Computer Science, Northeastern University (2000)
4. Boehm, H.-J.: An almost non-blocking stack. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, pp. 40–49 (2004)
5. Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI'99). New Orleans, LA (1999)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation;Theory of Cryptography;2021
2. The Append Memory Model: Why BlockDAGs Excel Blockchains;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
3. The Impact of RDMA on Agreement;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16
4. Secure Multiparty Computation with Minimal Interaction;Advances in Cryptology – CRYPTO 2010;2010
5. Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces;IEEE Transactions on Parallel and Distributed Systems;2009-03