1994•Acta InformaticaRequires access
Optimal search trees using two-way key comparisons
David Spuler
Open publisher page 16 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
David Spuler
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Optimal binary search tree, Binary search tree, Ternary search tree, K-ary tree, Binary tree, Tree (set theory), Random binary tree, Interval tree