Validity Conditions in Agreement Problems and Time Complexity

1. Charron-Bost, B., Schiper, A.: Uniform Consensus is Harder than Consensus. Technical Report DSC/2000/028, Département Systèmes de Communication, EPFL (May 2000), to appear in Journal of Algorithms

   Google Scholar 

2. Charron-Bost, B., Toueg, S.: Comparing the Atomic Commitment and Consensus Problems (2001) (in preparation)

   Google Scholar 

3. Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. Journal of the ACM 35(2), 288–323 (1988)

   Article  MathSciNet  Google Scholar 

4. Dwork, C., Moses, Y.: Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures. Information and Computation 88(2), 156–186 (1990)

   Article  MATH  MathSciNet  Google Scholar 

5. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)

   Article  MATH  MathSciNet  Google Scholar 

6. Keidar, I., Rajsbaum, S.: A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters 85(1), 47–52 (2003)

   Article  MATH  MathSciNet  Google Scholar 

7. Lamport, L.: The Weak Byzantine Generals Problem. Journal of the ACM 30(3), 668–676 (1983)

   Article  MATH  MathSciNet  Google Scholar 

8. Lamport, L.: Lower Bounds on Consensus. Unpublished note (March 2000)

   Google Scholar 

9. Lamport, L., Fischer, M.: Byzantine Generals and Transaction Commit Protocols. Technical Report 62, SRI International (April 1982)

   Google Scholar 

10. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)

    MATH  Google Scholar 

11. Merritt, M.J.: Unpublished Notes (1985)

    Google Scholar 

12. Skeen, D.: Nonblocking Commit Protocols. In: Proceedings of the ACM SIGMOD Conf. on Management of Data, June 1982, pp. 133–147. ACM, New York (1982)

    Google Scholar 

Download references