OnlineMin: A Fast Strongly Competitive Randomized Paging...

Theory of Computing Systems 2015 / 1 Vol. 56; Iss. 1

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm

Brodal, Gerth Stølting, Moruz, Gabriel, Negoescu, Andrei
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
56
Language:
english
Journal:
Theory of Computing Systems
DOI:
10.1007/s00224-012-9427-y
Date:
January, 2015
File:
PDF, 703 KB
english, 2015
Conversion to is in progress
Conversion to is failed