Ambühl, Christoph, 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.| Item Type: | Article |
|---|---|
| Official URL: | http://www.elsevier.com/wps/find/journaldescriptio... |
| Additional Information: | © 2001 Elsevier Science |
| Library of Congress subject classification: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Sets: | Departments > Mathematics |
| Date Deposited: | 18 Nov 2008 15:55 |
| URL: | http://eprints.lse.ac.uk/18452/ |
Actions (login required)
![]() |
Record administration - authorised staff only |
