On the public citation graph
Applications of the theory of records in the study of random trees
0 signed · 125 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/978-1-4612-4800-2openalex-snapshot
Probabilistic Analysis of Algorithms
inferredcites →https://doi.org/10.1007/bf00265991openalex-snapshot
Branching processes in the analysis of the heights of trees
inferredcites →https://doi.org/10.1016/0020-0190(76)90061-2openalex-snapshot
Linear expected time of a simple union-find algorithm
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(78)90009-9openalex-snapshot
The expected linearity of a simple equivalence algorithm
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1080/00029890.1978.11994501openalex-snapshot
Breaking Records and Breaking Boards
inferredcites →https://doi.org/10.1093/comjnl/7.4.299openalex-snapshot
More Combinatorial Properties of Certain Trees
inferredcites →https://doi.org/10.1137/0605010openalex-snapshot
On the Most Probable Shape of a Search Tree Grown from a Random Permutation
inferredcites →https://doi.org/10.1145/5925.5930openalex-snapshot
A note on the height of binary search trees
inferredcites →https://doi.org/10.1145/800113.803648openalex-snapshot
On the average behavior of set merging algorithms (Extended Abstract)
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
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(199608/09)9:1/2<79::aid-rsa5>3.0.co;2-8openalex-snapshot
Poisson approximations for functionals of random trees
inferred← citeshttps://doi.org/10.1002/rsa.20161openalex-snapshot
Level of nodes in increasing trees revisited
inferred← citeshttps://doi.org/10.1002/rsa.20183openalex-snapshot
The structure and distances in Yule recursive trees
inferred← citeshttps://doi.org/10.1002/rsa.20674openalex-snapshot
On martingale tail sums for the path length in random trees
inferred← citeshttps://doi.org/10.1002/rsa.20711openalex-snapshot
The cut‐tree of large trees with small heights
inferred← citeshttps://doi.org/10.1002/rsa.20901openalex-snapshot
The height of depth‐weighted random recursive trees
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.3240070102openalex-snapshot
The strong convergence of maximal degrees in uniform random recursive trees and dags
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_2openalex-snapshot
Varieties of increasing trees
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-3-030-76657-3_2openalex-snapshot
Split Trees – A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_13openalex-snapshot
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
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-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-642-31638-8_1openalex-snapshot
On Message Complexity of Extrema Propagation Techniques
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/bf01189991openalex-snapshot
A provably fast linear-expected-time maxima-finding algorithm
inferred← citeshttps://doi.org/10.1007/bf02523399openalex-snapshot
One-sided variations on binary search trees
inferred← citeshttps://doi.org/10.1007/bf02936077openalex-snapshot
Note on the outdegree of a node in random recursive trees
inferred← citeshttps://doi.org/10.1007/pl00009256openalex-snapshot
A Note on the Expected Time for Finding Maxima by List Algorithms
inferred← citeshttps://doi.org/10.1007/pl00009444openalex-snapshot
Properties of Random Triangulations and Trees
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-0112-xopenalex-snapshot
Large Deviations for the Weighted Height of an Extended Class of Trees
inferred← citeshttps://doi.org/10.1007/s00591-006-0001-zopenalex-snapshot
Zufällige binäre Bäume: Von der average-case Analyse zur Verteilungsasymptotik
inferred← citeshttps://doi.org/10.1007/s10959-017-0773-1openalex-snapshot
On Weighted Depths in Random 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)00141-iopenalex-snapshot
Combinatorics of geometrically distributed random variables: Left-to-right maxima
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00308-6openalex-snapshot
Probabilistic analysis of bucket recursive trees
inferred← citeshttps://doi.org/10.1016/0377-0427(92)90252-sopenalex-snapshot
Distances in random plane-oriented recursive trees
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114865openalex-snapshot
Multinomial random combinatorial structures and r-versions of Stirling, Eulerian and Lah numbers
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.05.004openalex-snapshot
Uniform recursive trees: Branching structure and simple random downward walk
inferred← citeshttps://doi.org/10.1016/j.physa.2025.131115openalex-snapshot
Random walks and consensus problem on tree network with an identical degree distribution
inferred← citeshttps://doi.org/10.1016/j.spa.2025.104790openalex-snapshot
A random recursive tree model with doubling events
inferred← citeshttps://doi.org/10.1016/j.spl.2006.04.020openalex-snapshot
A note on the distance in random recursive trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.033openalex-snapshot
The left–right-imbalance of binary search trees
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.1017/jpr.2024.32openalex-snapshot
Depths in random recursive metric spaces
inferred← citeshttps://doi.org/10.1017/jpr.2024.40openalex-snapshot
Quenched worst-case scenario for root deletion in targeted cutting of random recursive trees
inferred← citeshttps://doi.org/10.1017/s0001867800001440openalex-snapshot
On the asymptotic behaviour of random recursive trees in random environments
inferred← citeshttps://doi.org/10.1017/s0001867800003773openalex-snapshot
On the expected maximum degree of Gabriel and Yao graphs
inferred← citeshttps://doi.org/10.1017/s0001867800004924openalex-snapshot
Asymptotic normality for the number of records from general distributions
inferred← citeshttps://doi.org/10.1017/s002190020010018xopenalex-snapshot
On the distribution of distances in recursive trees
inferred← citeshttps://doi.org/10.1017/s0269964800001881openalex-snapshot
Limiting Distributions for Path Lengths in Recursive Trees
inferred← citeshttps://doi.org/10.1017/s026996480707009xopenalex-snapshot
EXTREMAL WEIGHTED PATH LENGTHS IN RANDOM BINARY SEARCH TREES
inferred← citeshttps://doi.org/10.1017/s0963548308009486openalex-snapshot
The Hitting Time for the Height of a Random Recursive Tree
inferred← citeshttps://doi.org/10.1017/s0963548321000043openalex-snapshot
Permutations with equal orders
inferred← citeshttps://doi.org/10.1080/15326349.2014.927318openalex-snapshot
On the Asymptotic Behavior of a Dynamic Version of the Neyman Contagious Point Process
inferred← citeshttps://doi.org/10.1088/1742-5468/ab081fopenalex-snapshot
Random walks with preferential relocations and fading memory: a study through random recursive trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxh073openalex-snapshot
Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics
inferred← citeshttps://doi.org/10.1109/icmlc.2006.258522openalex-snapshot
General Solution Scheme to Spatial Complexity of Recursive Algorithm
inferred← citeshttps://doi.org/10.1109/tifs.2012.2204981openalex-snapshot
On the Characteristics of the Worm Infection Family Tree
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/s0097539703424521openalex-snapshot
Distances and Finger Search in 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.1145/1167350.1167389openalex-snapshot
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
inferred← citeshttps://doi.org/10.1214/105051604000000611openalex-snapshot
Mixed Poisson approximation of node depth distributions in random binary search trees
inferred← citeshttps://doi.org/10.1214/21-aap1671openalex-snapshot
A new approach to Pólya urn schemes and its infinite color generalization
inferred← citeshttps://doi.org/10.1214/21-aap1686openalex-snapshot
Broadcasting on random recursive trees
inferred← citeshttps://doi.org/10.1214/22-ejp877openalex-snapshot
On joint properties of vertices with a given degree or label in the random recursive tree
inferred← citeshttps://doi.org/10.1214/aoap/1042765668openalex-snapshot
Distribution of distances in random binary search trees
inferred← citeshttps://doi.org/10.1214/ejp.v19-2822openalex-snapshot
On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees
inferred← citeshttps://doi.org/10.1239/aap/1261669589openalex-snapshot
On the expected maximum degree of Gabriel and Yao graphs
inferred← citeshttps://doi.org/10.1360/03ys0299openalex-snapshot
Branching structure of uniform recursive trees
inferred← citeshttps://doi.org/10.1515/abcsb-2017-0012openalex-snapshot
Effect of Fluridone on Some Physiological and Qualitative Features of Ripening Tomato Fruit
inferred← citeshttps://doi.org/10.15215/aupress/9781927356388.01openalex-snapshot
Open Data Structures: An Introduction
inferred← citeshttps://doi.org/10.15215/aupress/9781927356395.01openalex-snapshot
Open Data Structures: An Introduction
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a6openalex-snapshot
Random hyperplane search trees in high dimensions
inferred← citeshttps://doi.org/10.22215/etd/2006-06665openalex-snapshot
Tries in data retrieval and syntactic pattern recognition
inferred← citeshttps://doi.org/10.22215/etd/2023-15445openalex-snapshot
Constrained Geometric Optimization Problems
inferred← citeshttps://doi.org/10.24166/im.02.2019openalex-snapshot
On the discovery of the seed in uniform attachment trees
inferred← citeshttps://doi.org/10.25148/etd.fi10120303openalex-snapshot
Characterizing InternetWorm Spatial-Temporal Infection Structures
inferred← citeshttps://doi.org/10.30757/alea.v19-33openalex-snapshot
Depth of vertices with high degree in random recursive trees
inferred← citeshttps://doi.org/10.3150/16-bej844openalex-snapshot
Pólya urn schemes with infinitely many colors
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.318openalex-snapshot
The distribution of m-ary search trees generated by van der Corput sequences
inferred← citeshttps://doi.org/10.46298/dmtcs.3357openalex-snapshot
A hooray for Poisson approximation
inferred← citeshttps://doi.org/10.46298/dmtcs.447openalex-snapshot
Analysis of some parameters for random nodes in priority trees
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1195openalex-snapshot
Characterizing Internet Worm Infection Structure
inferred← citeshttps://doi.org/10.48550/arxiv.1308.5783openalex-snapshot
On the asymptotic behaviour of a dynamic version of the Neyman contagious point process
inferred← citeshttps://doi.org/10.48550/arxiv.1710.01402openalex-snapshot
On asymptotics of two non-uniform recursive tree models
inferred← citeshttps://doi.org/10.48550/arxiv.1801.04617openalex-snapshot
Some remarks on biased recursive trees
inferred← citeshttps://doi.org/10.48550/arxiv.1810.00969openalex-snapshot
On the discovery of the seed in uniform attachment trees
inferred← citeshttps://doi.org/10.48550/arxiv.2003.01902openalex-snapshot
Notes on Randomized Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.math/0608211openalex-snapshot
On the asymptotic behaviour of random recursive trees in random environment
inferred← citeshttps://doi.org/10.5167/uzh-133624openalex-snapshot
Percolating, cutting-down and scaling random trees
inferred← citeshttps://doi.org/10.5821/dissertation-2117-355670openalex-snapshot
A study on structure recovery and the broadcasting problem
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/9d79737azf4dcz4c02zad0bze5496612a428openalex-snapshot
Around a few statistics on binary search trees and on accessible deterministic automata
inferred← citeshttps://doi.org/10.70675/d2dd4ab5zaaecz4bc6za36fzc8bbe36b47cfopenalex-snapshot
Optimization, control, and game theoretical problems in consensus protocols
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.