On the public citation graph
On the average oscillation of a stack
0 signed · 34 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-09510-1_28openalex-snapshot
On the average stack size of regularly distributed binary trees
inferredcites →https://doi.org/10.1007/978-94-010-2196-8openalex-snapshot
Advanced Combinatorics: The Art of Finite and Infinite Expansions
inferredcites →https://doi.org/10.1007/bf01933188openalex-snapshot
A note on the stack size of regularly distributed binary trees
inferredcites →https://doi.org/10.1007/bf02242000openalex-snapshot
The average height of r-typly rooted planted plane trees
inferredcites →https://doi.org/10.1016/0012-365x(80)90168-5openalex-snapshot
Enumerations of ordered trees
inferredcites →https://doi.org/10.1016/0022-0000(82)90004-6openalex-snapshot
The average height of binary trees and other simple trees
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.1080/00401706.1969.10490702openalex-snapshot
Combinatorial Identities
inferredcites →https://doi.org/10.1090/s0002-9947-1952-0052057-2openalex-snapshot
First Passage and Recurrence Distributions
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190070304openalex-snapshot
On the average shape of simply generated families of trees
inferred← citeshttps://doi.org/10.1002/net.3230160107openalex-snapshot
The average height of the d‐th highest leaf of a planted plane tree
inferred← citeshttps://doi.org/10.1002/rsa.3240030403openalex-snapshot
The Variance of Level Numbers in Certain Families of Trees
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_10openalex-snapshot
On a general weight of trees
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_16openalex-snapshot
On the Stack Size of a Class of Backtrack Trees
inferred← citeshttps://doi.org/10.1007/bf00289158openalex-snapshot
The expected additive weight of trees
inferred← citeshttps://doi.org/10.1007/bf02349961openalex-snapshot
The asymptotic distribution of leaf heights in binary trees
inferred← citeshttps://doi.org/10.1007/bf02579316openalex-snapshot
On the average hyperoscillations of planted plane trees
inferred← citeshttps://doi.org/10.1007/bfb0101644openalex-snapshot
Asymptotische Untersuchungen Zur Durchschnittlichen Gestalt Gewisser Graphenklassen
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90120-2openalex-snapshot
Ordered trees and non-crossing partitions
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/0166-218x(84)90064-7openalex-snapshot
On the average shape of monotonically labelled tree structures
inferred← citeshttps://doi.org/10.1016/0304-4149(92)90147-iopenalex-snapshot
The asymptotic contour process of a binary tree is a Brownian excursion
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/s0304-0208(08)73054-8openalex-snapshot
A Tree Enumeration Problem Involving the Asymptotics of the “Diagonals” of a Power Series
inferred← citeshttps://doi.org/10.1017/s0021900200017186openalex-snapshot
The Brownian excursion multi-dimensional local time density
inferred← citeshttps://doi.org/10.1051/ita/1992260100011openalex-snapshot
The limiting common distribution of two leaf heights in a random binary tree
inferred← citeshttps://doi.org/10.1239/jap/1032374458openalex-snapshot
The Brownian excursion multi-dimensional local time density
inferred← citeshttps://doi.org/10.46298/dmtcs.246openalex-snapshot
Descendants and ascendants in binary trees
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14797openalex-snapshot
A walk in my lattice path garden
inferred← citeshttps://doi.org/10.7546/nntdm.2024.30.2.213-222openalex-snapshot
MIN-turns and MAX-turns in k-Dyck paths: A pure generating function approach
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.