Journal of the ACM Bibliography
Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Bounds on
the time to reach agreement in the presence of timing uncertainty.
Journal of the ACM, 41(1):122-152, January 1994.
[BibTeX entry]
Selected papers that cite this one
- Rajeev Alur, Hagit Attiya, and Gadi Taubenfeld. Time-adaptive algorithms for
synchronization. In Proceedings of the Twenty-Sixth Annual ACM
Symposium on the Theory of Computing, pages 800-809,
Montréal, Québec, Canada, 23-25 May 1994.
- Rajeev Alur, Hagit Attiya, and Gadi Taubenfeld. Time-adaptive
algorithms for syncronization. SIAM Journal on
Computing, 26(2):539-556, April 1997.
- H. Attiya and M. Mavronicolas. Efficiency of
semisynchronous versus asynchronous networks. Mathematical
Systems Theory, 27(6):547-571, November/December 1994.
- Juan A. Garay and Yoram Moses. Fully polynomial
Byzantine agreement for n > 3t processors in
t + 1 rounds. SIAM Journal on Computing,
27(1):247-290, February 1998.
Selected references
- Piotr Berman, Juan A. Garay, and Kenneth J. Perry. Towards optimal
distributed consensus (extended abstract). In 30th Annual
Symposium on Foundations of Computer Science, pages 410-415,
Research Triangle Park, North Carolina, 30 October-1 November 1989.
IEEE.
- Gabriel Bracha and Sam Toueg. Asynchronous consensus and
broadcast protocols. Journal of the ACM, 32(4):824-840,
October 1985.
- Brian A. Coan and Cynthia Dwork. Simultaneity is harder than
agreement. Information and Computation, 91(2):205-231,
April 1991.
- Richard A. DeMillo, Nancy A. Lynch, and Michael J. Merritt. Cryptographic
protocols. In Proceedings of the Fourteenth Annual ACM
Symposium on Theory of Computing, pages 383-400, San Francisco,
California, 5-7 May 1982.
- Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed
for distributed consensus. Journal of the ACM,
34(1):77-97, January 1987.
- Danny Dolev, Michael J. Fischer, Rob Fowler, Nancy A. Lynch, and H.
Raymond Strong. An
efficient algorithm for Byzantine agreement without authentication.
Information and Control, 52(3):257-274, March 1982.
- Danny Dolev, Ruediger Reischuk, and H. Raymond Strong. Early stopping in Byzantine
agreement. Journal of the ACM, 37(4):720-741, October
1990.
- Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of
partial synchrony. Journal of the ACM, 35(2):288-323,
April 1988.
- Cynthia Dwork and Yoram Moses. Knowledge and common knowledge in a
Byzantine environment: Crash failures. Information and
Computation, 88(2):156-186, October 1990.
- Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed
consensus with one faulty process. Journal of the ACM,
32(2):374-382, April 1985.
- Leslie Lamport and P. M. Melliar-Smith. Synchronizing clocks in the
presence of faults. Journal of the ACM, 32(1):52-78,
January 1985.
- Jennifer Lundelius and Nancy Lynch. An upper and lower bound for
clock synchronization. Information and Control,
62(2/3):190-204, August/September 1984.
- Yoram Moses and Orli Waarts. Coordinated traversal:
(t + 1)-round Byzantine agreement in polynomial time. In
29th Annual Symposium on Foundations of Computer Science,
pages 246-255, White Plains, New York, 24-26 October 1988. IEEE.
- M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence
of faults. Journal of the ACM, 27(2):228-234, April
1980.
- Jennifer Lundelius Welch and Nancy A. Lynch. A new fault-tolerance algorithm for
clock synchronization. Information and Computation,
77(1):1-36, April 1988.
Shortcuts: