Author： Albers S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.197, Iss.1, 1998-05, pp. : 95-109
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On competitive on-line paging with lookahead
By Breslauer D.
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Access to resources
Recommend
A new lower bound for the list update problem in the partial cost model
By Ambuhl C. Gartner B. von Stengel
Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. :
On list update and work function algorithms
By Anderson E.J. Hildrum K. Karlin A.R. Rasala A. Saks M.
Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. :