The geometry of binary search trees
From MaRDI portal
Recommendations
Cited in
(28)- Demand-aware network designs of bounded degree
- Upper bounds for maximally greedy binary search trees
- On minimum generalized Manhattan connections
- On the diameter of tree associahedra
- scientific article; zbMATH DE number 4047146 (Why is no real title available?)
- Competitive Online Search Trees on Trees
- scientific article; zbMATH DE number 7758335 (Why is no real title available?)
- scientific article; zbMATH DE number 7651167 (Why is no real title available?)
- Implementing geometric algebra products with binary trees
- Multi-Finger Binary Search Trees
- Analysis of smooth heaps and slim heaps
- Power-law behavior in geometric characteristics of full binary trees
- The Geometry of Generalized Binary Search
- Combining binary search trees
- Belga B-trees
- The group access bounds for binary search trees
- A geometric algebra implementation using binary tree
- Arboral satisfaction: recognition and LP approximation
- Greedy is an almost optimal deque
- scientific article; zbMATH DE number 7651207 (Why is no real title available?)
- Hardness amplification for dynamic binary search trees
- Efficiency of self-adjusting heaps
- Weighted dynamic finger in binary search trees
- Dynamic Optimality—Almost
- A study on splay trees
- Better analysis of binary search tree on decomposable sequences
- Smooth heaps and a dual view of self-adjusting data structures
- Diameter estimates for graph associahedra
This page was built for publication: The geometry of binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633860)
