Parameterized analysis of paging and list update algorithms
From MaRDI portal
Publication:2346961
DOI10.1007/s00453-013-9800-5zbMath1314.68408OpenAlexW1988381536MaRDI QIDQ2346961
Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz
Publication date: 26 May 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9800-5
Analysis of algorithms (68W40) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (2)
On list update with locality of reference ⋮ Quantifying competitiveness in paging with locality of reference
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theoretical comparison of LRU and LRU-K
- On the relative dominance of paging algorithms
- The relative worst-order ratio applied to paging
- LRU is better than FIFO
- Randomized competitive algorithms for the list update problem
- A new measure for the study of on-line algorithms
- Off-line algorithms for the list update problem
- A unified analysis of paging and caching
- On-line file caching
- Competitive paging with locality of reference
- A simpler analysis of Burrows-Wheeler-based compression
- Parametrized complexity theory.
- On adequate performance measures for paging
- The relative worst order ratio for online algorithms
- An analysis of the Burrows—Wheeler transform
- On List Update with Locality of Reference
- Parameterized Analysis of Paging and List Update Algorithms
- Self-adjusting binary search trees
- A locally adaptive data compression scheme
- Competitive paging algorithms
- Improved Randomized On-Line Algorithms for the List Update Problem
- Beyond Competitive Analysis
- Markov Paging
- On-Line Paging Against Adversarially Biased Random Inputs
- The relative worst order ratio applied to seat reservation
- List Update with Locality of Reference
- Algorithms – ESA 2004
- The working set model for program behavior
- On paging with locality of reference
- On the competitive theory and practice of online list accessing algorithms
This page was built for publication: Parameterized analysis of paging and list update algorithms
