Selected papers that cite this one
- Rajeev Alur and Thomas Henzinger. Finitary fairness. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 52-61, Paris, France, 4-7 July 1994. IEEE Computer Society Press.
- 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.
- Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
- Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 569-578, El Paso, Texas, 4-6 May 1997.
- Louise E. Moser and P. M. Melliar-Smith. Byzantine-resistant total ordering algorithms. Accepted for publication in Information and Computation. Final manuscript received for publication October 29, 1998.