Competitive Analysis of Flash-Memory Algorithms

From MaRDI portal

Revision as of 10:23, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5449520

Jump to:navigation, search

DOI10.1007/11841036_12zbMath1131.68597OpenAlexW1526462389MaRDI QIDQ5449520

Sivan Toledo, Avraham Ben-Aroya

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_12

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07)

Related Items (4)

Stochastic modeling and optimization of garbage collection algorithms in solid-state drive systems ⋮ A competitive analysis for the start-gap algorithm for online memory wear leveling ⋮ Algorithmic Building Blocks for Asymmetric Memories ⋮ The Online House Numbering Problem: Min-Max Online List Labeling

This page was built for publication: Competitive Analysis of Flash-Memory Algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5449520&oldid=20219044"