Randomized search trees
From MaRDI portal
Publication:1923861
DOI10.1007/BF01940876zbMATH Open0857.68030OpenAlexW2099844038MaRDI QIDQ1923861FDOQ1923861
Authors: Yanyan Li 
Publication date: 18 February 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01940876
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10)
Cites Work
- Self-adjusting binary search trees
- A note on the height of binary search trees
- Four results on randomized incremental constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Priority Search Trees
- A guided tour of Chernoff bounds
- A unifying look at data structures
- Binary Search Trees of Bounded Balance
- Fast Multiple-Precision Evaluation of Elementary Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Organization and maintenance of large ordered indexes
- Biased Search Trees
- Sorting jordan sequences in linear time using level-linked search trees
- Title not available (Why is that?)
Cited In (55)
- A mathematical assessment of the isolation random forest method for anomaly detection in big data
- Finger search in grammar-compressed strings
- Randomized splay trees: Theoretical and experimental results.
- Average search and update costs in skip lists
- Random binary trees: from the average case analysis to the asymptotics of distributions
- Two New Kinds of Biased Search Trees
- Towards a real time algorithm for parameterized longest common prefix computation
- Maintaining dynamic minimum spanning trees: an experimental study
- Deletions in random binary search trees: a story of errors
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Median-of-\(k\) jumplists and dangling-min BSTs
- Maintaining Ideally Distributed Random Search Trees without Extra Space
- Skip lift: a probabilistic alternative to red-black trees
- Height balance distribution of search trees
- Building Cartesian trees from free trees with \(k\) leaves
- Rank-Sensitive Priority Queues
- Dynamic Trees with Almost-Optimal Access Cost
- Should static search trees ever be unbalanced?
- Title not available (Why is that?)
- Smoothed analysis of binary search trees
- Title not available (Why is that?)
- Distribution of distances in random binary search trees.
- Skip trees, an alternative data structure to skip lists in a concurrent approach
- Randomness Preserving Deletions on Special Binary Search Trees
- Random recursive forests
- Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
- Skip lift: a probabilistic alternative to red-black trees
- Reductions in binary search trees
- Random binary search tree with equal elements
- The CB tree: a practical concurrent self-adjusting search tree
- Lock-free search data structures: throughput modeling with Poisson processes
- Multi-Finger Binary Search Trees
- A history of distribution-sensitive data structures
- RANDOM HYPERPLANE SEARCH TREES IN HIGH DIMENSIONS
- Kinetic hanger
- Verified analysis of random binary tree structures
- Balanced search trees made simple
- A kinetic triangulation scheme for moving points in the plane
- Biased Search Trees
- A constant update time finger search tree
- Analysis of the space of search trees under the random insertion algorithm
- Title not available (Why is that?)
- Randomized binary search trees
- Improved bounds for finger search on a RAM
- Balanced distributed search trees do not exist
- The analysis of range quickselect and related problems
- Self-adjusting trees in preactice for large text collections
- An introduction to randomized algorithms
- Title not available (Why is that?)
- Straight-line programs: a practical test (extended abstract)
- Smooth heaps and a dual view of self-adjusting data structures
- Randomization of search trees by subtree size
- Radix sort trees in the large
- Markov incremental constructions
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
Uses Software
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)
