@inproceedings{31573d5ff4644ce7bd7f6d2bfc353df0,
title = "A competitive analysis of the list update problem with lookahead",
abstract = "We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list update problem using these models. In addition to lower bounds we present a number of competitive on-line algorithms with lookahead.",
author = "Susanne Albers",
note = "Publisher Copyright: {\textcopyright} 1994, Springer Verlag. All rights reserved.; 19th International Symposium on Mathematical Foundations of Computer Science, MFCS 1994 ; Conference date: 22-08-1994 Through 26-08-1994",
year = "1994",
doi = "10.1007/3-540-58338-6_67",
language = "English",
isbn = "9783540583387",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "201--210",
editor = "Igor Privara and Branislav Rovan and Peter Ruzicka",
booktitle = "Mathematical Foundations of Computer Science 1994 - 19th International Symposium, MFCS 1994, Proceedings",
}