Back to Results
First PageMeta Content
Online algorithms / Analysis of algorithms / List update problem / Competitive analysis / Adversary model / Algorithm / K-server problem


Theoretical Computer Science–16 www.elsevier.com/locate/tcs A new lower bound for the list update problem in the partial cost model
Add to Reading List

Document Date: 2002-11-18 18:10:24


Open Document

File Size: 117,51 KB

Share Result on Facebook