OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.