Show simple item record

dc.contributor.advisorGenerating Functions
dc.contributor.authorFernández Camacho, María Inés
dc.date.accessioned2007-12-04T16:29:52Z
dc.date.available2007-12-04T16:29:52Z
dc.date.issued1987
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.identifier.urihttp://hdl.handle.net/2099/3954
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.format.extentArticle
dc.language.isospa
dc.publisherUniversitat Politècnica de Barcelona. Centre de Càlcul
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.otherComplex Analysis
dc.subject.otherComplexity Algorithms
dc.titleTamaño medio de árboles simplificados
dc.title.alternativeAverage size of simplified trees
dc.typeArticle
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
upcommons.ordre6


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

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