Mostra el registre d'ítem simple
On the number of string lookups in BSTs (and related algorithms) with digital access
| dc.contributor.author | Frias Moya, Leonor |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
| dc.date.accessioned | 2016-06-13T09:15:51Z |
| dc.date.available | 2016-06-13T09:15:51Z |
| dc.date.issued | 2009-05 |
| dc.identifier.citation | Frias, L. "On the number of string lookups in BSTs (and related algorithms) with digital access". 2009. |
| dc.identifier.uri | http://hdl.handle.net/2117/87918 |
| dc.description.abstract | Binary 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.extent | 10 p. |
| dc.language.iso | eng |
| dc.relation.ispartofseries | LSI-09-14-R |
| dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| dc.subject.other | BST |
| dc.subject.other | TST |
| dc.subject.other | Strings |
| dc.subject.other | Memory hierarchies |
| dc.subject.other | Analysis of algorithms |
| dc.title | On the number of string lookups in BSTs (and related algorithms) with digital access |
| dc.type | External research report |
| dc.rights.access | Open Access |
| local.identifier.drac | 18557416 |
| dc.description.version | Postprint (published version) |
| local.citation.author | Frias, L. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]