On competitive on-line paging with lookahead

DOI10.1007/3-540-60922-9_48zbMath1379.68090OpenAlexW1537730274MaRDI QIDQ4593963

Dany Breslauer

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_48

Mathematics Subject Classification ID

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

Related Items (2)

Analysis of simple randomized buffer management for parallel I/O ⋮ A competitive analysis of the list update problem with lookahead

This page was built for publication: On competitive on-line paging with lookahead