Publication:4038694
From MaRDI portal
zbMath0765.68048MaRDI QIDQ4038694
P. Sipala, Jean-Marc Steyaert, Philippe Flajolet
Publication date: 18 May 1993
generating functions; asymptotic analysis; branching models; compaction problem; algebraic enumeration; random uniform model; tree compaction
Related Items
Expectation transfer between branching processes and random trees, Unnamed Item, On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations, Analytic analysis of algorithms, Compaction for two models of logarithmic‐depth trees: Analysis and experiments, Simplifications of Uniform Expressions Specified by Systems, XML compression via directed acyclic graphs, On the sub-permutations of pattern avoiding permutations, Average-case analysis of unification algorithms, Pattern avoidance in binary trees, On finding common subtrees, Encoding trees by linear recurrence sequences, A bijection of plane increasing trees with relaxed binary trees of right height at most one, Learning grammars for architecture-specific facade parsing, Compacted binary trees admit a stretched exponential, Partial derivative automaton by compressing regular expressions, Distinct fringe subtrees in random trees, Manipulation of regular expressions using derivatives: an overview, Supertrees, Asymptotic enumeration of compacted binary trees of bounded right height, Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models, Constructing small tree grammars and small circuits for formulas, Noncontiguous pattern containment in binary trees, Grammar-Based Tree Compression
