A Best Possible Bound for The Weighted Path Length of Binary Search Trees
From MaRDI portal
Publication:4136557
DOI10.1137/0206017zbMATH Open0362.68072DBLPjournals/siamcomp/Mehlhorn77OpenAlexW2000568806WikidataQ126089532 ScholiaQ126089532MaRDI QIDQ4136557FDOQ4136557
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0206017
General topics in the theory of software (68N01) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cited In (20)
- On binary search trees
- Competitive Online Search Trees on Trees
- Tight bounds for online stable sorting
- Dynamic Trees with Almost-Optimal Access Cost
- Compressing probability distributions
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- Lower bounds for expected-case planar point location
- Assembling approximately optimal binary search trees efficiently using arithmetics
- Compressed depth sequences
- Optimal binary search trees
- Binary search trees in secondary memory
- Greedy binary search trees are nearly optimal
- Restructuring binary search trees revisited
- Operations research applications of dichotomous search
- A new genetic approach to construct near-optimal binary search trees
- New lower bounds on the cost of binary search trees
- A History of Distribution-Sensitive Data Structures
- Optimum multiway search trees
- Title not available (Why is that?)
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
This page was built for publication: A Best Possible Bound for The Weighted Path Length of Binary Search Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136557)
