ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2107.11144
  4. Cited By
Making Reads in BFT State Machine Replication Fast, Linearizable, and
  Live

Making Reads in BFT State Machine Replication Fast, Linearizable, and Live

23 July 2021
C. Berger
Hans P. Reiser
A. Bessani
ArXiv (abs)PDFHTML

Papers citing "Making Reads in BFT State Machine Replication Fast, Linearizable, and Live"

4 / 4 papers shown
Title
Linearizability and State-Machine Replication: Is it a match?
Linearizability and State-Machine Replication: Is it a match?
F. Hauck
Alexander Heß
57
0
0
01 Jul 2024
TransEdge: Supporting Efficient Read Queries Across Untrusted Edge Nodes
TransEdge: Supporting Efficient Read Queries Across Untrusted Edge Nodes
Abhishek A. Singh
Aasim Khan
S. Mehrotra
Faisal Nawab
51
2
0
16 Feb 2023
Simulating BFT Protocol Implementations at Scale
Simulating BFT Protocol Implementations at Scale
Christian Berger
Sadok Ben Toumia
Hans P. Reiser
22
0
0
31 Aug 2022
SplitBFT: Improving Byzantine Fault Tolerance Safety Using Trusted
  Compartments
SplitBFT: Improving Byzantine Fault Tolerance Safety Using Trusted Compartments
I. Messadi
M. Becker
Kai Bleeke
Leander Jehl
Sonia Ben Mokhtar
R. Kapitza
82
10
0
18 May 2022
1