The complexity of robust atomic storage
From MaRDI portal
Distributed systems (68M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)
Recommendations
- How fast can a very robust read be?
- Fast access to distributed atomic memory
- How fast can a distributed atomic read be?
- Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
- Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
Cites work
- Almost-Everywhere Secure Computation
- Broadcasting in dynamic radio networks
- Consensus algorithms with one-bit messages
- Continuous consensus via common knowledge
- Distributed computation in dynamic networks
- Fault Tolerance in Networks of Bounded Degree
- Flooding time in edge-Markovian dynamic graphs
- Gradient clock synchronization in dynamic networks
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Knowledge and common knowledge in a distributed environment
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Optimal gradient clock synchronization in dynamic networks
- Parsimonious flooding in dynamic graphs
- Perfectly secure message transmission
- Programming simultaneous actions using common knowledge
- Reaching Agreement in the Presence of Faults
Cited in
(2)
This page was built for publication: The complexity of robust atomic storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943384)
