ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1605.06844
  4. Cited By
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory
  Emulation

Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation

22 May 2016
V. Cadambe
Zhiying Wang
Nancy A. Lynch
ArXivPDFHTML

Papers citing "Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation"

6 / 6 papers shown
Title
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
K. Konwar
N. Prakash
Nancy A. Lynch
Muriel Médard
37
20
0
03 Mar 2017
Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of
  Read/Write Primitives
Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives
G. Chockler
D. Dobre
A. Shraer
Alexander Spiegelman
18
5
0
15 Aug 2015
Space Bounds for Reliable Storage: Fundamental Limits of Coding
Space Bounds for Reliable Storage: Fundamental Limits of Coding
Alexander Spiegelman
Yuval Cassuto
G. Chockler
I. Keidar
32
17
0
18 Jul 2015
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
V. Cadambe
Nancy A. Lynch
Muriel Médard
Peter M. Musial
57
36
0
15 Jul 2014
Erasure-Coded Byzantine Storage with Separate Metadata
Erasure-Coded Byzantine Storage with Separate Metadata
Elli Androulaki
Christian Cachin
D. Dobre
Marko Vukolić
62
23
0
20 Feb 2014
Proofs of Writing for Efficient and Robust Storage
Proofs of Writing for Efficient and Robust Storage
D. Dobre
Ghassan O. Karame
Wenting Li
Matthias Majuntke
N. Suri
Marko Vukolić
66
41
0
14 Dec 2012
1