On the number of string lookups in BSTs (and related algorithms) with digital access

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/87918

Title:	On the number of string lookups in BSTs (and related algorithms) with digital access
Author:	Frias Moya, Leonor
Other authors:	Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
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.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -BST -TST -Strings -Memory hierarchies -Analysis of algorithms
Rights:
Document type:	Article - Published version Report
Share: