Pages that link to "Item:Q1575677"

The following pages link to Competitive analysis of randomized paging algorithms (Q1575677):

Displaying 29 items.

• A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
• The \(k\)-server problem (Q458484) (← links)
• The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
• Knowledge state algorithms (Q548658) (← links)
• A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
• The relative worst-order ratio applied to paging (Q881599) (← links)
• Paging with connections: FIFO strikes again (Q884462) (← links)
• More on randomized on-line algorithms for caching. (Q1401208) (← links)
• A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
• On the smoothness of paging algorithms (Q1743122) (← links)
• The \(k\)-resource problem in uniform metric spaces (Q1758162) (← links)
• Online companion caching (Q1887084) (← links)
• The weighted 2-server problem (Q1887090) (← links)
• Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
• Randomized online computation with high probability guarantees (Q2134747) (← links)
• The worst page-replacement policy (Q2272194) (← links)
• Paging with request sets (Q2272199) (← links)
• An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
• Online file caching with rejection penalties (Q2346958) (← links)
• General caching is hard: even with small pages (Q2408914) (← links)
• Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
• Engineering Efficient Paging Algorithms (Q2828192) (← links)
• On Variants of File Caching (Q3012805) (← links)
• Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
• KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS (Q3620620) (← links)
• Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
• Measuring the problem-relevant information in input (Q5321779) (← links)
• (Q6058190) (← links)