Pages that link to "Item:Q4512578"
From MaRDI portal
The following pages link to On-Line Paging Against Adversarially Biased Random Inputs (Q4512578):
Displaying 16 items.
- Online network design with outliers (Q334928) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- More on randomized on-line algorithms for caching. (Q1401208) (← links)
- Competitive analysis of the LRFU paging algorithm (Q1849588) (← links)
- The worst page-replacement policy (Q2272194) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- Relative interval analysis of paging algorithms on access graphs (Q2513607) (← links)
- Measuring the problem-relevant information in input (Q5321779) (← links)
- On the Relative Dominance of Paging Algorithms (Q5387781) (← links)
- Critical sizing of LRU caches with dependent requests (Q5441519) (← links)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis (Q5452148) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)