On the public citation graph
On the Number of Descendants and Ascendants in Random Search Trees
0 signed · 33 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.1002/(sici)1098-2418(199701/03)10:1/2<143::aid-rsa7>3.0.co;2-vopenalex-snapshot
Analysis of Hoare's FIND algorithm with Median-of-three partition
inferredcites →https://doi.org/10.1007/3-540-61680-2_49openalex-snapshot
Randomization of search trees by subtree size
inferredcites →https://doi.org/10.1007/978-3-663-05925-7openalex-snapshot
Differentialgleichungen Lösungsmethoden und Lösungen
inferredcites →https://doi.org/10.1007/bf01179372openalex-snapshot
The analysis of heuristics for search trees
inferredcites →https://doi.org/10.1016/0012-365x(93)90364-yopenalex-snapshot
General combinatorial schemas: Gaussian limit distributions and exponential tails
inferredcites →https://doi.org/10.1016/0196-6774(85)90003-3openalex-snapshot
The analysis of a fringe heuristic for binary search trees
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.1017/s0963548397003325openalex-snapshot
Comparisons in Hoare's Find Algorithm
inferredcites →https://doi.org/10.1051/ita/1987210404791openalex-snapshot
Exact and asymptotic distributions in digital and binary search trees
inferredcites →https://doi.org/10.1093/comjnl/19.4.322openalex-snapshot
Locally balanced binary trees
inferredcites →https://doi.org/10.1093/comjnl/7.4.299openalex-snapshot
More Combinatorial Properties of Certain Trees
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.1145/362848.362856openalex-snapshot
Randomized binary search technique
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-0348-8405-1_6openalex-snapshot
The Number of Descendants in Simply Generated Random Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0openalex-snapshot
Arbres pour l’Algorithmique
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_3openalex-snapshot
Arbres, algorithmes et données
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_37openalex-snapshot
Randomized Insertion and Deletion in Point Quad Trees
inferred← citeshttps://doi.org/10.1007/bf01608487openalex-snapshot
An analytic approach for the analysis of rotations in fringe-balanced binary search trees
inferred← citeshttps://doi.org/10.1007/bf02523399openalex-snapshot
One-sided variations on binary search trees
inferred← citeshttps://doi.org/10.1007/bf02679613openalex-snapshot
Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.030openalex-snapshot
The analysis of Range Quickselect and related problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00651-5openalex-snapshot
Emerging behavior as binary search trees are symmetrically updated
inferred← citeshttps://doi.org/10.1051/ita/2017002openalex-snapshot
Analysis of digital search trees incorporated with paging
inferred← citeshttps://doi.org/10.1214/105051606000000547openalex-snapshot
The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
inferred← citeshttps://doi.org/10.37236/1253openalex-snapshot
Descendants in heap ordered trees or a triumph of computer algebra
inferred← citeshttps://doi.org/10.46298/dmtcs.246openalex-snapshot
Descendants and ascendants in binary trees
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93958openalex-snapshot
Design and Analysis of Multidimensional Data Structures
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.