Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems-Reference-Cited by-同舟云学术

Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems

Published:2021 Issue: Volume: Page:36-53
ISSN:0302-9743
Container-title:Networked Systems
language:
Short-container-title:

Author:

Georgiou Chryssis,Marcoullis Ioannis,Raynal Michel,Schiller Elad M.

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-91014-3_3

Reference46 articles.

1. Alon, N., Attiya, H., Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. 81(4), 692–701 (2015)

2. Lecture Notes in Computer Science;E Anagnostou,1993

3. Altisen, K., Devismes, S., Dubois, S., Petit, F.: Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2019)

4. Beauquier, J., Kekkonen-Moneta, S.: Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors. Int. J. Syst. Sci. 28(11), 1177–1187 (1997)

5. Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols. In: Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 27–30. ACM (1983)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Self-stabilizing indulgent zero-degrading binary consensus;Theoretical Computer Science;2024-03

2. Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast;Theoretical Computer Science;2023-09

3. Self-stabilizing Byzantine-Tolerant Recycling;Lecture Notes in Computer Science;2023

4. Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast;Lecture Notes in Computer Science;2022