On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
From MaRDI portal
Publication:4000866
DOI10.1007/BF02835833zbMath0767.68056MaRDI QIDQ4000866
Ronitt Rubinfeld, Sandy Irani, Moni Naor
Publication date: 26 September 1992
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A competitive analysis for the start-gap algorithm for online memory wear leveling ⋮ Computability and complexity in self-assembly ⋮ The Online House Numbering Problem: Min-Max Online List Labeling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to reuse a “write-once≓ memory
- Applications of a Planar Separator Theorem
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- Design and implementation of an efficient priority queue
- The Parallel Evaluation of General Arithmetic Expressions
This page was built for publication: On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?
