The following pages link to (Q4038694):
Displayed 24 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- Average-case analysis of unification algorithms (Q685442) (← links)
- Pattern avoidance in binary trees (Q986111) (← links)
- On finding common subtrees (Q1208722) (← links)
- Encoding trees by linear recurrence sequences (Q1699391) (← links)
- A bijection of plane increasing trees with relaxed binary trees of right height at most one (Q1725684) (← links)
- Learning grammars for architecture-specific facade parsing (Q1800054) (← links)
- Compacted binary trees admit a stretched exponential (Q2005184) (← links)
- Partial derivative automaton by compressing regular expressions (Q2096587) (← links)
- Distinct fringe subtrees in random trees (Q2105315) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Supertrees (Q2181994) (← links)
- Asymptotic enumeration of compacted binary trees of bounded right height (Q2299626) (← links)
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models (Q2303740) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Noncontiguous pattern containment in binary trees (Q2449274) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- Expectation transfer between branching processes and random trees (Q4285002) (← links)
- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations (Q5041257) (← links)
- (Q5092413) (← links)
- Analytic analysis of algorithms (Q5204317) (← links)
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments (Q6074703) (← links)
- Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)