Concurrent Use of Write-Once Memory
From MaRDI portal
Publication:2835021
DOI10.1007/978-3-319-48314-6_9zbMath1482.68052OpenAlexW2548525540MaRDI QIDQ2835021
James Aspnes, Keren Censor-Hillel, Eitan Yaakobi
Publication date: 1 December 2016
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_9
Cites Work
- Unnamed Item
- Tight bounds for adopt-commit objects
- On interprocess communication. I: Basic formalism
- On interprocess communication. II: Algorithms
- WOM-codes construits à partir des codes de Hamming
- Time and space optimal implementations of atomic multi-writer register
- Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
- On the Time and Space Complexity of ABA Prevention and Detection
- On the time and space complexity of randomized test-and-set
- Strongly linearizable implementations
- High Sum-Rate Three-Write and Nonbinary WOM Codes
- Short <inline-formula> <tex-math notation="TeX">\(Q\) </tex-math></inline-formula>-Ary Fixed-Rate WOM Codes for Guaranteed Rewrites and With Hot/Cold Write Differentiation
- Capacity-Achieving Multiwrite WOM Codes
- Codes for Write-Once Memories
- Sub-logarithmic Test-and-Set against a Weak Adversary
- Generalized 'write-once' memories
- How to reuse a “write-once≓ memory
- Coding for a Write-Once Memory
- On the capacity of permanent memory
- Linear binary code for write-once memories (Corresp.)
- On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph
- Position Modulation Code for Rewriting Write-Once Memories
- Polar Write Once Memory Codes
- New Constructions of WOM Codes Using the Wozencraft Ensemble
- Optimal multi-writer multi-reader atomic register
- Polylogarithmic concurrent data structures from monotone circuits
This page was built for publication: Concurrent Use of Write-Once Memory
