On the public citation graph
An analytic approach to the height of binary search trees
0 signed · 37 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/bf00265991openalex-snapshot
Branching processes in the analysis of the heights of trees
inferredcites →https://doi.org/10.1016/0022-247x(84)90141-0openalex-snapshot
On growing random binary trees
inferredcites →https://doi.org/10.1016/0304-3975(94)00294-sopenalex-snapshot
Marking in combinatorial constructions: Generating functions and limiting distributions
inferredcites →https://doi.org/10.1016/0304-3975(94)00298-wopenalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
inferredcites →https://doi.org/10.1112/jlms/s1-33.2.133openalex-snapshot
Asymptotic Development of the Stirling Numbers of the First Kind
inferredcites →https://doi.org/10.1112/jlms/s2-33.1.133openalex-snapshot
An Integral of Products of Ultraspherical Functions and a q -Extension
inferredcites →https://doi.org/10.1137/s0097539792237541openalex-snapshot
On the Variance of the Height of Random Binary Search Trees
inferredcites →https://doi.org/10.1145/5925.5930openalex-snapshot
A note on the height of binary 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.20701openalex-snapshot
Oscillations in the height of the Yule tree and application to the binary search tree
inferred← citeshttps://doi.org/10.1007/11602613_49openalex-snapshot
Smoothed Analysis of Binary Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-0348-8405-1_4openalex-snapshot
The Saturation Level in Binary Search Tree
inferred← citeshttps://doi.org/10.1007/s00026-009-0009-xopenalex-snapshot
The Height of Increasing Trees
inferred← citeshttps://doi.org/10.1007/s11425-007-0129-xopenalex-snapshot
Limiting theorems for the nodes in binary search trees
inferred← citeshttps://doi.org/10.1007/s236-002-8034-5openalex-snapshot
The variance of the height of digital search trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.003openalex-snapshot
On Robson's convergence and boundedness conjectures concerning the height of binary search trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.035openalex-snapshot
Smoothed analysis of binary search trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00006-8openalex-snapshot
The Variance of the height of binary search trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00387-5openalex-snapshot
The height of a binary search tree: the limiting distribution perspective
inferred← citeshttps://doi.org/10.1017/s026996480707009xopenalex-snapshot
EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
inferred← citeshttps://doi.org/10.1088/1742-5468/2007/07/p07010openalex-snapshot
Tightness for the minimal displacement of branching random walk
inferred← citeshttps://doi.org/10.1098/rspa.2003.1243openalex-snapshot
Stochastic analysis of tree–like data structures
inferred← citeshttps://doi.org/10.1145/765568.765572openalex-snapshot
An analytic approach to the height of binary search trees II
inferred← citeshttps://doi.org/10.1214/08-aop414openalex-snapshot
Tightness for a family of recursion equations
inferred← citeshttps://doi.org/10.1214/19-aop1347openalex-snapshot
Quenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson model
inferred← citeshttps://doi.org/10.1214/21-aap1756openalex-snapshot
Correction terms for the height of weighted recursive trees
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.388openalex-snapshot
Average Analysis of Glushkov Automata under a BST-Like Model
inferred← citeshttps://doi.org/10.46298/dmtcs.319openalex-snapshot
Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1411.4270openalex-snapshot
Oscillations in the height of the Yule tree and application to the binary search tree
inferred← citeshttps://doi.org/10.48550/arxiv.math/0304411openalex-snapshot
Additive functionals on random search trees
inferred← citeshttps://doi.org/10.48550/arxiv.math/0410318openalex-snapshot
Connecting Yule Process, Bisection and Binary Search Tree via Martingales
inferred← citeshttps://doi.org/10.5555/1127442.1127472openalex-snapshot
An instructional scaffolding approach to teaching software design
inferred← citeshttps://doi.org/10.5555/1283383.1283399openalex-snapshot
Analytic combinatorics: a calculus of discrete structures
inferred← citeshttps://doi.org/10.70675/46fac461zfbb1z41eczaca9z283a8dab1461openalex-snapshot
Branching processes and Erdős-Rényi graph
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.