Optimum lopsided binary trees

DOI10.1145/65950.65955MaRDI QIDQ4710685zbMATH OpenOpenAlexFDO

Authors Sanjiv Kapoor, Edward M. Reingold

Publication date 25 June 1992

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/65950.65955

zbMATH Keywords

algorithmic analysisbinary search treescoding theorydata structureedge-weighted treesFibonacci numbersFibonacci treesinformation theoryKraft's inequalityminimax recurrence relationsoptimal treespath lengthsprefix-free codesunbounded search

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal worst case trees
• Expected Costs in Some Classes of Binary Search Trees
• scientific article; zbMATH DE number 2102776
• Binary search trees with binary comparison cost
• Lopsided trees. I: Analyses

Cited in

(15)

• Optimal worst case trees
• Optimal point-to-point broadcast algorithms via lopsided trees
• An asymptotic theory for recurrence relations based on minimization and maximization.
• Operations research applications of dichotomous search
• Solutions of two minmax recurrences in parallel processing with variable recombination overhead
• On the cost of optimal alphabetic code trees with unequal letter costs
• Expected Costs in Some Classes of Binary Search Trees
• Binary search trees with binary comparison cost
• F-Chord: Improved uniform routing on Chord
• scientific article; zbMATH DE number 3909754 (Why is no real title available?)
• A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
• scientific article; zbMATH DE number 2102776 (Why is no real title available?)
• The Optimization of Signed Trees
• Lopsided trees. I: Analyses
• Binary trees with choosable edge lengths

This page was built for publication: Optimum lopsided binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4710685)