On the public citation graph

Descendants in heap ordered trees or a triumph of computer algebra

https://doi.org/10.37236/1253
0 signed · 19 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-8176-4729-2openalex-snapshot
Mathematics for the Analysis of Algorithms
inferredcites →https://doi.org/10.1016/0166-218x(83)90043-4openalex-snapshot
On monotone functions of tree structures
inferredcites →https://doi.org/10.1016/0167-7152(95)00139-5openalex-snapshot
Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1142/s0129054194000062openalex-snapshot
ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
inferredcites →https://doi.org/10.1142/s0129054196000208openalex-snapshot
DEPTH AND PATH LENGTH OF HEAP ORDERED TREES
inferredcites →https://doi.org/10.37236/1358openalex-snapshot
On the Number of Descendants and Ascendants in Random Search 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.20139openalex-snapshot
Profiles of random trees: Plane‐oriented recursive trees
inferred← citeshttps://doi.org/10.1002/rsa.20474openalex-snapshot
Ancestors and descendants in evolving k‐tree models
inferred← citeshttps://doi.org/10.1006/eujc.1997.0160openalex-snapshot
Addendum Twelve Countings with Rooted Plane Trees
inferred← citeshttps://doi.org/10.1007/978-3-7091-1616-6_7openalex-snapshot
Creative Telescoping for Holonomic Functions
inferred← citeshttps://doi.org/10.1007/s11786-021-00514-3openalex-snapshot
Creative Telescoping on Multiple Sums
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113443openalex-snapshot
Tree evolution processes for bucket increasing trees
inferred← citeshttps://doi.org/10.1017/s0963548311000381openalex-snapshot
Analysis of Statistics for Generalized Stirling Permutations
inferred← citeshttps://doi.org/10.1017/s0963548321000493openalex-snapshot
On bucket increasing trees, clustered increasing trees and increasing diamonds
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/1034openalex-snapshot
Descendants in Increasing Trees
inferred← citeshttps://doi.org/10.48550/arxiv.0906.1672openalex-snapshot
On Path diagrams and Stirling permutations
inferred← citeshttps://doi.org/10.5802/ccirm.14openalex-snapshot
Creative Telescoping for Parametrised Integration and Summation
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.