2011•Lecture notes in computer scienceRequires access
Upper Bounds for Maximally Greedy Binary Search Trees
Kyle J. Fox
Open publisher page 14 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Kyle J. Fox
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 14 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: Binary search tree, Optimal binary search tree, Computer science, Connection (principal bundle), Upper and lower bounds, Binary number, Combinatorics, Lemma (botany)