Cookies?
Library Header Image
LSE Research Online LSE Library Services

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

Ambühl, Christoph and Gärtner, Bernd and von Stengel, Bernhard (2001) A new lower bound for the list update problem in the partial cost model. Theoretical Computer Science, 268 (1). pp. 3-16. ISSN 0304-3975

Full text not available from this repository.
Identification Number: 10.1016/S0304-3975(00)00257-7
Item Type: Article
Official URL: http://www.elsevier.com/wps/find/journaldescriptio...
Additional Information: © 2001 Elsevier Science
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Mathematics
Date Deposited: 18 Nov 2008 15:55
Last Modified: 01 Oct 2010 09:10
URI: http://eprints.lse.ac.uk/id/eprint/18452

Actions (login required)

View Item View Item