On the public citation graph

The average height of r-typly rooted planted plane trees

0 signed · 28 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/3-540-09510-1_28openalex-snapshot
On the average stack size of regularly distributed binary trees
inferredcites →https://doi.org/10.1007/3-540-09510-1_30openalex-snapshot
On the height of derivation trees
inferredcites →https://doi.org/10.1007/978-1-4757-5579-4openalex-snapshot
Introduction to Analytic Number Theory
inferredcites →https://doi.org/10.1007/978-3-662-28579-4openalex-snapshot
Introduction to Analytic Number Theory
inferredcites →https://doi.org/10.1007/bf00289094openalex-snapshot
The average number of registers needed to evaluate a binary tree optimally
inferredcites →https://doi.org/10.1016/0012-365x(81)90235-1openalex-snapshot
On the average depth of a prefix of the Dycklanguage D1
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50007-6openalex-snapshot
THE AVERAGE HEIGHT OF PLANTED PLANE TREES
inferredcites →https://doi.org/10.1016/s0012-365x(81)80013-1openalex-snapshot
On the average depth of a prefix of the Dycklanguage Dl
inferredcites →https://doi.org/10.1080/00401706.1969.10490702openalex-snapshot
Combinatorial Identities
inferredcites →https://doi.org/10.1109/sfcs.1977.19openalex-snapshot
On the average number of registers required for evaluating arithmetic expressions
inferredcites →https://doi.org/10.1119/1.1972842openalex-snapshot
Handbook of Mathematical Functions
inferredcites →https://doi.org/10.1137/0206055openalex-snapshot
Generating Binary Trees Lexicographically
inferredcites →https://doi.org/10.1201/9781351069397-39openalex-snapshot
Handbook of Mathematical Functions
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf02279818openalex-snapshot
A note on a result of R. Kemp on R-typly rooted planted plane trees
inferred← citeshttps://doi.org/10.1007/bf02579315openalex-snapshot
On the average oscillation of a stack
inferred← citeshttps://doi.org/10.1007/bf02579316openalex-snapshot
On the average hyperoscillations of planted plane trees
inferred← citeshttps://doi.org/10.1007/bfb0036477openalex-snapshot
The expected number of nodes and leaves at level k in ordered trees
inferred← citeshttps://doi.org/10.1007/bfb0101644openalex-snapshot
Asymptotische Untersuchungen Zur Durchschnittlichen Gestalt Gewisser Graphenklassen
inferred← citeshttps://doi.org/10.1007/s00010-015-0380-0openalex-snapshot
The height of multiple edge plane trees
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90064-oopenalex-snapshot
On the number of deepest nodes in ordered trees
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90019-9openalex-snapshot
The average height of planted plane trees with M leaves
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.04.012openalex-snapshot
The scientific works of Rainer Kemp (1949–2004)
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80038-4openalex-snapshot
The Average Height of the Second Highest Leaf of a Planted Plane Tree
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00416-3openalex-snapshot
The stack-size of tries: a combinatorial study
inferred← citeshttps://doi.org/10.1051/ita/1983170302491openalex-snapshot
The reduction of binary trees by means of an input-restricted deque
inferred← citeshttps://doi.org/10.46298/dmtcs.301openalex-snapshot
The Stack-Size of Combinatorial Tries Revisited
inferred← citeshttps://doi.org/10.46298/dmtcs.426openalex-snapshot
The location of the first maximum in the first sojourn of a Dyck path
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.