Show simple item record

dc.contributor.authorTurpin, Russellen_US
dc.contributor.authorCoan, Brian A.en_US
dc.date.accessioned2023-03-29T15:10:14Z
dc.date.available2023-03-29T15:10:14Z
dc.date.issued1984-04
dc.identifier.urihttps://hdl.handle.net/1721.1/149589
dc.description.abstractA binary Byzantine agreement algorithm can be extended to produce a multivalued Byzantine agreement algorithm. The resulting multivalued algorithm is cheaper than previously published algorithms when the cost of transmitting values from the multivalen_US
dc.relation.ispartofseriesMIT-LCS-TR-315
dc.titleExtending Binary Byzantine Agreement to Multivalued Byzantine Agreementen_US
dc.identifier.oclc13567024


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record