Time and message efficient reliable broadcasts-Reference-Cited by-同舟云学术

Time and message efficient reliable broadcasts

Published:1991 Issue: Volume: Page:289-303
ISSN:0302-9743
Container-title:Distributed Algorithms
language:
Short-container-title:

Author:

Chandra Tushar Deepak,Toueg Sam

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54099-7_20.pdf

Reference26 articles.

1. Eugene Amdur, Sam Weber, and Vassos Hadzilacos. On the message complexity of binary byzantine agreement under crash failures. 1990. Submitted to Distributed Computing.

2. Gabriel Bracha. Personal communication. 1982.

3. Flaviu Cristian, Houtan Aghili, H. Raymond Strong, and Danny Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. In Proceedings of the Fifteenth International Symposium on Fault-Tolerant Computing, pages 200–206, June 1985. A revised version appears as IBM Research Laboratory Technical Report RJ5244 (April 1989).

4. J. Chang and N. Maxemchuk. Reliable broadcast protocols. ACM Transactions on Computer Systems, 2(3):251–273, August 1984.

5. Tushar Deepak Chandra and Sam Toueg. Time and message efficient reliable broadcasts. Technical Report 90-1094, Department of Computer Science, Cornell University, May 1990.

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

1. Early Stopping for Any Number of Corruptions;Lecture Notes in Computer Science;2024

2. Agreements and Consensus;Distributed Systems;2023-02-10

3. Monotonic Abstraction Techniques: from Parametric to Software Model Checking;Electronic Proceedings in Theoretical Computer Science;2014-11-13

4. Message and time efficient consensus protocols for synchronous distributed systems;Journal of Parallel and Distributed Computing;2008-05

5. Adaptive timeliness of consensus in presence of crash and timing faults;Journal of Parallel and Distributed Computing;2007-06