Search results
From MaRDI portal
- Publication Date of Publication Type Polar Write Once Memory Codes 2017-06-08 Paper...10 bytes (16 words) - 22:11, 27 December 2023
- 1992-09-27 Paper On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? 1992-09-26 Paper A competitive...10 bytes (16 words) - 04:51, 12 December 2023
- with High Dimension 2004-01-08 Paper On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph...10 bytes (20 words) - 07:27, 7 October 2023
- Publication Date of Publication Type Codes for Write-Once Memories 2017-06-08 Paper...10 bytes (16 words) - 11:36, 6 October 2023
- Publication Date of Publication Type Linear binary code for write-once memories (Corresp.) 1986-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3762220...10 bytes (16 words) - 02:44, 28 December 2023
- Sequences Over Non-Identical Channels 2019-01-28 Paper On the Capacity of Write-Once Memories 2017-10-19 Paper Constructions of Snake-in-the-Box Codes for Rank...10 bytes (16 words) - 02:58, 7 October 2023
- Approximate Maximum-Likelihood Certificate 2017-06-08 Paper Polar Write Once Memory Codes 2017-06-08 Paper Improved Bounds on the Finite Length Scaling...10 bytes (16 words) - 01:43, 25 September 2023
- Paper Clocked Population Protocols 2017-10-11 Paper Concurrent Use of Write-Once Memory 2016-12-01 Paper Lower Bounds for Restricted-Use Objects 2016-06-16...10 bytes (16 words) - 12:52, 11 December 2023
- with No Dependence on Conductance 2017-02-15 Paper Concurrent Use of Write-Once Memory 2016-12-01 Paper Lower Bounds for Restricted-Use Objects 2016-06-16...10 bytes (18 words) - 00:18, 10 December 2023
- Network Coding 2017-08-08 Paper Position Modulation Code for Rewriting Write-Once Memories 2017-07-12 Paper https://portal.mardi4nfdi.de/entity/Q5494192 2006-10-17...10 bytes (16 words) - 15:24, 6 October 2023
- Applications to Flash Memory 2017-06-08 Paper Codes for Write-Once Memories 2017-06-08 Paper Rewriting Codes for Flash Memories 2017-06-08 Paper Coding...10 bytes (16 words) - 10:18, 7 October 2023
- Secure Write-Efficient Memories 2017-06-08 Paper Trajectory Codes for Flash Memory 2017-06-08 Paper Asymmetric Error Correction and Flash-Memory Rewriting...10 bytes (17 words) - 11:29, 6 October 2023
- 1993-04-01 Paper On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? 1992-09-26 Paper An implicit...10 bytes (17 words) - 20:42, 9 December 2023
- partir des codes de Hamming 1987-01-01 Paper Linear binary code for write-once memories (Corresp.) 1986-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3764051...10 bytes (17 words) - 14:30, 6 October 2023
- covering radius of codes 1986-01-01 Paper Linear binary code for write-once memories (Corresp.) 1986-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3764051...10 bytes (19 words) - 22:10, 8 December 2023
- https://portal.mardi4nfdi.de/entity/Q3332923 1983-01-01 Paper How to reuse a “write-once≓ memory 1982-01-01 Paper A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm...10 bytes (17 words) - 02:36, 11 December 2023
- Deterministic History-Independent Strategies for Storing Information on Write-Once Memories 2007-11-28 Paper Polling with Physical Envelopes: A Rigorous Analysis...10 bytes (16 words) - 14:14, 7 October 2023
- https://portal.mardi4nfdi.de/entity/Q3671039 1983-01-01 Paper How to reuse a “write-once≓ memory 1982-01-01 Paper The subgraph homeomorphism problem 1980-01-01 Paper...10 bytes (19 words) - 23:02, 24 September 2023
- 1993-01-16 Paper On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? 1992-09-26 Paper A competitive...10 bytes (17 words) - 14:14, 7 October 2023
- for Write-Once Memories 2017-06-08 Paper Rewriting Codes for Flash Memories 2017-06-08 Paper Time–Space Constrained Codes for Phase-Change Memories 2017-06-08...10 bytes (19 words) - 23:21, 12 December 2023
