Mostra el registre d'ítem simple
Tamaño medio de árboles simplificados
| dc.contributor.advisor | Generating Functions |
| dc.contributor.author | Fernández Camacho, María Inés |
| dc.date.accessioned | 2007-12-04T16:29:52Z |
| dc.date.available | 2007-12-04T16:29:52Z |
| dc.date.issued | 1987 |
| dc.identifier.citation | Fernández Camacho, María Inés; "Tamaño medio de árboles simplificados" Qüestió. 1987, vol. 1, núm. 2 |
| dc.identifier.issn | 0210-8054 (versió paper) |
| dc.identifier.uri | http://hdl.handle.net/2099/3954 |
| dc.description.abstract | We 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.extent | Article |
| dc.language.iso | spa |
| dc.publisher | Universitat Politècnica de Barcelona. Centre de Càlcul |
| dc.rights | Attribution-NonCommercial-NoDerivs 2.5 Spain |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/es/ |
| dc.subject.other | Complex Analysis |
| dc.subject.other | Complexity Algorithms |
| dc.title | Tamaño medio de árboles simplificados |
| dc.title.alternative | Average size of simplified trees |
| dc.type | Article |
| dc.subject.lemac | Ciències de la computació |
| dc.subject.lemac | Teoria de la computació |
| dc.description.peerreviewed | Peer Reviewed |
| dc.subject.ams | Classificació AMS::68 Computer science::68P Theory of data |
| dc.subject.ams | Classificació AMS::68 Computer science::68Q Theory of computing |
| dc.rights.access | Open Access |
| local.ordre | 6 |
| local.personalitzacitacio | true |
