Contents lruis2: LRU is k-competitive for the paging problem Jan 29 05:27 lfd: An optimal offline algorithm for the paging problem Jan 29 06:12 2002 lowerdet: Lower bound of k on the deterministic competitiveness Jan 24 04:17 2002 workf01: Work functions for the paging problem I Jan 30 03:21 2002 workf02: Work functions for the paging problem II Jan 31 09:32 2002 bookmarks: Bookmark algorithms for the paging problem I Feb 2 10:29 2002 bookmark1: Bookmark algorithms for the paging problem II Feb 11 15:11 2002