Liveness and latency of Byzantine state-machine replication.
- Published in:
- Distributed Computing, 2024, v. 37, n. 2, p. 177, doi. 10.1007/s00446-024-00466-4
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2024 AND VI 37 AND IP 2
Results: 5
1
2
Byzantine consensus is Θ(n2): the Dolev-Reischuk bound is tight even in partial synchrony!
- Published in:
- Distributed Computing, 2024, v. 37, n. 2, p. 89, doi. 10.1007/s00446-023-00458-w
- By:
- Publication type:
- Article
3
On implementing SWMR registers from SWSR registers in systems with Byzantine failures.
- Published in:
- Distributed Computing, 2024, v. 37, n. 2, p. 145, doi. 10.1007/s00446-024-00465-5
- By:
- Publication type:
- Article
4
Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case.
- Published in:
- Distributed Computing, 2024, v. 37, n. 2, p. 121, doi. 10.1007/s00446-024-00464-6
- By:
- Publication type:
- Article
5
Near-optimal distributed computation of small vertex cuts.
- Published in:
- Distributed Computing, 2024, v. 37, n. 2, p. 67, doi. 10.1007/s00446-023-00455-z
- By:
- Publication type:
- Article