Lower bounds for asynchronous consensus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2584, Issue , 2003, Pages 22-23

  Lamport, Leslie ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248875309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37795-6_4     Document Type: Article

References (6)

1. Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, pages 173-186. ACM, 1999.
2. Bernadette Charron-Bost and André Schiper. Uniform consensus is harder than consensus (extended abstract). Technical Report DSC/2000/028, École Polytechnique Fédérale de Lausanne, Switzerland, May 2000.
3. Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, April 1988.
4. Michael J. Fischer, Nancy Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.
5. Leslie Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2): 133-169, May 1998.
6. Marshall Pease, Robert Shostak, and Leslie Lamport Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.