OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm

Research Area: Algorithms for Modern Hardware: Flash Memory Year: 2011
Type of Publication: Unpublished
Authors: Gabriel Moruz; Andrei Negoescu
BibTex:
Note:
Submitted at The 38th International Colloquium on Automata, Languages and Programming. Available online at http://www.ae.cs.uni-frankfurt.de/pdf/simple_paging.pdf
[Bibtex]
[ Back ]