Relative Interval Analysis of Paging Algorithms on Access Graphs

DOI10.1007/978-3-642-40104-6_17zbMath1390.68174arXiv1305.0669OpenAlexW2570215759MaRDI QIDQ2842157

Sushmita Gupta, Kim S. Larsen, Joan. Boyar

Publication date: 12 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0669

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items (4)

Quantifying Competitiveness in Paging with Locality of Reference ⋮ Online bin covering: expectations vs. guarantees ⋮ Quantifying competitiveness in paging with locality of reference ⋮ Online Bin Covering: Expectations vs. Guarantees

This page was built for publication: Relative Interval Analysis of Paging Algorithms on Access Graphs