Objects shared by Byzantine processes (Extended abstract)
From MaRDI portal
Recommendations
- Objects shared by Byzantine processes
- On the power of shared object types to implement one-resilient consensus
- Tight bounds for shared memory systems accessed by Byzantine processes
- Tight bounds for shared memory systems accessed by Byzantine processes
- Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
- Two distributed problems involving Byzantine processes
- Bounded-wait combining: constructing robust and high-throughput shared objects
- Distributed computability in Byzantine asynchronous systems
- Byzantine lattice agreement in synchronous message passing systems
Cited in
(9)- The behavior of shared objects: Concept, pitfalls, and a new model
- Wait-free Byzantine consensus.
- Tight bounds for shared memory systems accessed by Byzantine processes
- Implementing sequentially consistent shared objects using broadcast and point-to-point communication
- Computing with faulty shared objects
- Tight bounds for shared memory systems accessed by Byzantine processes
- scientific article; zbMATH DE number 7561269 (Why is no real title available?)
- Objects shared by Byzantine processes
- Hundreds of impossibility results for distributed computing
This page was built for publication: Objects shared by Byzantine processes (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766890)