Author： Anderson E.J. Hildrum K. Karlin A.R. Rasala A. Saks M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.287, Iss.2, 2002-09, pp. : 393-418
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
A competitive analysis of the list update problem with lookahead
By Albers S.
Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. :
Access to resources
Recommend
Parallelization of the quantile function optimization algorithms
By Kibzun A.
Automation and Remote Control, Vol. 68, Iss. 5, 2007-05 ,pp. :
BSC reliability function under list decoding
By Blinovsky V.
Problems of Information Transmission, Vol. 46, Iss. 4, 2010-12 ,pp. :
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. :