1 paper
Orin Levy, Noam Touitou, Aviv Rosenberg
Online paging is a fundamental problem in the field of online algorithms, in which one maintains a cache of k slots as requests for fetching pages arrive online. In the weighted…