Mostra el registre d'ítem simple

dc.contributor.authorFlajolet, Philippe
dc.contributor.authorGourdon, Xavier
dc.contributor.authorMartínez Parra, Conrado
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-02-19T09:33:57Z
dc.date.available2016-02-19T09:33:57Z
dc.date.issued1996-10
dc.identifier.citationFlajolet, P., Gourdon, X., Martinez, C. "Patterns in random binary search tree". 1996.
dc.identifier.urihttp://hdl.handle.net/2117/83154
dc.description.abstractIn a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probability that is characterized in terms of Bessel functions. The results obtained extend to BSTs a type of property otherwise known for strings and combinatorial tree models. They apply to paged trees or to quicksort with halting on short subfiles. As a consequence, various pointer saving strategies for maintaining trees obeying the random BST model can be precisely quantified. The methods used are based on analytic models, especially bivariate generating functions subjected to singularity perturbation asymptotics.
dc.format.extent23 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherBinary search tree
dc.subject.otherBST
dc.titlePatterns in random binary search tree
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1849530
dc.description.versionPostprint (published version)
local.citation.authorFlajolet, P.; Gourdon, X.; Martinez, C.


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple