Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu. OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst., 56(1):22-40, 2015. [doi]
@article{BrodalMN15,
title = {OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm},
author = {Gerth Stølting Brodal and Gabriel Moruz and Andrei Negoescu},
year = {2015},
doi = {10.1007/s00224-012-9427-y},
url = {http://dx.doi.org/10.1007/s00224-012-9427-y},
researchr = {https://researchr.org/publication/BrodalMN15},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {22-40},
}