scientific article; zbMATH DE number 1305510
From MaRDI portal
Publication:4252401
Recommendations
- Randomized splay trees: Theoretical and experimental results.
- Randomized binary search trees
- Randomized search trees
- A study on splay trees
- On the Generation of Random Binary Search Trees
- Random hyperplane search trees
- Random suffix search trees
- Inorder traversal of splay trees
- Extremely randomized trees
Cited in
(10)- Randomized splay trees: Theoretical and experimental results.
- Radix sort trees in the large
- Randomized search trees
- Self-adjusting trees in preactice for large text collections
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
- Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
- scientific article; zbMATH DE number 910910 (Why is no real title available?)
- Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
- Bottom-up rebalancing binary search trees by flipping a coin
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252401)
