Space Bounds for Reliable Storage

DOI10.1145/2933057.2933104zbMath1373.68122arXiv1507.05169OpenAlexW2288985505MaRDI QIDQ5361943

Idit Keidar, Alexander Spiegelman, Yuval Cassuto, Gregory Chockler

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundcodingspace complexitystorage emulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks ⋮ Unnamed Item

This page was built for publication: Space Bounds for Reliable Storage