Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus algorithms with one-bit messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular construction of a Byzantine agreement protocol with optimal message bit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on information exchange for Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy impossibility proofs for distributed consensus problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message-optimal protocols for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank

Revision as of 15:31, 17 May 2024

scientific article
Language Label Description Also known as
English
Modular construction of an efficient 1-bit Byzantine agreement protocol
scientific article

    Statements