The following pages link to Competitive paging algorithms (Q3988829):
Displayed 50 items.
- The working set algorithm has competitive ratio less than two (Q287173) (← links)
- Uniform multipaging reduces to paging (Q293296) (← links)
- Comparison and analysis of ten static heuristics-based Internet data replication techniques (Q436652) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Online algorithms with advice: the tape model (Q529045) (← links)
- Knowledge state algorithms (Q548658) (← links)
- Competitive strategy for on-line leasing of depreciable equipment (Q646109) (← links)
- A strongly competitive randomized paging algorithm (Q808246) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Paging with connections: FIFO strikes again (Q884462) (← links)
- Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
- The weighted list update problem and the lazy adversary (Q1208728) (← links)
- On competitive on-line paging with lookahead (Q1276313) (← links)
- Paging against a distribution and IP networking (Q1305939) (← links)
- On the power of randomization in on-line algorithms (Q1312184) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- Paging more than one page (Q1391298) (← links)
- More on randomized on-line algorithms for caching. (Q1401208) (← links)
- Connection caching: Model and algorithms. (Q1401982) (← links)
- On the competitiveness of the move-to-front rule (Q1575556) (← links)
- Competitive analysis of randomized paging algorithms (Q1575677) (← links)
- Trackless online algorithms for the server problem (Q1607049) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← 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)
- On randomization in on-line computation. (Q1854274) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- Online companion caching (Q1887084) (← links)
- Combining request scheduling with web caching (Q1887085) (← links)
- Competitive caching of query results in search engines (Q1887088) (← links)
- A proof of the optimality of the MIN paging algorithm using linear programming duality (Q1924620) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Randomized online computation with high probability guarantees (Q2134747) (← links)
- The work function algorithm for the paging problem (Q2166767) (← links)
- Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
- The worst page-replacement policy (Q2272194) (← links)
- Paging with request sets (Q2272199) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- Analysis of simple randomized buffer management for parallel I/O (Q2390215) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- Online metric tracking and smoothing (Q2441592) (← links)
- Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
- Engineering Efficient Paging Algorithms (Q2828192) (← links)