Universal rewriting in constrained memories
Anxiao Andrew Jiang, Michael L. Langberg, Moshe Schwartz, Jehoshua Bruck · 2009
A constrained memory is a storage device whose elements change their states under some constraints. A typical example is flash memories, in which cell levels are easy to increase but hard to decrease. In a general rewriting model, the stored data changes with some pattern determined by the application. In a constrained memory, an appropriate representation is needed for the stored data to enable efficient rewriting.