Protected points in k-ary trees
From MaRDI portal
Publication:617014
DOI10.1016/J.AML.2010.10.045zbMATH Open1214.05009OpenAlexW2018660594MaRDI QIDQ617014FDOQ617014
Publication date: 20 January 2011
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2010.10.045
Cites Work
Cited In (16)
- \(k\)-protected vertices in binary search trees
- Notes on protected nodes in digital search trees
- Protected cells in compositions
- Asymptotic distribution of two-protected nodes in random binary search trees
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- On 2-protected nodes in random digital trees
- \(k\)-protected vertices in unlabeled rooted plane trees
- On the peel number and the leaf-height of Galton–Watson trees
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- The distribution of the maximum protection number in simply generated trees
- Protected Branches in Ordered Trees
- Protection numbers in simply generated trees and Pólya trees
- Protection number in plane trees
- Title not available (Why is that?)
- Protected Vertices in Motzkin trees
- DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION
Recommendations
This page was built for publication: Protected points in \(k\)-ary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617014)