Show simple item record

dc.contributor.authorFrias Moya, Leonor
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-06-13T09:15:51Z
dc.date.available2016-06-13T09:15:51Z
dc.date.issued2009-05
dc.identifier.citationFrias, L. "On the number of string lookups in BSTs (and related algorithms) with digital access". 2009.
dc.identifier.urihttp://hdl.handle.net/2117/87918
dc.description.abstractBinary search trees and quicksort are examples of comparison-based data structure and algorithm respectively. Comparison-based data structures and algorithms can be can be augmented so that no redundant character comparisons are made. Unnoticed, this approach also avoids looking up the string in some nodes. This paper haracterizes analytically the number of string lookups in so-augmented BSTs, quicksort and quickselect. Besides, we also characterize a variant proposed in this paper to reduce further the number of string lookups.
dc.format.extent10 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-09-14-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherBST
dc.subject.otherTST
dc.subject.otherStrings
dc.subject.otherMemory hierarchies
dc.subject.otherAnalysis of algorithms
dc.titleOn the number of string lookups in BSTs (and related algorithms) with digital access
dc.typeExternal research report
dc.rights.accessOpen Access
drac.iddocument18557416
dc.description.versionPostprint (published version)
upcommons.citation.authorFrias, L.
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