Paging and list update under bijective analysis

MaRDI QIDQ4633928zbMATH OpenFDO

Authors Spyros Angelopoulos, P. Schweitzer

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496893

Mathematics Subject Classification ID

Theory of operating systems (68N25) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• Paging and list update under bijective analysis
• On the separation and equivalence of paging strategies and other online algorithms
• List Update with Locality of Reference
• On-Line Paging Against Adversarially Biased Random Inputs
• On the separation and equivalence of paging strategies

Cited in

(6)

• Stochastic dominance and the bijective ratio of online algorithms
• Parameterized analysis of paging and list update algorithms
• Parameterized Analysis of Paging and List Update Algorithms
• Paging and list update under bijective analysis
• Lossless image compression using list update algorithms
• On the separation and equivalence of paging strategies and other online algorithms

This page was built for publication: Paging and list update under bijective analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633928)