Nearly optimal binary search trees
From MaRDI portal
Publication:1228353
DOI10.1007/BF00264563zbMath0333.68028WikidataQ126089533 ScholiaQ126089533MaRDI QIDQ1228353
Publication date: 1975
Published in: Acta Informatica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
On binary search trees, New lower bounds on the cost of binary search trees, Efficient Construction of Near-Optimal Binary and Multiway Search Trees, A new genetic approach to construct near-optimal binary search trees, A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs, Optimum multiway search trees, A study on splay trees, Demand-aware network designs of bounded degree, Binary search trees in secondary memory, Biased range trees, Unnamed Item, Greedy binary search trees are nearly optimal, Certifying 3-edge-connectivity, Pattern matching and consensus problems on weighted sequences and profiles, Dynamic hotlinks, Optimal binary search trees, Unnamed Item, Assembling approximately optimal binary search trees efficiently using arithmetics, Schranken für balanced trees bei ausgewogenen Verteilungen, Biased predecessor search, The power and limitations of static binary search trees with lazy finger, Extensions of self-improving sorters, On the max-entropy rule for a binary search tree, Dynamic weighted binary search trees, On the cost of unsuccessful searches in search trees with two-way comparisons, Towards Efficient Fully Randomized Message-Locked Encryption, Reflections on Optimal and Nearly Optimal Binary Search Trees, Restructuring binary search trees revisited, A History of Distribution-Sensitive Data Structures, Generalized binary split trees, Random Access to Grammar-Compressed Strings and Trees, Performances of an algorithm constructing a nearly optimal binary tree, A strategy for searching with different access costs., Competitive Online Search Trees on Trees, Universal retrieval trees
