On random cartesian trees
From MaRDI portal
Publication:4286297
DOI10.1002/rsa.3240050205zbMath0792.05124OpenAlexW2171097166MaRDI QIDQ4286297
Publication date: 24 July 1994
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240050205
convex hullsrandom treesbinary search treesCartesian treesdivide-and-conquer algorithmsmaximal vectors
Related Items (2)
Maxima-finding algorithms for multidimensional samples: A two-phase approach ⋮ Random suffix search trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the expected time required to construct the outer layer
- On growing random binary trees
- Branching processes in the analysis of the heights of trees
- Applications of the theory of records in the study of random trees
- On the joint distribution of the insertion path length and the number of comparisons in search trees
- A note on finding convex hulls via maximal vectors
- The average height of binary trees and other simple trees
- Moment inequalities for random variables in computational geometry
- Divide and conquer for linear expected time
- Applications of random sampling in computational geometry. II
- On the average number of maximal in a set of vectors
- An efficient algorithm for determining the convex hull of a finite planar set
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- Priority Search Trees
- Exact and asymptotic distributions in digital and binary search trees
- A unifying look at data structures
- A note on the height of binary search trees
- On Finding the Maxima of a Set of Vectors
- A data structure for manipulating priority queues
- On the Average Number of Maxima in a Set of Vectors and Applications
- More Combinatorial Properties of Certain Trees
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: On random cartesian trees
