@inproceedings{ceb57a186cc144edb364bb3527e04c21,
title = "The influence of lookahead in competitive paging algorithms",
abstract = "We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging algorithm is on-line with strong lookahead l if it sees the present request and a sequence of future requests that contains I pairwise distinct pages. These pages also differ from the page requested by the present request. We show that strong look head has practical as well as theoreticM importance and significantly improves the competitive factors of on-line paging algorithms. This is the first model of lookahead having such properties. In addition to lower bounds we present a number of deterministic and randomized on-line paging algorithms with strong lookahead which are optimal or nearly optimal.",
author = "Susanne Albers",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1993.; 1st Annual European Symposium on Algorithms, ESA 1993 ; Conference date: 30-09-1993 Through 02-10-1993",
year = "1993",
doi = "10.1007/3-540-57273-2_39",
language = "English",
isbn = "9783540572732",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--12",
editor = "Thomas Lengauer",
booktitle = "Algorithms ESA 1993 – 1st Annual European Symposium, Proceedings",
}