Author:
Fiat Amos,Saia Jared,Young Maxwell
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Aspnes, J., Shah, G.: Skip Graphs. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384–393 (2003)
2. Lecture Notes in Computer Science;B. Awerbuch,2005
3. Lecture Notes in Computer Science;B. Awerbuch,2004
4. Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous Secure Computation. In: Proceedings of the Twenty-Fifth ACM Symposium on the Theory of Computing, STOC (1993)
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computing. In: Proceedings of the Twentieth ACM Symposium on the Theory of Computing (STOC), pp. 1–10 (1988)
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Robust Overlays Meet Blockchains;Lecture Notes in Computer Science;2023
2. TontineCoin: Survivor-based Proof-of-Stake;Peer-to-Peer Networking and Applications;2022-01-05
3. Do You Feel a Chill?;Proceedings of the 20th Workshop on Workshop on Privacy in the Electronic Society;2021-11-15
4. Resource Burning for Permissionless Systems (Invited Paper);Structural Information and Communication Complexity;2020
5. Erlay;Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security;2019-11-06