Randomized search trees
From MaRDI portal
Recommendations
Cites work
- A guided tour of Chernoff bounds
- A note on the height of binary search trees
- A unifying look at data structures
- Biased Search Trees
- Binary Search Trees of Bounded Balance
- Fast Multiple-Precision Evaluation of Elementary Functions
- Four results on randomized incremental constructions
- scientific article; zbMATH DE number 410386 (Why is no real title available?)
- scientific article; zbMATH DE number 437541 (Why is no real title available?)
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 742971 (Why is no real title available?)
- Organization and maintenance of large ordered indexes
- Priority Search Trees
- Self-adjusting binary search trees
- Sorting jordan sequences in linear time using level-linked search trees
Cited in
(66)- Kinetic hanger
- An introduction to randomized algorithms
- Height balance distribution of search trees
- Average search and update costs in skip lists
- A constant update time finger search tree
- Randomized splay trees: Theoretical and experimental results.
- Radix sort trees in the large
- Distribution of distances in random binary search trees.
- Improved bounds for finger search on a RAM
- Towards a real time algorithm for parameterized longest common prefix computation
- The CB tree: a practical concurrent self-adjusting search tree
- Zip trees
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
- Finger search in grammar-compressed strings
- Reductions in binary search trees
- Smoothed analysis of binary search trees
- Building Cartesian trees from free trees with \(k\) leaves
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Self-adjusting trees in preactice for large text collections
- A history of distribution-sensitive data structures
- RANDOM HYPERPLANE SEARCH TREES IN HIGH DIMENSIONS
- Skip lift: a probabilistic alternative to red-black trees
- Should static search trees ever be unbalanced?
- Rank-Sensitive Priority Queues
- scientific article; zbMATH DE number 3852445 (Why is no real title available?)
- scientific article; zbMATH DE number 5560473 (Why is no real title available?)
- Maintaining Ideally Distributed Random Search Trees without Extra Space
- Biased Search Trees
- Two New Kinds of Biased Search Trees
- Straight-line programs: a practical test (extended abstract)
- Randomized binary search trees
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- Treaps
- Analysis of the space of search trees under the random insertion algorithm
- scientific article; zbMATH DE number 1305510 (Why is no real title available?)
- Random recursive forests
- Skip trees, an alternative data structure to skip lists in a concurrent approach
- Skip lift: a probabilistic alternative to red-black trees
- Randomization of search trees by subtree size
- Randomness Preserving Deletions on Special Binary Search Trees
- Dynamic Trees with Almost-Optimal Access Cost
- Zip Trees
- Balanced distributed search trees do not exist
- Balanced search trees made simple
- Multi-Finger Binary Search Trees
- Lock-free search data structures: throughput modeling with Poisson processes
- Smooth heaps and a dual view of self-adjusting data structures
- Median-of-k jumplists and dangling-min BSTs
- Markov incremental constructions
- Verified analysis of random binary tree structures
- Random binary search tree with equal elements
- Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
- A mathematical assessment of the isolation random forest method for anomaly detection in big data
- A kinetic triangulation scheme for moving points in the plane
- The analysis of range quickselect and related problems
- A simple dynamization of trapezoidal point location in planar subdivisions
- Tiny pointers
- Bottom-up rebalancing binary search trees by flipping a coin
- Online list labeling: breaking the ^2n barrier
- On the statistical properties of the isolation forest anomaly detection method
- Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
- Lazy B-trees
- B-treaps revised: write efficient randomized block search trees with high load
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Maintaining dynamic minimum spanning trees: an experimental study
- Deletions in random binary search trees: a story of errors
This page was built for publication: Randomized search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923861)
