Journal of the ACM Bibliography

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.

• 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.

• Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, and H. Raymond Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. Information and Computation, 97(2):205-233, April 1992.

• Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, and Tiko Kameda. Optimal amortized distributed consensus. Information and Computation, 120(1):93-100, July 1995.

• R. A. Bazzi and G. Neiger. The complexity of almost-optimal simultaneous coordination. Algorithmica, 17(3):308-321, March 1997.

• Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.

• Benny Chor, Amos Israeli, and Ming Li. Wait-free consensus using asynchronous hardware. SIAM Journal on Computing, 23(4):701-712, August 1994.

• Brian A. Coan and Jennifer L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61-85, March 1992.

• Pallab Dasgupta. Agreement under faulty interfaces. Information Processing Letters, 65(3):125-129, 13 February 1998.

• 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, Joseph Y. Halpern, Barbara Simons, and Ray Strong. Dynamic fault-tolerant clock synchronization. Journal of the ACM, 42(1):143-185, January 1995.

• Danny Dolev, Ruediger Reischuk, and H. Raymond Strong. Early stopping in Byzantine agreement. Journal of the ACM, 37(4):720-741, October 1990.

• Ronald Fagin, Joseph Y. Halpern, and Moshe Y. Vardi. A model-theoretic analysis of knowledge. Journal of the ACM, 38(2):382-428, April 1991.

• Uriel Feige, Prabhakar Raghavan, David Peleg, and Eli Upfal. Computing with noisy information. SIAM Journal on Computing, 23(5):1001-1018, October 1994.

• Alan D. Fekete. Asynchronous approximate agreement. Information and Computation, 115(1):95-124, 15 November 1994.

• Pesech Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing, 26(4):873-933, August 1997.

• Michael J. Fischer, Shlomo Moran, Steven Rudich, and Gadi Taubenfeld. The wakeup problem. SIAM Journal on Computing, 25(6):1332-1357, December 1996.

• 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.

• Prasad Jayanti, Tushar Deepak Chandra, and Sam Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451-500, May 1998.

• 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.

• Tal Rabin. Robust sharing of secrets when the dealer is honest or cheating. Journal of the ACM, 41(6):1089-1109, November 1994.

Shortcuts: