On the public citation graph
Branching processes in the analysis of the heights of trees
0 signed · 161 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/9780470316436openalex-snapshot
Linear Statistical Inference and its Applications
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/bf00263763openalex-snapshot
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bfb0012773openalex-snapshot
A branching process arising in dynamic hashing, trie searching and polynomial factorization
inferredcites →https://doi.org/10.1016/0020-0190(75)90034-4openalex-snapshot
Analysis of range searches in quad trees
inferredcites →https://doi.org/10.1016/0020-0190(81)90033-8openalex-snapshot
On the average height of trees in digital search and dynamic hashing
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/0304-3975(78)90009-9openalex-snapshot
The expected linearity of a simple equivalence algorithm
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.1017/s0001867800015603openalex-snapshot
Paths in a random digital tree: limiting distributions
inferredcites →https://doi.org/10.1017/s0001867800042348openalex-snapshot
The first- and last-birth problems for a multitype age-dependent branching process
inferredcites →https://doi.org/10.1017/s0021900200025900openalex-snapshot
Chernoff's theorem in the branching random walk
inferredcites →https://doi.org/10.1080/00401706.1965.10490235openalex-snapshot
The Theory of Branching Processes
inferredcites →https://doi.org/10.1109/tse.1982.236022openalex-snapshot
Analysis of Extendible Hashing
inferredcites →https://doi.org/10.1137/1114007openalex-snapshot
On the Distribution of the Number of Vertices in Strata of a Random Tree
inferredcites →https://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/5925.5930openalex-snapshot
A note on the height of binary search trees
inferredcites →https://doi.org/10.1214/aoms/1177698049openalex-snapshot
Bounds for the Probability of a Union, with Applications
inferredcites →https://doi.org/10.1214/aop/1176993000openalex-snapshot
Asymptotical Growth of a Class of Random Trees
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.2307/2529568openalex-snapshot
Linear Statistical Inference and Its Applications.
inferredcites →https://doi.org/10.2307/2987205openalex-snapshot
Linear Statistical Inference and its Applications.
inferredcites →https://doi.org/10.6028/jres.065b.020openalex-snapshot
Probability inequalities of the Tchebycheff type
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199908)15:1<25::aid-rsa2>3.0.co;2-ropenalex-snapshot
On the internal path length ofd-dimensional quad trees
inferred← citeshttps://doi.org/10.1002/rsa.1023openalex-snapshot
Martingales and large deviations for binary search trees
inferred← citeshttps://doi.org/10.1002/rsa.20241openalex-snapshot
Critical random graphs and the structure of a minimum spanning tree
inferred← citeshttps://doi.org/10.1002/rsa.20340openalex-snapshot
A phase transition for the heights of a fragmentation tree
inferred← citeshttps://doi.org/10.1002/rsa.20391openalex-snapshot
Depth Properties of scaled attachment random recursive trees
inferred← citeshttps://doi.org/10.1002/rsa.20576openalex-snapshot
The height of random k‐trees and related branching processes
inferred← citeshttps://doi.org/10.1002/rsa.20649openalex-snapshot
Finding Adam in random growing trees
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.1002/rsa.20753openalex-snapshot
High degrees in random recursive trees
inferred← citeshttps://doi.org/10.1002/rsa.20901openalex-snapshot
The height of depth‐weighted random recursive trees
inferred← citeshttps://doi.org/10.1002/rsa.21027openalex-snapshot
Community modulated recursive trees and population dependent branching processes
inferred← citeshttps://doi.org/10.1002/rsa.3240010206openalex-snapshot
On the height of randomm‐ary search trees
inferred← citeshttps://doi.org/10.1002/rsa.3240020305openalex-snapshot
Limit laws for local counters in random binary search trees
inferred← citeshttps://doi.org/10.1002/rsa.3240050207openalex-snapshot
Note on the heights of random recursive trees and random m‐ary search trees
inferred← citeshttps://doi.org/10.1002/rsa.3240070102openalex-snapshot
The strong convergence of maximal degrees in uniform random recursive trees and dags
inferred← citeshttps://doi.org/10.1002/rsa.3240070203openalex-snapshot
Hypergeometrics and the cost structure of quadtrees
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_63openalex-snapshot
Unifying binary-search trees and permutations
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_74openalex-snapshot
Analytic analysis of algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4612-1690-2_3openalex-snapshot
Binary search trees based on Weyl and Lehmer sequences
inferred← citeshttps://doi.org/10.1007/978-1-4612-1862-3_2openalex-snapshot
How Fast Does a General Branching Random Walk Spread?
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_31openalex-snapshot
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_10openalex-snapshot
Giant Components for Two Expanding Graph Processes
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_16openalex-snapshot
A Note on Random Suffix Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_23openalex-snapshot
Growth Rate and Ergodicity Conditions for a Class of Random Trees
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-319-93725-0_6openalex-snapshot
Arbres binaires de recherche
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_8openalex-snapshot
Arbres m-aires et quadrants
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/978-3-662-12788-9_7openalex-snapshot
Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms
inferred← citeshttps://doi.org/10.1007/bf01210596openalex-snapshot
On the expected height of fringe-balanced trees
inferred← citeshttps://doi.org/10.1007/bf02679611openalex-snapshot
The contraction method for recursive algorithms
inferred← citeshttps://doi.org/10.1007/bf02679615openalex-snapshot
An analytic approach to the height of binary search trees
inferred← citeshttps://doi.org/10.1007/bf02915448openalex-snapshot
Applications of the theory of records in the study of random trees
inferred← citeshttps://doi.org/10.1007/s00026-009-0009-xopenalex-snapshot
The Height of Increasing Trees
inferred← citeshttps://doi.org/10.1007/s00236-008-0069-0openalex-snapshot
Weighted height of random trees
inferred← citeshttps://doi.org/10.1007/s00440-003-0311-1openalex-snapshot
Birth and death processes on certain random trees: classification and stationary laws
inferred← citeshttps://doi.org/10.1007/s00440-024-01268-2openalex-snapshot
New results for the random nearest neighbor tree
inferred← citeshttps://doi.org/10.1007/s00453-006-0109-5openalex-snapshot
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
inferred← citeshttps://doi.org/10.1007/s00453-006-0112-xopenalex-snapshot
Large Deviations for the Weighted Height of an Extended Class of Trees
inferred← citeshttps://doi.org/10.1007/s10474-019-00976-9openalex-snapshot
Moments of general time dependent branching processes with applications
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/s11512-009-0118-0openalex-snapshot
Long and short paths in uniform random recursive dags
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00139-nopenalex-snapshot
Analytic methods in asymptotic enumeration
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00308-6openalex-snapshot
Probabilistic analysis of bucket recursive trees
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferred← citeshttps://doi.org/10.1016/j.aam.2013.12.004openalex-snapshot
The shape of random pattern-avoiding permutations
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.075openalex-snapshot
High degrees in recursive trees
inferred← citeshttps://doi.org/10.1016/j.spa.2018.08.014openalex-snapshot
A limit field for orthogonal range searches in two-dimensional random point 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/s0167-7152(96)00092-2openalex-snapshot
A note on the growth of random 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.1016/s0377-0427(01)00460-5openalex-snapshot
Limit distribution for the maximum degree of a random recursive tree
inferred← citeshttps://doi.org/10.1016/s0764-4442(99)80276-6openalex-snapshot
Martingales et grandes déviations pour les arbres binaires de recherche
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/jpr.2018.75openalex-snapshot
Weak convergence of the number of vertices at intermediate levels of random recursive trees
inferred← citeshttps://doi.org/10.1017/s026996480000084xopenalex-snapshot
Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
inferred← citeshttps://doi.org/10.1017/s026996480707009xopenalex-snapshot
EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
inferred← citeshttps://doi.org/10.1017/s0963548309990204openalex-snapshot
The Longest Minimum-Weight Path in a Complete Graph
inferred← citeshttps://doi.org/10.1017/s0963548317000232openalex-snapshot
Diameter of the Stochastic Mean-Field Model of Distance
inferred← citeshttps://doi.org/10.1017/s0963548320000073openalex-snapshot
A non-increasing tree growth process for recursive trees and applications
inferred← citeshttps://doi.org/10.1017/s0963548323000184openalex-snapshot
Archaeology of random recursive dags and Cooper-Frieze random networks
inferred← citeshttps://doi.org/10.1034/j.1600-0889.1996.00013.xopenalex-snapshot
Isotopic characterisation of CO2 sources during regional pollution events using isotopic and radiocarbon analysis
inferred← citeshttps://doi.org/10.1093/bioinformatics/btaf235openalex-snapshot
Fast tumor phylogeny regression via tree-structured dual dynamic programming
inferred← citeshttps://doi.org/10.1098/rspa.2003.1243openalex-snapshot
Stochastic analysis of tree–like data structures
inferred← citeshttps://doi.org/10.1103/physreve.65.036127openalex-snapshot
Extreme value statistics and traveling fronts: Application to computer science
inferred← citeshttps://doi.org/10.1109/focs.2010.69openalex-snapshot
All-Pairs Shortest Paths in O(n²) Time with High Probability
inferred← citeshttps://doi.org/10.1137/0219057openalex-snapshot
An Analysis of Random d -Dimensional Quad Trees
inferred← citeshttps://doi.org/10.1137/s0097539701383923openalex-snapshot
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
inferred← citeshttps://doi.org/10.1137/s0097539792224954openalex-snapshot
On the Generation of Random Binary Search Trees
inferred← citeshttps://doi.org/10.1137/s0097539792237541openalex-snapshot
On the Variance of the Height of Random Binary Search Trees
inferred← citeshttps://doi.org/10.1137/s0097539795283954openalex-snapshot
Universal Limit Laws for Depths in Random Trees
inferred← citeshttps://doi.org/10.1137/s0895480104440134openalex-snapshot
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
inferred← citeshttps://doi.org/10.1142/9789812567673_0016openalex-snapshot
Applications of Stein's method in the analysis of random binary search trees
inferred← citeshttps://doi.org/10.1142/s0218196715500058openalex-snapshot
Search problems in groups and branching processes
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1240233.1240235openalex-snapshot
Phase changes in random point quadtrees
inferred← citeshttps://doi.org/10.1145/2435349.2435356openalex-snapshot
Expression rewriting for optimizing secure computation
inferred← citeshttps://doi.org/10.1145/2508028.2505988openalex-snapshot
All-pairs shortest paths in O ( n 2 ) time with high probability
inferred← citeshttps://doi.org/10.1145/765568.765571openalex-snapshot
The height of a random binary search tree
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.1184/r1/6479915.v1openalex-snapshot
The height of random $k$-trees and related branching processes
inferred← citeshttps://doi.org/10.1186/1029-242x-2013-416openalex-snapshot
Retraction Note: Strong limiting behavior in binary search trees
inferred← citeshttps://doi.org/10.1186/1029-242x-2013-60openalex-snapshot
RETRACTED ARTICLE: Strong limiting behavior in binary search trees
inferred← citeshttps://doi.org/10.1214/09-aap640openalex-snapshot
A functional limit theorem for the profile of b-ary trees
inferred← citeshttps://doi.org/10.1214/12-aap840openalex-snapshot
Poisson–Dirichlet branching random walks
inferred← citeshttps://doi.org/10.1214/12-aap912openalex-snapshot
A limit process for partial match queries in random quadtrees and $2$-d trees
inferred← citeshttps://doi.org/10.1214/16-ps272openalex-snapshot
Fringe trees, Crump–Mode–Jagers branching processes and $m$-ary search trees
inferred← citeshttps://doi.org/10.1214/17-aap1285openalex-snapshot
General Edgeworth expansions with applications to profiles of random trees
inferred← citeshttps://doi.org/10.1214/17-ejp31openalex-snapshot
Asymptotics of heights in random trees constructed by aggregation
inferred← citeshttps://doi.org/10.1214/18-ecp188openalex-snapshot
A functional limit theorem for the profile of random recursive trees
inferred← citeshttps://doi.org/10.1214/21-aap1756openalex-snapshot
Correction terms for the height of weighted recursive trees
inferred← citeshttps://doi.org/10.1214/21-ejp640openalex-snapshot
Geometry of weighted recursive and affine preferential attachment trees
inferred← citeshttps://doi.org/10.1214/24-aap2097openalex-snapshot
Increasing paths in random temporal graphs
inferred← citeshttps://doi.org/10.1214/24-aihp1497openalex-snapshot
Uniform attachment with freezing: Scaling limits
inferred← citeshttps://doi.org/10.1214/24-aop1697openalex-snapshot
Asymptotic fluctuations in supercritical Crump–Mode–Jagers processes
inferred← citeshttps://doi.org/10.1214/aoap/1015345394openalex-snapshot
The Profile of Binary Search Trees
inferred← citeshttps://doi.org/10.1214/aoap/1177004977openalex-snapshot
A Strong Law for the Height of Random Binary Pyramids
inferred← citeshttps://doi.org/10.1214/ejp.v16-952openalex-snapshot
A Note on the Probability of Cutting a Galton-Watson Tree
inferred← citeshttps://doi.org/10.1515/revic.1986.8.1-2.101openalex-snapshot
Special Properties of Cobalt(II), Nickel(II) and Copper(II) Complexes of Methyl and Ethyl Quinaldates
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a6openalex-snapshot
Random hyperplane search trees in high dimensions
inferred← citeshttps://doi.org/10.3150/24-bej1771openalex-snapshot
Siblings in d-dimensional nearest neighbour trees
inferred← citeshttps://doi.org/10.46298/dmtcs.2788openalex-snapshot
The height of scaled attachment random recursive trees
inferred← citeshttps://doi.org/10.46298/dmtcs.3513openalex-snapshot
The Diameter of the Minimum Spanning Tree of a Complete Graph
inferred← citeshttps://doi.org/10.46298/dmtcs.3588openalex-snapshot
The size of random fragmentation intervals
inferred← citeshttps://doi.org/10.48550/arxiv.1105.3770openalex-snapshot
All-Pairs Shortest Paths in $O(n^2)$ time with high probability
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.5555/1283383.1283399openalex-snapshot
Analytic combinatorics: a calculus of discrete structures
inferred← citeshttps://doi.org/10.70675/2589ad9bz73e3z45eaz92a0z2bbbaa37ebdaopenalex-snapshot
Probabilistic analysis of distributed processes with focus on consensus
inferred← citeshttps://doi.org/10.70675/37ebf486z2ecaz41c1za2bbzb4471821b0abopenalex-snapshot
Random tree-like structures : gluings of metric spaces and stable graphs
inferred← citeshttps://doi.org/10.70675/44570107zc494z4713z885fz6dce335e84e7openalex-snapshot
Inference of the past of random structures and other random problems
inferred← citeshttps://doi.org/10.70675/46fac461zfbb1z41eczaca9z283a8dab1461openalex-snapshot
Branching processes and Erdős-Rényi graph
inferred← citeshttps://doi.org/10.82308/1812openalex-snapshot
Guarding problems and geometric split trees
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.