Reflections on Optimal and Nearly Optimal Binary Search Trees

DOI10.1007/978-3-642-03456-5_7zbMath1258.68046OpenAlexW2158433752MaRDI QIDQ3644717

J. Ian Munro

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_7

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the costs of optimal and near-optimal binary search trees
• Nearly optimal binary search trees
• New lower bounds on the cost of binary search trees
• On binary search trees
• Optimum binary search trees
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• A New Algorithm for Minimum Cost Binary Trees
• A Method for the Construction of Minimum-Redundancy Codes
• Recognition and parsing of context-free languages in time n3
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

This page was built for publication: Reflections on Optimal and Nearly Optimal Binary Search Trees