Skip to main content
Article thumbnail
Location of Repository

A new lower bound for the list update problem in the partial cost model

By Christoph Ambühl, Bernd Gärtner and Bernhard von Stengel
Topics: QA75 Electronic computers. Computer science
Publisher: Elsevier
Year: 2001
DOI identifier: 10.1016/S0304-3975(00)00257-7
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.