Lower bounds for asynchronous consensus

Brasileiro, F., Greve, F., Mostefaoui, A., Raynal, M.: Consensus in one communication step. In: Malyshkin, V. (ed.). Parallel Computing Technologies (6th International Conference, PaCT 2001), Lecture Notes in Computer Science, vol. 2127, pp. 42–50. Springer-Verlag (2001)

Charron-Bost, B., Schiper, A.: Uniform consensus is harder than consensus (extended abstract). Technical Report DSC/2000/028, école Polytechnique Fédérale de Lausanne, Switzerland (2000). http://lsewww.epfl.ch/Publications/ById/263.html

De Prisco, R., Lampson, B., Lynch, N.: Revisiting the paxos algorithm. Theor. Comput. Sci. 243:35–91 (2000)

Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288–323 (1988)

Fischer, M.J., Lynch, N., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)

Lamport, L.: How to write a proof. American Mathematical Monthly 102(7):600–608 (1995)

Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133–169 (1998)

Lamport, L.: Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32(4), 18–25 (2001)

Lamport, L.: Lower bounds for asynchronous consensus. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds.). Future Directions in Distributed Computing, Lecture Notes in Computer Science, vol. 2584, pp. 22–23. Springer (2003)

Lamport, L.: Specifying Systems. Addison-Wesley, Boston (2003)

Lamport, L.: Fast paxos. Tech. Rep. MSR-TR-2005-112, Microsoft Research (2005)

Pedone, F., Schiper, A.: Handling message semantics with generic broadcast. Distributed Computing 15(2), 97–107 (2002)

Wensley, J., et al.: SIFT: Design and analysis of a fault-tolerant computer for aircraft control. Proceedings of the IEEE 66(10), 1240–1254 (1978)