scientific article; zbMATH DE number 7561263

DOI10.4230/LIPICS.DISC.2018.11zbMath1497.68035arXiv1805.06265MaRDI QIDQ5090901

Alon Berger, Alexander Spiegelman, Idit Keidar

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1805.06265

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundscodingstoragespace complexityregister emulations

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Wait-free regular storage from Byzantine components
• On interprocess communication. II: Algorithms
• One-write algorithms for multivalued regular and atomic registers
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Fault-tolerant wait-free shared objects
• Amnesic Distributed Storage
• Optimistic Erasure-Coded Distributed Storage
• Concurrent Reading While Writing
• Sharing memory robustly in message-passing systems
• Space Bounds for Reliable Storage
• Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
• Space Complexity of Fault-Tolerant Register Emulations

This page was built for publication: