Show simple item record

dc.contributor.authorMartínez Parra, Conrado
dc.contributor.authorRoura Ferret, Salvador
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-02-02T14:15:03Z
dc.date.available2016-02-02T14:15:03Z
dc.date.issued1995-01-01
dc.identifier.citationMartínez Parra, Conrado; Roura Ferret, Salvador. "Optimal and nearly optimal weighted skip lists". 1995.
dc.identifier.urihttp://hdl.handle.net/2117/82430
dc.description.abstractWe consider the problem of building a static (i.e. no updates are performed) skip list of n elements, given these n elements and the corresponding access probabilities or weights. We develop a dynamic programming algorithm that builds an optimal skip list in the sense that the average access cost is minimized. We also consider nearly optimal skip lists, whose average access cost is not optimal but good enough, and can be built more efficiently than optimal skip lists. Several related issues are also discussed, for instance, other approaches to the construction of nearly optimal skip lists or the construction of optimal skip lists that minimize different kinds of search costs.
dc.format.extent25 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-95-34-R
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherStatic data sets
dc.subject.otherSkip lists
dc.titleOptimal and nearly optimal weighted skip lists
dc.typeExternal research report
dc.rights.accessOpen Access
drac.iddocument1849506
dc.description.versionPostprint (published version)
upcommons.citation.publishedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder