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

Ambühl, C., Gärtner, B. & von Stengel, B.ORCID logo (2001). A new lower bound for the list update problem in the partial cost model. Theoretical Computer Science, 268(1), 3-16. https://doi.org/10.1016/S0304-3975(00)00257-7
Copy
Item Type Article
Copyright holders © 2001 Elsevier Science
Departments LSE > Academic Departments > Mathematics
DOI 10.1016/S0304-3975(00)00257-7
Date Deposited 18 Nov 2008
URI https://researchonline.lse.ac.uk/id/eprint/18452

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics