Average size of simplified trees

MaRDI QIDQ5323336zbMATH OpenFDO

Authors María-Inés Fernández-Camacho

Publication date 23 July 2009

Full work available at URL https://eudml.org/doc/40080, http://www.idescat.cat/sort/questiio/questiiopdf/11.2.6.fernandez.pdf

zbMATH Keywords

complex analysiscomplexity algorithmsgenerating functions

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1984553
• The average height of Catalan trees by counting lattice paths
• scientific article; zbMATH DE number 3978405
• scientific article; zbMATH DE number 3995070
• scientific article; zbMATH DE number 3862455

Cited in

(3)

• scientific article; zbMATH DE number 1984553 (Why is no real title available?)
• The average size of ordered binary subgraphs
• Algebraic simplification in computer algebra: an analysis of bottom-up algorithms

This page was built for publication: Average size of simplified trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323336)