Show simple item record

dc.contributor.authorAguilera, Marcos Kawazoeen_US
dc.contributor.authorToueg, Samen_US
dc.date.accessioned2007-04-23T18:14:18Z
dc.date.available2007-04-23T18:14:18Z
dc.date.issued1998-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR98-1701en_US
dc.identifier.urihttps://hdl.handle.net/1813/7355
dc.description.abstractWe use a straightforward bivalency argument borrowed from [FLP85] to show that in a synchronous system with up to t crash failures solving consensus requires at least t+1 rounds. The proof is simpler and more intuitive than the traditional one: It uses an easy forward induction rather than a more complex backward induction which needs the induction hypothesis several times.en_US
dc.format.extent85940 bytes
dc.format.extent218791 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Simple Bivalency Proof that t-Resilient Consensus Requires t+1 Roundsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics