Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient Byzantine Fault-Tolerance

From MaRDI portal
Publication:5274264
Jump to:navigation, search

DOI10.1109/TC.2011.221zbMath1365.68078WikidataQ56032164 ScholiaQ56032164MaRDI QIDQ5274264

Lau Cheuk Lung, Miguel Correia, Paulo Veríssimo, Alysson Neves Bessani, Giuliana Santos Veronese

Publication date: 12 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)



Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)


Related Items (6)

A Curvature-Adapted Anisotropic Surface Re-meshing Method ⋮ On elapsed time consensus protocols ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ On the Validity of Consensus ⋮ Unnamed Item ⋮ Order-fairness for Byzantine consensus




This page was built for publication: Efficient Byzantine Fault-Tolerance

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5274264&oldid=19921864"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 21:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki