Distinct fringe subtrees in random trees
From MaRDI portal
Publication:2105315
DOI10.1007/s00453-022-01013-yOpenAlexW3163691089MaRDI QIDQ2105315
Publication date: 8 December 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.04231
Cites Work
- Highly expressive query languages for unordered data trees
- XML compression via directed acyclic graphs
- On the richness of the collection of subtrees in random binary search trees
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- Limiting distributions for additive functionals on Catalan trees
- Protected nodes and fringe subtrees in some random trees
- Asymptotic fringe distributions for general families of random trees
- Schemas for unordered XML on a DIME
- Linear unification
- On the collection of fringe subtrees in random binary trees
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- Generating linear extensions of posets by transpositions
- The number of trees
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Limit Theorems for Subtree Size Profiles of Increasing Trees
- A Universal Grammar-Based Code for Lossless Compression of Binary Trees
- Compression of Unordered XML Trees
- Isomorphism and Symmetries in Random Phylogenetic Trees
- Random cutting and records in deterministic and random trees
- Random Trees
- On the Variety of Shapes on the Fringe of a Random Recursive Tree
- On the Altitude of Nodes in Random Trees
- Probability: A Graduate Course
- On the Subtree Size Profile of Binary Search trees
- Repeated fringe subtrees in random rooted trees
- Universal Tree Source Coding Using Grammar-Based Compression
- A central limit theorem for additive functionals of increasing trees
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
- Level of nodes in increasing trees revisited
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distinct fringe subtrees in random trees
