Show simple item record

dc.contributor.advisorGenerating Functions
dc.contributor.authorFernández Camacho, María Inés
dc.identifier.citationFernández Camacho, María Inés; "Tamaño medio de árboles simplificados" Qüestió. 1987, vol. 1, núm. 2
dc.identifier.issn0210-8054 (versió paper)
dc.description.abstractWe have studied the average and the variance of the size of simplified trees obtained by simplifying a random tree, for both families of p-ary and general trees. But the most interesting fact in these paper is the methodology we have used, that in our opinion could be applied to the analysis of a broad class of tree simplification algorithms. This methodology involves the study of Borne formal power series, and the application of the Darboux-Polya theorem to obtain asympthotic approximationsj as well as Borne other results from complex analysis.
dc.publisherUniversitat Politècnica de Barcelona. Centre de Càlcul
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.subject.otherComplex Analysis
dc.subject.otherComplexity Algorithms
dc.titleTamaño medio de árboles simplificados
dc.title.alternativeAverage size of simplified trees
dc.subject.lemacCiències de la computació
dc.subject.lemacTeoria de la computació
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::68 Computer science::68P Theory of data
dc.subject.amsClassificació AMS::68 Computer science::68Q Theory of computing
dc.rights.accessOpen Access

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 2.5 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 2.5 Spain