On the public citation graph
Descendants in Increasing Trees
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-55251-0_2openalex-snapshot
Varieties of increasing trees
inferredcites →https://doi.org/10.1007/s00026-008-0338-1openalex-snapshot
Isolating a Leaf in Rooted Trees via Random Cuttings
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferredcites →https://doi.org/10.1016/j.laa.2005.04.034openalex-snapshot
A combinatorial problem associated with nonograms
inferredcites →https://doi.org/10.1017/s0021900200037177openalex-snapshot
On the number of terminal vertices in certain random trees with an application to stemma construction in philology
inferredcites →https://doi.org/10.1201/9781420010572.pt2openalex-snapshot
Combinatorial Matrix Theory
inferredcites →https://doi.org/10.1214/aoap/1177005874openalex-snapshot
On the Distribution of Leaves in Rooted Subtrees of Recursive Trees
inferredcites →https://doi.org/10.1287/opre.32.3.527openalex-snapshot
Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
inferredcites →https://doi.org/10.37236/1253openalex-snapshot
Descendants in heap ordered trees or a triumph of computer algebra
inferredcites →https://doi.org/10.4153/cjm-1978-085-0openalex-snapshot
On the Altitude of Nodes in Random Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20474openalex-snapshot
Ancestors and descendants in evolving k‐tree models
inferred← citeshttps://doi.org/10.1016/j.disc.2014.06.028openalex-snapshot
On the sub-permutations of pattern avoiding permutations
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113443openalex-snapshot
Tree evolution processes for bucket increasing trees
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.08.003openalex-snapshot
On the degree distribution of the nodes in increasing trees
inferred← citeshttps://doi.org/10.1017/s0963548308009486openalex-snapshot
The Hitting Time for the Height of a Random Recursive Tree
inferred← citeshttps://doi.org/10.1017/s0963548311000381openalex-snapshot
Analysis of Statistics for Generalized Stirling Permutations
inferred← citeshttps://doi.org/10.1214/14-ps244openalex-snapshot
On moment sequences and mixed Poisson distributions
inferred← citeshttps://doi.org/10.1214/24-aap2076openalex-snapshot
Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
inferred← citeshttps://doi.org/10.2989/qm.2009.32.1.8.710openalex-snapshot
A Combinatorial Approach for Analyzing the Number of Descendants in Increasing Trees and Related Parameters
inferred← citeshttps://doi.org/10.37236/10305openalex-snapshot
On Multisets, Interpolated Multiple Zeta Values and Limit Laws
inferred← citeshttps://doi.org/10.46298/dmtcs.3482openalex-snapshot
Label-based parameters in increasing trees
inferred← citeshttps://doi.org/10.48550/arxiv.1210.6908openalex-snapshot
On the sub-permutations of pattern avoiding permutations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.