Online Paging for Flash Memory Devices

DOI10.1007/978-3-642-10631-6_37zbMath1272.68469OpenAlexW1553390825MaRDI QIDQ3652223

Ulrich Meyer, Annamária Kovács, Gabriel Moruz, Andrei Negoescu

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://publikationen.ub.uni-frankfurt.de/files/7090/alphapaging_ir.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

The optimal structure of algorithms for \(\alpha\)-paging

This page was built for publication: Online Paging for Flash Memory Devices