scientific article

zbMath0765.68048MaRDI QIDQ4038694

P. Sipala, Jean-Marc Steyaert, Philippe Flajolet

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generating functionsasymptotic analysisbranching modelscompaction problemalgebraic enumerationrandom uniform modeltree compaction

Mathematics Subject Classification ID

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

Related Items

XML compression via directed acyclic graphs ⋮ On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations ⋮ Grammar-Based Tree Compression ⋮ Expectation transfer between branching processes and random trees ⋮ Constructing small tree grammars and small circuits for formulas ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Supertrees ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Simplifications of Uniform Expressions Specified by Systems ⋮ Encoding trees by linear recurrence sequences ⋮ On the sub-permutations of pattern avoiding permutations ⋮ Noncontiguous pattern containment in binary trees ⋮ A bijection of plane increasing trees with relaxed binary trees of right height at most one ⋮ Average-case analysis of unification algorithms ⋮ Compacted binary trees admit a stretched exponential ⋮ On finding common subtrees ⋮ Pattern avoidance in binary trees ⋮ Unnamed Item ⋮ Analytic analysis of algorithms ⋮ Learning grammars for architecture-specific facade parsing ⋮ 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 ⋮ Partial derivative automaton by compressing regular expressions ⋮ Distinct fringe subtrees in random trees