Implementing dictionaries using binary trees of very small height
From MaRDI portal
Publication:1236885
DOI10.1016/0020-0190(76)90094-6zbMath0354.68063OpenAlexW2018097735MaRDI QIDQ1236885
Hermann Maurer, Hans-Werner Six, Thomas Ottmann
Publication date: 1976
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(76)90094-6
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
Binary search trees: How low can you go? ⋮ Balanced search trees made simple ⋮ Binary search trees of almost optimal height ⋮ Defining families of trees with E0L grammars ⋮ Dynamic Trees with Almost-Optimal Access Cost
Cites Work
This page was built for publication: Implementing dictionaries using binary trees of very small height